Elementary Statistics: A Step-by-Step Approach with Formula Card 9th Edition

Published by McGraw-Hill Education
ISBN 10: 0078136334
ISBN 13: 978-0-07813-633-7

Chapter 4 - Probability and Counting Rules - 4-4 Counting Rules - Extending the Concepts - Page 237: 68


2, 6, $(n-1)!$

Work Step by Step

As the people will form a circle, we can fix one position and think the problem as arranging the rest $n-1$ members. The next seat after fixing the first one has $n-1$ choices, and the next one $n-2$ choices and so on. So the total number of ways is: $(n-1)!$ For example, n=3, #ways = 2; n=4, #ways=6, etc.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.