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 re: conceptual solution
by Ravi Raja)
As the numbers are squares they can't be consecutive integers, though if they were squares of consecutive integers, the sum could be divisible by n, but we have no assurance that a set of squares of 19 consecutive integers are present.
Posted by Charlie
on 2003-03-18 03:27:52