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 metal plate is an equilateral triangle with sides of 4 cm…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryproofNumericalOlympiad

A metal plate is an equilateral triangle with sides of 4 cm…

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 metal plate is an equilateral triangle with sides of 444 cm. A machine punches 555 small holes into it, anywhere on the plate or on its edges. Treat each hole as a point.

Prove that two of the holes are at most 222 cm apart. Cut the triangle by joining the midpoints of its sides, and use the pigeonhole principle. State how many small triangles the cut gives, their side length, and the distance you can promise.

Check your answer

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

cm
cm
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. Cut the plate into pieces of side 222 cm. Five holes in four pieces put two holes in one piece.

Step 1. The cut. The three segments joining the midpoints split the plate into 444 equilateral triangles of side 222 cm. Each point of the plate lies in at least one of them. A point on a shared edge is put in either one.

Step 2. Pigeonholes. Five holes and four small triangles: two holes lie in the same small triangle.

Step 3. The distance. Any two points of an equilateral triangle of side 222 cm are at most 222 cm apart. The farthest pair is two corners.

Check. Four holes are not enough for this promise. Put them at the three corners and at the centre of the plate. The centre is 43≈2.31\dfrac{4}{\sqrt{3}} \approx 2.313​4​≈2.31 cm from each corner, and the corners are 444 cm apart, so no two holes are within 222 cm.

Answer: 444 small triangles of side 222 cm, so two holes are at most 222 cm apart. Proof complete.

Log in to save this for later
← All Problems
← The numbers 1, 2, …, 12 are written round a circle in any order, like a clock face that has been…A set of whole numbers is chosen from 1 to 100… →
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 →