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 conceptual solution by Cory Taylor)

I agree with you Cory, it is most probably stated as follows: " The sum of any consecutive 'n' positive inteegers is divisible by 'n' ". Isn't it. It goes somewhat like that I believe.

Posted by Ravi Raja on 2003-03-17 04:24:32