Yet another Pigeon Hole!
Source: INMO 1994 Problem 3
October 6, 2005
combinatoricsOld
Problem Statement
In any set of square integers, prove that one can always find a subset of numbers, sum of whose elements is divisible by .
Source: INMO 1994 Problem 3