2007 AMC 12B Problem 16
Problem 16 of 25IntermediateCounting & Probability
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?
Answer choices
Show solution
Solution
The rotation group of the tetrahedron has elements: the identity, rotations of order about a vertex-face axis, and rotations of order about an edge-midpoint axis.
The identity fixes all colorings. Each vertex rotation fixes one face and cycles the other three, so it fixes colorings; likewise each edge rotation swaps two pairs of faces and fixes
By Burnside’s lemma the number of distinguishable colorings is
Thus, the correct answer is A.