How many distinct colorings can be obtained when using 6 different colors to color the faces of a 3D-cube (one face - one color)? Two colorings are identical if they can be obtained by rotation (but not reflection).
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Good approaches!
While Burnside's lemma is an overkill for this problem, it often produces (one of) the easiest way to think about the problem. For example, in this case, once we fix the bottom side as red, then there are 4 ways of rotating the cube, and 5 sides to color, so the answer is 4 5 ! .
Challenge master note: Now calculate how many ways there are of colouring a cube using 6 OR LESS different colours.
Log in to reply
I assume you mean there are 6 colors, but sides don't need distinct colors. (So that coloring all sides with red and coloring all sides with blue are different, even though they both use only 1 color.)
Just use Burnside's lemma again. There are 6 6 elements in X . Among the elements of G , there are:
In total, that's:
∣ X / G ∣ = ∣ G ∣ 1 g ∈ G ∑ ∣ X g ∣ = 2 4 1 ⋅ ( 1 ⋅ 6 6 + 6 ⋅ 6 3 + 3 ⋅ 6 4 + 8 ⋅ 6 2 + 6 ⋅ 6 3 ) = 2 2 2 6
I'd misunderstood the problem to mean that in the first place. Whoops. ie, I read 6 different colors as in "6 possible colors they could be colored with" and ended up burnsiding my way through that instead of the original problem. ^_^
I thought I can use up to seven different colors. I think you should emphasize that. "One face, one color" could be understood that no face shows two colors.
OVERKILL is truly an OVERKILL!!!!!
Hope I could have seen (one face-one color) !! ( Ended up getting 2226 always) :(
What if rotation and reflection are both count as identical? If we're using Burnside's lemma, what's the number of reflectional symmetry for the cube?
Problem Loading...
Note Loading...
Set Loading...
The hard way
Since rotation doesn't matter, we can fix the color of the top face as, say, red. Pick another color, say, blue. There are two possibilities:
Case 1 : Blue is adjacent to red.
Since we can rotate the cube, we can assume blue is the front face. Now the cube's orientation is fixed; there are 4 ! = 2 4 ways to color the remaining four faces with four colors.
Case 2 : Blue is opposite of red.
Pick another color, say, green. This must be adjacent to red (there's no other available face). Using like in Case 1, we can fix the orientation by letting green to be the front face; there are 3 ! = 6 ways to do the rest.
In total, that's 2 4 + 6 = 3 0 ways.
The easy way
Any coloring can give rise to 6 ⋅ 4 = 2 4 orientations: 6 ways to fix the top face (any side can be used), and 4 ways to fix the front face (any side other than the top and the bottom faces can be used). There are 6 ! = 7 2 0 ways to color the cube without taking rotation into account. We can group them into sets of 24, where in a set, all cubes can become the others by rotation. There are 2 4 7 2 0 = 3 0 sets, and this is also the number of distinct colorings (that cannot be obtained through rotation).
The overkill way
This is a way to make the "easy" way more rigorous. Let X be the set of all colorings of the cube without rotation (there are 6 ! = 7 2 0 such ways). Let G be the group of rotations on a cube (it has 6 ⋅ 4 = 2 4 elements as above). Now, the number of distinct colorings on the cube is simply the number of orbits of G acting on X , or ∣ X / G ∣ . This is given by Burnside's lemma :
∣ X / G ∣ = ∣ G ∣ 1 g ∈ G ∑ ∣ X g ∣
where X g is the set of elements that are fixed by g ; that is, the set of colorings that don't change upon rotation by g .
If there are identical colors, X g might be nonempty even for some rotation g . However, because all faces have distinct colors, rotating the cube will always give a different coloring, so there is no fixed points; that is, X g = ∅ for all non-identity g . When g is the identity rotation (aka no rotation), X g is simply X (every element is fixed under the identity transformation). Thus we obtain:
∣ X / G ∣ = ∣ G ∣ 1 g ∈ G ∑ ∣ X g ∣ = ∣ G ∣ 1 ⋅ ∣ X ∣ = 2 4 1 ⋅ 7 2 0 = 3 0