| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
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) |
