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 88 and 220, using repeated division. | 1 |
| 4002 | Find Greatest Common Divisor of 64 and 80, by listing out the factors. | 1 |
| 4003 | Find Greatest Common Divisor of 420 and 360, using prime factorization. | 1 |
| 4004 | Find Greatest Common Divisor of 0, 132 and 763, by listing out the factors. | 1 |
| 4005 | Find Greatest Common Divisor of 90, 108 and 126, using prime factorization. | 1 |
| 4006 | Find Greatest Common Divisor of 75, 45 and 60, using prime factorization. | 1 |
| 4007 | Find Greatest Common Divisor of 36, 54 and 90, using prime factorization. | 1 |
| 4008 | Find Greatest Common Divisor of 3, 5 and 6, using prime factorization. | 1 |
| 4009 | Find Greatest Common Divisor of 179 and 67, using Euclidean algorithm. | 1 |
| 4010 | Find Greatest Common Divisor of 687 and 24, using Euclidean algorithm. | 1 |
| 4011 | Find Greatest Common Divisor of 400 and 60, using prime factorization. | 1 |
| 4012 | Find Greatest Common Divisor of 28 and 36, using prime factorization. | 1 |
| 4013 | Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using repeated division. | 1 |
| 4014 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using Euclidean algorithm. | 1 |
| 4015 | Find Greatest Common Divisor of 222 and 159, using Euclidean algorithm. | 1 |
| 4016 | Find Greatest Common Divisor of 32 and 36, using Euclidean algorithm. | 1 |
| 4017 | Find Greatest Common Divisor of 5 and 15, using Euclidean algorithm. | 1 |
| 4018 | Find Greatest Common Divisor of 2024 and 572, using Euclidean algorithm. | 1 |
| 4019 | Find Greatest Common Divisor of 60, 150 and 180, using prime factorization. | 1 |
| 4020 | Find Greatest Common Divisor of 510, 680 and 859, using prime factorization. | 1 |
| 4021 | Find Greatest Common Divisor of 510, 680 and 850, using prime factorization. | 1 |
| 4022 | Find Greatest Common Divisor of 660 and 1441, using Euclidean algorithm. | 1 |
| 4023 | Find Greatest Common Divisor of 1584 and 4968, using Euclidean algorithm. | 1 |
| 4024 | Find Greatest Common Divisor of 6, 2, 4 and 5, using prime factorization. | 1 |
| 4025 | Find Greatest Common Divisor of 110 and 2511, using prime factorization. | 1 |
| 4026 | Find Greatest Common Divisor of 180 and 252, using Euclidean algorithm. | 1 |
| 4027 | Find Greatest Common Divisor of 7 and 540, using prime factorization. | 1 |
| 4028 | Find Greatest Common Divisor of 3 and 589, using prime factorization. | 1 |
| 4029 | Find Greatest Common Divisor of 3299 and 647, using Euclidean algorithm. | 1 |
| 4030 | Find Greatest Common Divisor of 17 and 23, using Euclidean algorithm. | 1 |
| 4031 | Find Greatest Common Divisor of 21 and 31, using Euclidean algorithm. | 1 |
| 4032 | Find Greatest Common Divisor of 108045 and 120, using prime factorization. | 1 |
| 4033 | Find Greatest Common Divisor of 435, 667 and 1073, using repeated division. | 1 |
| 4034 | Find Greatest Common Divisor of 12409 and 23883, using Euclidean algorithm. | 1 |
| 4035 | Find Greatest Common Divisor of 49, 15 and 132, using prime factorization. | 1 |
| 4036 | Find Greatest Common Divisor of 47 and 97, using prime factorization. | 1 |
| 4037 | Find Greatest Common Divisor of 6, 45 and 109, using prime factorization. | 1 |
| 4038 | Find Greatest Common Divisor of 11 and 14, using prime factorization. | 1 |
| 4039 | Find Greatest Common Divisor of 242, 363 and 484, using prime factorization. | 1 |
| 4040 | Find Greatest Common Divisor of 950, 2090 and 1330, using prime factorization. | 1 |
| 4041 | Find Greatest Common Divisor of 34 and 935, using repeated division. | 1 |
| 4042 | Find Greatest Common Divisor of 609 and 1566, using prime factorization. | 1 |
| 4043 | Find Greatest Common Divisor of 112 and 144, using repeated division. | 1 |
| 4044 | Find Greatest Common Divisor of 112 and 144, using Euclidean algorithm. | 1 |
| 4045 | Find Greatest Common Divisor of 112 and 144, by listing out the factors. | 1 |
| 4046 | Find Greatest Common Divisor of 80 and 144, by listing out the factors. | 1 |
| 4047 | Find Greatest Common Divisor of 85 and 6, using Euclidean algorithm. | 1 |
| 4048 | Find Greatest Common Divisor of 361 and 580, using prime factorization. | 1 |
| 4049 | Find Greatest Common Divisor of 30 and 160, using prime factorization. | 1 |
| 4050 | Find Greatest Common Divisor of 31 and 160, using prime factorization. | 1 |
