10182

# Counting Necklaces

A necklace is an -coloring of the vertices of a regular -gon. The vertices are interpreted as the beads of the necklace. This Demonstration shows the computations involved in using Burnside's lemma to count the number of -bead necklaces for through . Several examples are provided to clarify the notation used and illustrate necklaces fixed by rotation or reflection.

### DETAILS

Two necklaces are considered different under a group action if no action by a group element sends one necklace to the other. The number of different necklaces using colors under is , where is Euler's totient function. Under the number is ) if is even and ) if is odd. The reason for the difference in formulas for odd and even when allowing reflections is the difference in the axes of reflective symmetry (see snapshots 3–5).
Note that in each step of the computation, the exponent on for the number of necklaces fixed is the sum of the exponents from the cycle type of the corresponding permutation (see snapshots 1 and 2).

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.