Baltic Way 1993 · Problem 13
Combinatorics
An equilateral triangle is divided into 100 congruent equilateral triangles. What is the greatest number of vertices of small triangles that can be chosen so that no two of them lie on a line that is parallel to any of the sides of the triangle ?
When you’re ready
Review material becomes available with the next Daily.
Review
Topics
Invariants and monovariants
Solutions
Solution
Solution:
Figure 2
An example for vertices is shown in Figure 2. Now assume we have chosen vertices satisfying the conditions of the problem. Let the height of each small triangle be equal to and denote by the distance of the th point from the three sides of the big triangle. For any we then have and . Thus, . On the other hand, each of the sums in the brackets is not less than , but , a contradiction.
Contest context
Results from Baltic Way 1993
8 teams
- Mean score
- 0.0 / 5
- Scores of 4 or 5
- 0 / 8
- Estonia
- 0 / 5
Score distribution
All team scores
| Team | Score |
|---|---|
| Poland | 0 / 5 |
| Latvia | 0 / 5 |
| Estonia | 0 / 5 |
| Sweden | 0 / 5 |
| Lithuania | 0 / 5 |
| Finland | 0 / 5 |
| Iceland | 0 / 5 |
| Denmark | 0 / 5 |