Difference between revisions of "1970 Canadian MO Problems/Problem 7"
(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 ==") |
|||
| Line 4: | Line 4: | ||
== Solution == | == Solution == | ||
| + | {{Solution}} | ||
Revision as of 20:36, 27 November 2023
Problem
Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
