2007 AMC 12B Problems/Problem 16
Each face of a regular tetrahedron is painted either red, white, or blue. Two colorings are considered indistinguishable if two congruent tetrahedra with those colorings can be rotated so that their appearances are identical. How many distinguishable colorings are possible?
A tetrahedron has 4 sides. The ratio of the number of faces with each color must be one of the following:
, , , or
The first ratio yields appearances, one of each color.
The second ratio yields appearances, three choices for the first color, and two choices for the second.
The third ratio yields appearances since the two colors are interchangeable.
The fourth ratio yields appearances. There are three choices for the first color, and since the second two colors are interchangeable, there is only one distinguishable pair that fits them.
The total is appearances
Every colouring can be represented in the form , where is the number of white faces, is the number of red faces, and is the number of blue faces. Every distinguishable colouring pattern can be represented like this in exactly one way, and every ordered whole number triple with a total sum of 4 represents exactly one colouring pattern (if two tetrahedra have rearranged colours on their faces, it is always possible to rotate one so that it matches the other).
Therefore, the number of colourings is equal to the number of ways 3 distinguishable nonnegative integers can add to 4. If you have 6 cockroaches in a row, this number is equal to the number of ways to pick two of the cockroaches to eat for dinner (because the remaining cockroaches in between are separated in to three sections with a non-negative number of cockroaches each), which is
|2007 AMC 12B (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25|
|All AMC 12 Problems and Solutions|