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 cupboard holds 6 pairs of black gloves and 4 pairs of brown gloves, 20 gloves in all…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalreasoningOlympiad

A cupboard holds 6 pairs of black gloves and 4 pairs of brown gloves, 20 gloves in all…

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 cupboard holds 666 pairs of black gloves and 444 pairs of brown gloves, 202020 gloves in all. Every pair has one left glove and one right glove, and gloves of one colour are otherwise alike. The light has failed, so Farah takes gloves out one at a time without seeing them. She wants a pair she can wear: one left glove and one right glove of the same colour.

Find the fewest gloves she must take to be sure of two gloves of the same colour. Then find the fewest she must take to be sure of a pair she can wear. For each answer, describe an unlucky draw that shows one glove fewer is not enough.

Check your answer

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

Need a reminder? The key ideaShowHide

If n+1n + 1n+1 objects go into nnn boxes, some box holds at least two. Decide what the objects and the boxes are. A "fewest number" answer needs a proof that it is enough and an example showing that one fewer can fail.

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. 666 black pairs and 444 brown pairs. A wearable pair is a left and a right glove of one colour.

Plan. Find the worst draw with no success. The answer is one more than its size.

Step 1. Two of one colour. With 222 gloves she may hold one black and one brown. A third glove must repeat a colour, because there are only 222 colours. So 333 gloves are enough and 222 are not.

Step 2. The worst draw for a wearable pair. In each colour she may take gloves of one hand only. The most she can hold that way is 666 black left gloves and 444 brown left gloves, which is 101010 gloves and no wearable pair.

Step 3. The next glove. After those 101010 gloves only right gloves are left. The 111111th glove is a right glove of some colour, and she already holds every left glove of that colour. So 111111 gloves are enough.

Step 4. No smaller number works in general. Step 2 shows a draw of 101010 gloves with no pair. Any draw with no pair has at most one hand per colour, so at most 6+4=106 + 4 = 106+4=10 gloves.

Check. The answer 111111 is far bigger than 333. The extra demand (left and right) is what costs the gloves.

Answer: 333 gloves for two of one colour, and 111111 gloves for a wearable pair.

Log in to save this for later
← All Problems
← The equation x⁴ - 12x³ + ax² - bx + 81 = 0; has four positive real roots…A teacher writes some whole numbers on the board… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

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