In any set of 181 square integers, prove that one can always find a subset of 19 numbers, the sum of whose elements is divisible by 19.

(In reply to I think I got it by Gamer)

If the original set of 181 squares includes runs of 19 or more consecutive squares, your solution will work. But the problem states "any set of 181 square integers," so you also have to look at the situation where you can't find an unbroken run of 19 consecutive squares.

Posted by TomM on 2003-03-15 06:18:45