SOLUTION: Why do we divide (n-1)! by 2 in key ring problems in circular permutation?

Question 939054: Why do we divide (n-1)! by 2 in key ring problems in circular permutation?
Answer by mathmate(429) (Show Source): You can put this solution on YOUR website!

In a circular table problem, n people sit around the table in (n-1)! ways.
A sitting on the left of B counts as different from A sitting on the right of B.

The key-ring problem is similar to the circular table problem, except that the key ring can be reversed any time we want, so the left/right does not count any more. Therefore the number of permutations has to be divided by two, giving (n-1)!/2.
RELATED QUESTIONS
Why do you divide by two in the formula n/2(3n-1) (answered by josgarithmetic)

Why do we divide by 2 when solving problems involving gravity, 32 feet per second per... (answered by Fombitz,Alan3354)

In the formula Σ (x � �) ^2/n for the variance, in what cases would we divide by n-1 (answered by jim_thompson5910,Edwin McCravy)

I am having trouble figuring out how to use the identity property of 1 (how it works) on... (answered by rapaljer)

In calculating combination and permutation, we have to leverage factorials. For example,... (answered by richard1234)

in percentage problems why do we need to subtract from 100 in some... (answered by rothauserc)

why are the two types of circular permutations different?in case of beads (n-1)! is used... (answered by stanbon)

Why do we flip the inequality sign when we divide by a negative number? (answered by rapaljer)

How to find n in... (answered by AnlytcPhil)