Baltic Way 1994 · Problem 16
Combinatorics
The Wonder Island is inhabited by Hedgehogs. Each Hedgehog consists of three segments of unit length having a common endpoint, with all three angles between them equal to (see figure).
Given that all Hedgehogs are lying flat on the island and no two of them touch each other, prove that there is a finite number of Hedgehogs on Wonder Island.
When you’re ready
Review material becomes available with the next Daily.
Review
Topics
Graph theory
Solutions
Solution
Solution:
It suffices to prove that if the distance between the centres of two Hedgehogs is less than , then these Hedgehogs intersect. To show this, consider two Hedgehogs with their centres at points and , respectively, such that . Let , and be the endpoints of the needles of the first Hedgehog (see Figure 4) and draw a straight line parallel to through the point . As implies and the second Hedgehog has at least one of its needles pointing inside the triangle , this needle intersects the first Hedgehog.
Figure 4
Contest context
Results from Baltic Way 1994
9 teams
- Mean score
- 2.7 / 5
- Scores of 4 or 5
- 3 / 9
- Estonia
- 0 / 5
Score distribution
All team scores
| Team | Score |
|---|---|
| St. Petersburg | 5 / 5 |
| Latvia | 3 / 5 |
| Poland | 3 / 5 |
| Sweden | 5 / 5 |
| Denmark | 1 / 5 |
| Estonia | 0 / 5 |
| Finland | 3 / 5 |
| Lithuania | 0 / 5 |
| Iceland | 4 / 5 |