Difference between revisions of "1997 JBMO Problems/Problem 1"
(Solution 2) |
m (→Solution 2) |
||
(One intermediate revision by the same user not shown) | |||
Line 17: | Line 17: | ||
== Solution 2 == | == Solution 2 == | ||
<asy> | <asy> | ||
− | draw((0, 0--(10,0)--(10,10)--(0,10)--cycle); | + | draw((0, 0)--(10,0)--(10,10)--(0,10)--cycle); |
draw((0, 2.5)--(10, 2.5),dotted); | draw((0, 2.5)--(10, 2.5),dotted); | ||
draw((0, 5)--(10,5),dotted); | draw((0, 5)--(10,5),dotted); |
Latest revision as of 10:39, 30 May 2020
Contents
Problem
Show that given any 9 points inside a square of side length 1 we can always find 3 that form a triangle with area less than .
Solution 1
Divide up the square into four congruent squares, as seen in the diagram. By the Pigeonhole Principle, at least one square has at least three points.
The maximum possible area of a triangle from three points on the square with side length is , and this is achieved when two of the points are on two adjacent corners and the third one is on the opposite side. However, since only one corner is truly inside the square, only one of the points can be on the corner, so the area of the triangle would be less than .
Solution 2
We proceed in a similar way to Solution 1. The maximum possible area of a triangle from three points on a rectangle is . However, for this to happen, all three points must be on an edge, so they are not inside the square. Thus, the area is less than .-Trex4days
See Also
1997 JBMO (Problems • Resources) | ||
Preceded by First Problem |
Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 | ||
All JBMO Problems and Solutions |