n is a number and n=(p1^a) * (p2^b).Here p1 and p2 are prime.
gcd(i,n)=$\sum\limits_{i=1}^{p1^a}{}gcd(i, p1a) * \sum\limits_{i=1}^{p2^b}{}$ gcd(i,p2^b) How can I prove this?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
→ Find user
→ Recent actions
Math,Gcd
Revision en1, by sahasumit288, 2016-10-15 22:25:19
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
sahasumit288 | 2016-10-15 22:33:31 | 3 | Tiny change: 'b)\n\nHow can to prove ' -> 'b)\n\nHow to prove ' | |
| en4 |
|
sahasumit288 | 2016-10-15 22:29:28 | 2 | Tiny change: 'gcd(i,b)\nHow can ' -> 'gcd(i,b)\n\nHow can ' | |
| en3 |
|
sahasumit288 | 2016-10-15 22:28:23 | 79 | ||
| en2 |
|
sahasumit288 | 2016-10-15 22:26:07 | 3 | ||
| en1 |
|
sahasumit288 | 2016-10-15 22:25:19 | 216 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/18/2024 01:26:07 (g1).
Desktop version, switch to mobile version.
Supported by
