n is a number and n=(p1^a) * (p2^b).Here p1 and p2 are prime.
gcd(i,n)= 
gcd(i,p1^a) * 
gcd(i,p2^b) How can I prove this?
→ 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 | 156 |
| 7 | adamant | 151 |
| 7 | djm03178 | 151 |
| 7 | luogu_official | 151 |
| 10 | awoo | 146 |
→ Find user
→ Recent actions
Math,Gcd
Revision en2, by sahasumit288, 2016-10-15 22:26:07
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-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/24/2025 00:42:30 (j1).
Desktop version, switch to mobile version.
Supported by
