A discrete mathematics problem by Anthony Pham

Discrete Mathematics Level pending

I have a Megaminx! It is a dodecahedron, with 12 congruent pentagons. If I peeled the stickers, how many distinguishable(yet complete) dodecahedrons can I make?

Note: Distinguishable means that rotation and reflection doesn't matter.

×

Problem Loading...

Note Loading...

Set Loading...