A problem from the 1996 mathematical olympiad of the Republic of Moldova:
Twenty children attend a rural elementary school. Every two children have a grandfather in common. Prove that some grandfather has not less than 14 grandchildren in this school.
|
SelectClick for Answer> |
Consider the grandfather with the largest number of grandchildren, and suppose, for a contradiction, that that number is less than 14. There’s a child at the school who isn’t his grandchild, and each of his grandchildren shares a grandfather with that child. They can’t all share the same grandfather, because then that man would surpass our “maximal” grandfather. So there’s some third grandfather to divide that duty with him.
Now, every student we haven’t spoken about shares a grandfather with one that we have. And that leaves room for no fourth grandfather; every student in the school must count some two of these men as his grandfathers.
We have 40 grandfatherings to assign to these 20 students, and 40 = 3 × 13 + 1, so try as we might, we can’t assign 13 or fewer to each of the three men. One of them must have at least 14 grandchildren.
(This is all laid out more rigorously at the link below, page 371.)
(Olympiad Corner, Crux Mathematicorum 27:6 [October 2001], 357-373.)
|