can anyone tell me what is trick behind this problem?
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
can anyone tell me what is trick behind this problem?
Name |
---|
No
I wouldn't call it trick though. Sum of divisors of number n = p1α1p2α2...pkαk is S = (1 + p1 + p12...p1α1)(1 + p2 + p22...p2α2)...(1 + pk + pk2...pkαk). If you want proof, consider small k's for getting logic or even you can induct on k. If k > 1, there are more than one > 1 multiplications in S, so it wouldn't be prime number. Only case you need to check is k = 1 so only the numbers pα can be "K-number" where p is prime and α is non-negative integer. I think it is enough to solve the problem.