Natural numbers from $1$ to $400$ are divided in $100$ disjoint sets. Prove that one of the sets contains three numbers which are lengths of a non-degenerate triangle's sides.
Problem
Source: Latvia TST for Baltic Way 2020 P7
Tags: combinatorics
22.10.2020 16:42
if you need to know what a non-degenerate triangle is, here is the answer
22.10.2020 16:44
for the disjoint sets, it is just 4 numbers that don't intersect with each other, like 1,2,3,4 and 5,6,7,8. 1,2,3,4 and 3,4,5,6 would not be a disjoint set.
22.10.2020 16:44
I'm a complete beginner, but this kinda looks like pigeon hole (though I don't know how to use it)
22.10.2020 17:03
Givemebooksorgivemedeath wrote: for the disjoint sets, it is just 4 numbers that don't intersect with each other, like 1,2,3,4 and 5,6,7,8. 1,2,3,4 and 3,4,5,6 would not be a disjoint set. While your understanding of disjoint sets is correct, I would like to point out that all the sets don't have to be of an equal size.
22.10.2020 19:05
23.10.2020 07:35