HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /At a meeting each delegate shakes hands with some of the others, never twice with the same person…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryproofNumericalOlympiad

At a meeting each delegate shakes hands with some of the others, never twice with the same person…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

At a meeting each delegate shakes hands with some of the others, never twice with the same person. The organiser wants every delegate to shake hands with exactly 333 others.

Prove that this is impossible with 151515 delegates. Then show that it is possible with 161616 delegates by describing an arrangement, and find the number of handshakes in that case. Use the handshake lemma, and explain each step in words.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

The degrees add up to twice the number of edges, so the number of odd vertices is even. KnK_nKn​ has (n2)\dbinom{n}{2}(2n​) edges. A simple graph on nnn vertices with more than (n−12)\dbinom{n - 1}{2}(2n−1​) edges is connected.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. The model. Delegates are vertices and handshakes are edges. Each delegate has degree 333.

Step 2. Fifteen delegates. The degrees add up to 15×3=4515 \times 3 = 4515×3=45. By the handshake lemma this sum equals 2E2E2E, which is even. But 454545 is odd. So the arrangement is impossible.

Step 3. Sixteen delegates. Split them into 444 groups of 444, and let everyone shake hands with the other 333 in their group. Each group is a copy of K4K_4K4​, so every delegate shakes exactly 333 hands.

Step 4. Count. The degrees add up to 16×3=48=2E16 \times 3 = 48 = 2E16×3=48=2E, so there are 242424 handshakes. Each K4K_4K4​ has 666 edges, and 4×6=244 \times 6 = 244×6=24 agrees.

Answer: impossible for 151515 delegates; 242424 handshakes for 161616. Proof complete.

Log in to save this for later
← All Problems
← A convex polygon with 9 sides is to be cut into triangles by drawing diagonals that do not cross…A simple graph has exactly 12 edges. Three of its vertices have degree 4, and every other vertex… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Graphs, degrees and the handshake lemmaGraph Theory

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  3. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  4. The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…
Advanced
  • A river town has five land areas, A, B, C, D and E, joined by ten bridges…Hard
  • All problems on this topic →