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?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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?
Name |
---|
Arrange them in any order and look at prefix sums.
You have to consider the prefix sums, but I think that the key part of the solution is knowing Pigeonhole principle
Idea is like partial sum.Consider S1 = a1,S2 = a1 + a2,...Now we have n numbers (S1,S2,..Sn) and if one of them is divisible by n we're done,so asumme opposite.Now we have n number and less then n - 1 different remaniders modulo n so at least 2 of remainders (by PHP) are equal,let's say Si and Sj.But then n|Sj - Si.