GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4101 | Find Greatest Common Divisor of 1794 and 2346, using prime factorization. | 1 |
| 4102 | Find Greatest Common Divisor of 557 and 239, using Euclidean algorithm. | 1 |
| 4103 | Find Greatest Common Divisor of 11, 3, 7 and 2, using prime factorization. | 1 |
| 4104 | Find Greatest Common Divisor of 29106 and 5382, using Euclidean algorithm. | 1 |
| 4105 | Find Greatest Common Divisor of 26 and 39, using prime factorization. | 1 |
| 4106 | Find Greatest Common Divisor of 28260 and 5148, using Euclidean algorithm. | 1 |
| 4107 | Find Greatest Common Divisor of 28539 and 5088, using Euclidean algorithm. | 1 |
| 4108 | Find Greatest Common Divisor of 13 and 3, using Euclidean algorithm. | 1 |
| 4109 | Find Greatest Common Divisor of 18 and 6, using Euclidean algorithm. | 1 |
| 4110 | Find Greatest Common Divisor of 4 and 20, by listing out the factors. | 1 |
| 4111 | Find Greatest Common Divisor of 317 and 525, using prime factorization. | 1 |
| 4112 | Find Greatest Common Divisor of 289 and 377, using Euclidean algorithm. | 1 |
| 4113 | Find Greatest Common Divisor of 750, 242 and 9, using prime factorization. | 1 |
| 4114 | Find Greatest Common Divisor of 1 and 1, using prime factorization. | 1 |
| 4115 | Find Greatest Common Divisor of 25 and 17, using Euclidean algorithm. | 1 |
| 4116 | Find Greatest Common Divisor of 9800, 420 and 2520, by listing out the factors. | 1 |
| 4117 | Find Greatest Common Divisor of 18, 12 and 24, using repeated division. | 1 |
| 4118 | Find Greatest Common Divisor of 8925 and 76576500, using prime factorization. | 1 |
| 4119 | Find Greatest Common Divisor of 169, 28, 16, 8, 160, 28, 292, 108, 56, 68, 72, 28, 124, 52 and 264, using prime factorization. | 1 |
| 4120 | Find Greatest Common Divisor of 35, 88, 16, 260, 92, 140, 100, 80, 80 and 344, using prime factorization. | 1 |
| 4121 | Find Greatest Common Divisor of 314 and 159, using Euclidean algorithm. | 1 |
| 4122 | Find Greatest Common Divisor of 504 and 295, using Euclidean algorithm. | 1 |
| 4123 | Find Greatest Common Divisor of 3 and 11, using Euclidean algorithm. | 1 |
| 4124 | Find Greatest Common Divisor of 11 and 3, using Euclidean algorithm. | 1 |
| 4125 | Find Greatest Common Divisor of 97 and 7000, by listing out the factors. | 1 |
| 4126 | Find Greatest Common Divisor of 37, 13 and 11, using prime factorization. | 1 |
| 4127 | Find Greatest Common Divisor of 56 and 128, using prime factorization. | 1 |
| 4128 | Find Greatest Common Divisor of 123 and 321, using prime factorization. | 1 |
| 4129 | Find Greatest Common Divisor of 406 and 945, by listing out the factors. | 1 |
| 4130 | Find Greatest Common Divisor of 170 and 122, using Euclidean algorithm. | 1 |
| 4131 | Find Greatest Common Divisor of 170 and 122, using prime factorization. | 1 |
| 4132 | Find Greatest Common Divisor of 12378 and 467, using prime factorization. | 1 |
| 4133 | Find Greatest Common Divisor of 1110 and 0, using prime factorization. | 1 |
| 4134 | Find Greatest Common Divisor of 57 and 0, using Euclidean algorithm. | 1 |
| 4135 | Find Greatest Common Divisor of 36542 and 22022, using prime factorization. | 1 |
| 4136 | Find Greatest Common Divisor of 147 and 70, using prime factorization. | 1 |
| 4137 | Find Greatest Common Divisor of 10 and 409, using prime factorization. | 1 |
| 4138 | Find Greatest Common Divisor of 10234 and 578, using Euclidean algorithm. | 1 |
| 4139 | Find Greatest Common Divisor of 389 and 1570, using prime factorization. | 1 |
| 4140 | Find Greatest Common Divisor of 294 and 398, using Euclidean algorithm. | 1 |
| 4141 | Find Greatest Common Divisor of 845 and 745, using Euclidean algorithm. | 1 |
| 4142 | Find Greatest Common Divisor of 20, 32 and 24, using prime factorization. | 1 |
| 4143 | Find Greatest Common Divisor of 58 and 1, using repeated division. | 1 |
| 4144 | Find Greatest Common Divisor of 109 and 2, using repeated division. | 1 |
| 4145 | Find Greatest Common Divisor of 359 and 125, using repeated division. | 1 |
| 4146 | Find Greatest Common Divisor of 1320 and 1065, using Euclidean algorithm. | 1 |
| 4147 | Find Greatest Common Divisor of 1320 and 1065, by listing out the factors. | 1 |
| 4148 | Find Greatest Common Divisor of 238 and 1105, using Euclidean algorithm. | 1 |
| 4149 | Find Greatest Common Divisor of 240 and 360, using Euclidean algorithm. | 1 |
| 4150 | Find Greatest Common Divisor of 177 and 346, using prime factorization. | 1 |
