1978 IMO Problems/Problem 6

Revision as of 20:17, 5 August 2017 by Babycart (talk | contribs) (Created page with "<math>emph{Problem:}</math> An international society has its members from six different countries. The list of members has 1978 names, numbered <math>\color[rgb]{0.35,0.35,0.3...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

$emph{Problem:}$ An international society has its members from six different countries. The list of members has 1978 names, numbered $\color[rgb]{0.35,0.35,0.35}1, 2, \ldots, 1978$. Prove that there is at least one member whose number is the sum of the numbers of two (not necessarily distinct) members from his own country.

$\emph{Proof:}$ Lets consider the members numbered $1,2,3,\ldots 989$. If these members belong to $1\leq k\leq 6$ countries then, by the Pigeonhole principle, there must exist a country to which a minimum of $\lfloor \frac{988}{k}\rfloor +1$