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?
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?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 173 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
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.