New user? Sign up

Existing user? Sign in

In how many ways a cube can be colored with n different colors such that no 2 neighboring or adjacent faces are colored with same color?

Note by Abdullah Ahmed 9 months, 3 weeks ago

Sort by:

I have solved it .

Log in to reply

Great! How would you explain the approach?

Isn't the formula 1/24(n^6+12n^3+3 n^4+8n^2)? I know it from Burnside's lemma. but in the question two adjacent sides are not colored with same color. so what is the general formula for it? @Calvin Lin

What have you tried?

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestI have solved it .

Log in to reply

Great! How would you explain the approach?

Log in to reply

Isn't the formula 1/24(n^6+12n^3+3 n^4+8n^2)? I know it from Burnside's lemma. but in the question two adjacent sides are not colored with same color. so what is the general formula for it? @Calvin Lin

Log in to reply

What have you tried?

Log in to reply