| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Can anyone tell me the proof of Primitive Pythagorean Triples(a,b,c) having gcd(a,b,c)=1
I was solving this question Pythagorean Theorem II
and saw some optimized solution based on this relation seems
Saw some solved optimized codes using this relations seems gcd(a,b,c)=1
I know a,b,c are relatively prime but is it enough to know that ?
Can somebody tell me proof of this approach ?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Coder_Shubham_24 | 2021-02-05 13:45:13 | 200 | ||
| en1 |
|
Coder_Shubham_24 | 2021-02-05 13:43:53 | 743 | Initial revision (published) |
