Eight people are sitting around a circular table, each holding a fair coin. All eight people flip their coins and those who flip heads stand while those who flip tails remain seated. What is the probability that no two adjacent people will stand?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
Count circular strings with no two adjacent 1s: fix person 1; seated gives a line of 7 (34 ways), standing gives a line of 5 (13 ways), total 47.
Solution
All head/tail patterns are equally likely, so we count the patterns in which no two neighbors around the circle both stand.
First a lemma for people in a row. Let be the number of ways to choose who stands among people in a line with no two neighbors standing. Look at the last person: if seated, the first people can be anything valid ( ways); if standing, the previous person must sit and the first are free ( ways). So with , , giving
Now break the circle at person .
- Person sits. Persons through form a row of with no wrap-around constraint left: ways.
- Person stands. Then persons and must sit, and persons through form a free row of : ways.
Total patterns, so the probability is
The answer is .
Why this works
"No two adjacent" in a row is the classic Fibonacci-type recursion: decide the last element and the problem shrinks by one or two. A circle adds a single wrap-around condition, and fixing one position removes it, leaving one or two row problems. The resulting count for a cycle of is the Lucas number , here .
Alternative approach
Casework on how many people stand. With : way. : . : (remove the adjacent pairs). : (remove triples containing exactly one adjacent pair and the consecutive triples). : only the two alternating patterns. Sum .
The trap
Treating the eight seats as a row (55 arrangements) and ignoring that the first and last people are also neighbors.
Common mistakes
- Treating the eight seats as a row ( arrangements) and ignoring that the first and last people are also neighbors.
- Starting the recursion with , instead of and , which shifts every count by one Fibonacci term.
- In the casework method, miscounting the three-person case (for instance forgetting the consecutive triples) and landing on or .
Techniques
Split into exhaustive cases and handle each · Define states/recurrence and iterate