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?
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ 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-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 07:09:32 (g2).
Desktop version, switch to mobile version.
Supported by
