Yaphp
Source: INMO 2001 Problem 4
October 10, 2005
modular arithmeticcombinatorics unsolvedcombinatorics
Problem Statement
Show that given any nine integers, we can find four, such that is divisible by . Show that this is not always true for eight integers.