This is the second proof problem I am posting. Try these problems and post your working. I will eventually post my solution to all of these notes, named "Olympiad Proof Problems", three days after I post them. So here is the problem.
Consider any ten distinct points , , in the square of unit side length. Prove that one can find a pair of points among those ten such that their distance is atmost units.
Try more proof problems from this set Olympiad Proof Problems
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Divide the unit square into 9 small squares of side length 31 . 10 points are to be chosen within the unit square which means that there will be at least one small square with more than 1 point. The maximum distance between any two points in such a square is when they are at diagonally opposite points of that square. By the Pythagorean theorem this distance is 32 .
Log in to reply
Nice solution!! (+1)
Log in to reply
It's just PHP followed by Pythagoras Theorem. Great solution BTW. +1
Awesome solution!
Here is a variant of the above question:
Consider a equilateral triangular dartboard of side 2ft. If you throw five darts with no misses, then show that at least two will be within one feet of each other.
Pakistan First Round 2015
Log in to reply
Once again, PHP followed by some simple maths.
Connect the medians of the triangle to create for equilateral triangles of side length 1ft. Now, at least 2 darts go into on of these triangles by PHP. The furthest distance 2 points can be separated in an equilateral triangle is the 2 vertices (pick any other 2 points and they are closer). This length is the side length, which is 1ft. Therefore, at least 2 darts are within 1ft of each other.
(Note: PHP stands for Pigeonhole Principle (or as I like to call it 'Penguin-hole Principle')
Log in to reply
I like to call it Pig-on-hole Principle.
Easy PHP!
Extremal Principle!!
Log in to reply
Actually I solved it in the paper with PHP..
Log in to reply
Log in to reply
ni shuo sha?
Log in to reply
What? English, please.
Nándào nǐ bù zhīdào yīngyǔ