Suppose we are to colour edges of a regular n-gon with k-colours. How do we count the number of such distinct coloured n-gons?
I know that one way to count these is to use burnside's lemma, but im not able to apply it.
Asked
Active
Viewed 38 times
0
-
1There is this fact sheet on necklaces and bracelets. – Marko Riedel Dec 27 '19 at 16:01
-
@MarkoRiedel Thanks! – hello_123 Dec 27 '19 at 16:33