🔴 Riddle #234 of 240
At a party of n guests (n ≥ 2), some pairs of guests shake hands (each pair at most once, nobody shakes their own hand). Prove that there must be two guests who have shaken hands exactly the same number of times.
Think about it first. When you're ready:
Yes: two guests always share a count
Counts 0 and n − 1 cannot both occur, so n guests share at most n − 1 distinct values and pigeonhole forces a repeat.