GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4001 | Find Greatest Common Divisor of 1024. | 2 |
| 4002 | Find Greatest Common Divisor of 662. | 2 |
| 4003 | Find Greatest Common Divisor of 662. | 2 |
| 4004 | Find Greatest Common Divisor of 12 and 232, using prime factorization. | 2 |
| 4005 | Find Greatest Common Divisor of 9436 and 100, using prime factorization. | 2 |
| 4006 | Find Greatest Common Divisor of 1561 and 3409, using prime factorization. | 2 |
| 4007 | Find Greatest Common Divisor of 117 and 247, using prime factorization. | 2 |
| 4008 | Find Greatest Common Divisor of 5 and 95, using prime factorization. | 2 |
| 4009 | Find Greatest Common Divisor of 252 and 8, using prime factorization. | 2 |
| 4010 | Find Greatest Common Divisor of 30 and 78, using prime factorization. | 2 |
| 4011 | Find Greatest Common Divisor of 13 and 75, using prime factorization. | 2 |
| 4012 | Find Greatest Common Divisor of 13 and 80, using prime factorization. | 2 |
| 4013 | Find Greatest Common Divisor of 126 and 16, using prime factorization. | 2 |
| 4014 | Find Greatest Common Divisor of 10 and 75, using Euclidean algorithm. | 2 |
| 4015 | Find Greatest Common Divisor of 9 and 81, using prime factorization. | 2 |
| 4016 | Find Greatest Common Divisor of 48 and 360, using Euclidean algorithm. | 2 |
| 4017 | Find Greatest Common Divisor of 154 and 8, using prime factorization. | 2 |
| 4018 | Find Greatest Common Divisor of 1362 and 2785, using Euclidean algorithm. | 2 |
| 4019 | Find Greatest Common Divisor of 21 and 140, using prime factorization. | 2 |
| 4020 | Find Greatest Common Divisor of 428 and 633, using prime factorization. | 2 |
| 4021 | Find Greatest Common Divisor of 520 and 858, using prime factorization. | 2 |
| 4022 | Find Greatest Common Divisor of 11 and 1800, using prime factorization. | 2 |
| 4023 | Find Greatest Common Divisor of 832 and 10933, using prime factorization. | 2 |
| 4024 | Find Greatest Common Divisor of 20119 and 34782, using Euclidean algorithm. | 2 |
| 4025 | Find Greatest Common Divisor of 5 and 3432, using prime factorization. | 2 |
| 4026 | Find Greatest Common Divisor of 44 and 143, using prime factorization. | 2 |
| 4027 | Find Greatest Common Divisor of 180, 540 and 240, using prime factorization. | 2 |
| 4028 | Find Greatest Common Divisor of 339 and 60, using prime factorization. | 2 |
| 4029 | Find Greatest Common Divisor of 55 and 22, using Euclidean algorithm. | 2 |
| 4030 | Find Greatest Common Divisor of 62 and 124, using prime factorization. | 2 |
| 4031 | Find Greatest Common Divisor of 86 and 120, using prime factorization. | 2 |
| 4032 | Find Greatest Common Divisor of 6 and 12, using Euclidean algorithm. | 2 |
| 4033 | Find Greatest Common Divisor of 490 and 2013, using prime factorization. | 2 |
| 4034 | Find Greatest Common Divisor of 32321 and 36513, using prime factorization. | 2 |
| 4035 | Find Greatest Common Divisor of 32321 and 26513, using prime factorization. | 2 |
| 4036 | Find Greatest Common Divisor of 1340 and 1340, using prime factorization. | 2 |
| 4037 | Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm. | 2 |
| 4038 | Find Greatest Common Divisor of 84 and 96, using prime factorization. | 2 |
| 4039 | Find Greatest Common Divisor of 165, 45 and 5, using prime factorization. | 2 |
| 4040 | Find Greatest Common Divisor of 5 and 288, using prime factorization. | 2 |
| 4041 | Find Greatest Common Divisor of 250 and 134, using prime factorization. | 2 |
| 4042 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using Euclidean algorithm. | 2 |
| 4043 | Find Greatest Common Divisor of 889 and 246, using Euclidean algorithm. | 2 |
| 4044 | Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm. | 2 |
| 4045 | Find Greatest Common Divisor of 357 and 476, using prime factorization. | 2 |
| 4046 | Find Greatest Common Divisor of 585 and 169, using Euclidean algorithm. | 2 |
| 4047 | Find Greatest Common Divisor of 12 and 24, using Euclidean algorithm. | 2 |
| 4048 | Find Greatest Common Divisor of 1 and 7, using Euclidean algorithm. | 2 |
| 4049 | Find Greatest Common Divisor of 132 and 100, using prime factorization. | 2 |
| 4050 | Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm. | 2 |