Coloring the faces of a regular tetrahedron with 3 colors using Burnside's lemma

729 Views Asked by At

I have to determine the number of ways the faces of a regular tetrahedron can be colored with three colors. I already know it is 15, but apparently the math professor did not find the solution to his liking. I need to use group theory and Burnside's lemma to explain how you determine the number of ways the faces of regular tetrahedron can colored with three colors. What I understand: the basics of abstract algebra/group theory, but not much about how to apply group theory to solve this specific problem.