Assume that the set of all positive integers is decomposed into r (disjoint) subsets A_1 \cup A_2 \cup \ldots \cup A_r \equal{} \mathbb{N}. Prove that one of them, say Ai, has the following property: There exists a positive m such that for any k one can find numbers a1,a2,…,ak in Ai with 0 < a_{j \plus{} 1} \minus{} a_j \leq m, (1 \leq j \leq k \minus{} 1). number theorypartitionRamsey TheoryColoringExtremal combinatoricsIMO ShortlistHi