Skip to main content
OlympiadHQ

Browse · MathNet

Print

Romanian Mathematical Olympiad

Romania counting and probability

Problem

Let be a positive integer and let . We consider the subsets of , such that for each the set has elements. Prove that the intersection of the subsets contains at least two consecutive integers.
Solution
Observe that has elements, hence contains all the elements of except one. Similarly, contains all the elements of except , , contains all the elements of , except of them. We deduce that the intersection contains all the elements of , except at most . It follows that Let , with . Assume, by contradiction, that does not contain consecutive integers. Then , , and we conclude that a contradiction.

Techniques

Pigeonhole principleColoring schemes, extremal arguments