Daily

Random

Practice set

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 120∘120^{\circ} (see figure).

Hedgehog diagram shown beside Problem 16; statement also defines the shape in words. 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.

Change pool

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 0.20.2, then these Hedgehogs intersect. To show this, consider two Hedgehogs with their centres at points OO and MM, respectively, such that ∣OM∣<0.2|OM| < 0.2. Let AA, BB and CC be the endpoints of the needles of the first Hedgehog (see Figure 4) and draw a straight line ll parallel to ACAC through the point MM. As ∣AC∣=3|AC| = \sqrt{3} implies ∣KL∣≤0.20.5∣AC∣<1|KL| \leq \frac{0.2}{0.5}|AC| < 1 and the second Hedgehog has at least one of its needles pointing inside the triangle OKLOKL, this needle intersects the first Hedgehog.

Diagram for the mathnet 00ya 1 of bw-1994-16. 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

02
11
20
33
41
52
All team scores
TeamScore
St. Petersburg5 / 5
Latvia3 / 5
Poland3 / 5
Sweden5 / 5
Denmark1 / 5
Estonia0 / 5
Finland3 / 5
Lithuania0 / 5
Iceland4 / 5