All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
The Party Shakers (Posted on 2003-05-22) Difficulty: 3 of 5
As the people arrived at the party, they had to greet everyone they knew in the hall with a handshake.

Show that at every moment, there were 2 people at the party who had shaken hands the same number of times.

See The Solution Submitted by Fernando    
Rating: 2.8333 (6 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution Comment 2 of 2 |
For n guests, the minimum number of people that one can shake hands with is zero, while the maximum number is n-1 (you aren’t shaking hands with yourself, after all). However, these two conditions are mutually exclusive, because if one person has shaken the hands of all of the n-1 other guests, another person cannot have shaken nobody’s hand, and vice versa. Therefore, for n guests, there are only n-1 possible number of handshakes, so at least two partiers must have the same number of handshakes.
  Posted by Bryan on 2003-05-22 04:43:20
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information