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. /A class of 50 students takes a quiz marked out of 10…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalOlympiad

A class of 50 students takes a quiz marked out of 10…

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.

A class of 505050 students takes a quiz marked out of 101010. Every score is a whole number from 000 to 101010. The teacher notices that several students got the same score, and she asks how many must share a score whatever the results.

Find the largest number ttt such that some score is always shared by at least ttt students. Then find the smallest class size that makes sure some score is shared by at least 666 students. Explain both answers with the generalised pigeonhole principle.

Check your answer

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

Need a reminder? The key ideaShowHide

NNN objects in kkk boxes put at least ⌈Nk⌉\left\lceil \dfrac{N}{k} \right\rceil⌈kN​⌉ in some box. To force rrr objects into one of kkk boxes you need k(r−1)+1k(r - 1) + 1k(r−1)+1. Some number in a list is at least the average.

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.

Given. 505050 students, scores 000 to 101010.

Plan. The scores are the boxes. Use ⌈Nk⌉\left\lceil \dfrac{N}{k} \right\rceil⌈kN​⌉ and k(r−1)+1k(r - 1) + 1k(r−1)+1.

Step 1. The boxes. The scores 0,1,…,100, 1, \dots, 100,1,…,10 are 111111 boxes.

Step 2. Shared by how many. 5011=4.55\dfrac{50}{11} = 4.551150​=4.55, so some score is shared by at least ⌈4.55⌉=5\lceil 4.55 \rceil = 5⌈4.55⌉=5 students.

Step 3. Five is the most we can promise. Six students could not be promised: give 555 students each to 666 scores and 444 students each to the other 555 scores. That is 30+20=5030 + 20 = 5030+20=50 students, and no score has 666.

Step 4. Forcing six. The worst case puts 555 students on each of the 111111 scores, which is 555555 students. One more student forces 666 on some score. So the class size is 11×5+1=5611 \times 5 + 1 = 5611×5+1=56.

Check. A common slip uses 101010 scores and gets ⌈5⌉=5\lceil 5 \rceil = 5⌈5⌉=5 and 515151. The score 000 is a box too.

Answer: t=5t = 5t=5, and a class of 565656 students forces 666 on one score.

Log in to save this for later
← All Problems
← Every point of a grid with 3 rows and 7 columns is painted red or blue…Ten students of different heights stand in a line in some order… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. The generalised pigeonhole principleThe 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 →