Let p be a prime. Let S be a set of (p-1) integers, none of which are divisible by p. Show that some subset of S has a sum that has a remainder of 1 when divided by p.

(The sum of a set is defined as the sum of the elements of the set)

Erdos Theorum? I thought this was the Pigeon Hole Theory... are they the same?

Posted by Michael on 2005-04-04 13:40:30