1970 Canadian MO Problems/Problem 7

Revision as of 03:02, 8 October 2014 by Timneh (talk | contribs) (Created page with "== Problem == Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by <math>3</math>. == Solution ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by $3$.

Solution