How to prove this?

Revision en1, by szawinis, 2017-07-05 18:48:47

Given a set of n integers S, with no elements divisible by n. Prove that there exists a subset of S that has a sum divisible by n. In this case, n should be > 1.

I'm pretty trash at mathematical proofs. Can someone help me out?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English szawinis 2017-07-05 18:48:47 249 Initial revision (published)