There are n people who can shake hands with one another (where n > 1). Use...

70.2K

Verified Solution

Question

Advance Math

There are n people who can shake hands with one another (where n> 1). Use pigeonhole principle to show that there is always apair of people who will shake hands with the same number ofpeople.

Hint. Pigeonhole principle does not immediately apply to thisproblem. Solve the problem for two cases:

(1) There is no person who shakes hands with everyone else (allhandshake numbers are strictly less than n ? 1). Easy case.

(2) There is a person who shakes hands with everyone else (hand-shake number is n ? 1). What can you say about handshake numbersfor everyone else?

Answer & Explanation Solved by verified expert
4.0 Ratings (783 Votes)
Pigeonhole principle It States that if n items are put into m containers with nm then at least one container must contain more than one item From the above question we can consider as    See Answer
Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:
  • Unlimited Question Access with detailed Answers
  • Zin AI - 3 Million Words
  • 10 Dall-E 3 Images
  • 20 Plot Generations
  • Conversation with Dialogue Memory
  • No Ads, Ever!
  • Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
Become a Member

Other questions asked by students