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)

(In reply to Yet another Erdos theorem by e.g.)

Sorry to be a bother, but I looked over your reference and could not see how it is applicable.  Could you please point out exactly how it applies?  Thanks.

Posted by Richard on 2004-12-30 17:37:58