Question: We wish to count the number of ways to attach n distinct beads to the corners of a regular n-gon (or string them on a necklace). We say that two lists of the n beads are equivalent if each bead is adjacent to exactly the same beads in both lists. (The first bead in the list is considered to be adjacent to the last.)
• How does this exercise differ from the previous exercise?
• How many lists are in an equivalence class?
• How many equivalence classes are there?