can anyone tell me what is trick behind this problem?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 157 |
| 6 | Qingyu | 155 |
| 7 | djm03178 | 151 |
| 7 | adamant | 151 |
| 9 | luogu_official | 150 |
| 10 | awoo | 147 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/22/2025 23:42:07 (l1).
Desktop version, switch to mobile version.
Supported by
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.