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. /Ten different two-digit numbers are written on cards, for example 13, 27, 31, 44, 52, 68, 70, 85…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryproofNumericalOlympiad

Ten different two-digit numbers are written on cards, for example 13, 27, 31, 44, 52, 68, 70, 85…

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.

Ten different two-digit numbers are written on cards, for example 13, 27, 31, 44, 52, 68, 70, 85, 91, 99. Prove that, whatever the ten numbers are, you can always make two groups of cards with no card in both groups and with equal totals.

Count the groups (non-empty subsets) of the ten cards, and find the largest total that a group can have. Compare the two counts with the pigeonhole principle. Then explain how to remove the cards that two equal-total groups share.

Check your answer

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

Need a reminder? The key ideaShowHide

Remainders on division by mmm are mmm boxes. The prefix sums S0=0,S1,…,SmS_0 = 0, S_1, \dots, S_mS0​=0,S1​,…,Sm​ give a block with a sum divisible by mmm. Cut a figure into pieces: two points in one piece are close.

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.

Plan. There are more groups than possible totals, so two groups share a total. Then make them disjoint.

Step 1. Count the groups. Ten cards have 210=10242^{10} = 1024210=1024 subsets, so 102310231023 non-empty groups.

Step 2. The possible totals. A group's total is at least 101010 and at most 90+91+⋯+99=94590 + 91 + \dots + 99 = 94590+91+⋯+99=945. So there are at most 945−10+1=936945 - 10 + 1 = 936945−10+1=936 possible totals.

Step 3. Pigeonholes. 102310231023 groups and at most 936936936 totals: two different groups AAA and BBB have the same total.

Step 4. Make them disjoint. Remove from both the cards they share. Both totals drop by the same amount, so they stay equal. Neither group becomes empty: if AAA lost all its cards, AAA would lie inside BBB, and then BBB would have a larger total, because B≠AB \ne AB=A and all numbers are positive.

Answer: 102310231023 groups but at most 945945945 as a total, so two disjoint groups with equal totals always exist. Proof complete.

Log in to save this for later
← All Problems
← Ravi notices that 3⁴ = 81 ends in 1 and 3²⁰ = 3486784401 ends in 01…A garden path is a row of 14 paving slabs… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Pigeonholes in numbers and geometryThe Pigeonhole Principle

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 →