Seven line segments, with lengths no greater than 10 inches, and no shorter than 1 inch, are given. Show that one can choose three of them to represent the sides of a triangle.
How to Prove it Using Pigeon Hole Principle.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Seven line segments, with lengths no greater than 10 inches, and no shorter than 1 inch, are given. Show that one can choose three of them to represent the sides of a triangle.
How to Prove it Using Pigeon Hole Principle.
Name |
---|
Let a1,...,a7 be the lengths of the 7 segments. Without losing our generality, take a1 <= a2 <= ... <= a7. Let's say you can actually take a1,..,a7 so that you can't take 3 of them and from a triangle. What does this mean? It means that if you take ai, aj, ak, where i < j < k, ai + aj <= ak (*). Using (*) we get: a3 >= a2 + a1, a4 >= a3 + a2 ... or a3 >= a2 + a1, a4 >= a3 + a2 >= 2 * a2 + a1, a5 >= 3 * a2 + 2 * a1, a6 >= 5 * a2 + 3 * a1, a7 >= 8 * a2 + 5 * a1. But a1 and a2 are >= 1 => a7 >= 8 * 1 + 5 * 1 = 13. But a7 <= 10 => 13 < 10 contradiction. So, using Pigeon Hole Principle, the problem is solved.
ok
i get it