GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5251 | Find Greatest Common Divisor of 3921 and 638, using Euclidean algorithm. | 1 |
| 5252 | Find Greatest Common Divisor of 623 and 89, using Euclidean algorithm. | 1 |
| 5253 | Find Greatest Common Divisor of 317. | 1 |
| 5254 | Find Greatest Common Divisor of 317. | 1 |
| 5255 | Find Greatest Common Divisor of 317. | 1 |
| 5256 | Find Greatest Common Divisor of 36 and 58, using repeated division. | 1 |
| 5257 | Find Greatest Common Divisor of 34 and 58, using repeated division. | 1 |
| 5258 | Find Greatest Common Divisor of 34 and 64, using repeated division. | 1 |
| 5259 | Find Greatest Common Divisor of 34 and 68, using repeated division. | 1 |
| 5260 | Find Greatest Common Divisor of 1082 and 1739, using prime factorization. | 1 |
| 5261 | Find Greatest Common Divisor of 30690 and 93093, by listing out the factors. | 1 |
| 5262 | Find Greatest Common Divisor of 51 and 83, using Euclidean algorithm. | 1 |
| 5263 | Find Greatest Common Divisor of 42 and 264, using Euclidean algorithm. | 1 |
| 5264 | Find Greatest Common Divisor of 210, 240 and 270, using prime factorization. | 1 |
| 5265 | Find Greatest Common Divisor of 1008, 2520 and 2016, using prime factorization. | 1 |
| 5266 | Find Greatest Common Divisor of 16, 14 and 18, using prime factorization. | 1 |
| 5267 | Find Greatest Common Divisor of 56 and 30, using Euclidean algorithm. | 1 |
| 5268 | Find Greatest Common Divisor of 2361 and 122, using Euclidean algorithm. | 1 |
| 5269 | Find Greatest Common Divisor of 120, 168 and 180, using prime factorization. | 1 |
| 5270 | Find Greatest Common Divisor of 12 and 140, using repeated division. | 1 |
| 5271 | Find Greatest Common Divisor of 12 and 140, using prime factorization. | 1 |
| 5272 | Find Greatest Common Divisor of 73 and 245, using prime factorization. | 1 |
| 5273 | Find Greatest Common Divisor of 9 and 17, using prime factorization. | 1 |
| 5274 | Find Greatest Common Divisor of 21 and 7, using repeated division. | 1 |
| 5275 | Find Greatest Common Divisor of 222 and 54, using prime factorization. | 1 |
| 5276 | Find Greatest Common Divisor of 8, 14 and 16, using repeated division. | 1 |
| 5277 | Find Greatest Common Divisor of 72 and 108, using repeated division. | 1 |
| 5278 | Find Greatest Common Divisor of 6, 30 and 42, using repeated division. | 1 |
| 5279 | Find Greatest Common Divisor of 1400 and 600, using repeated division. | 1 |
| 5280 | Find Greatest Common Divisor of 39, 26, 52 and 24, using repeated division. | 1 |
| 5281 | Find Greatest Common Divisor of 25, 26, 27 and 30, using repeated division. | 1 |
| 5282 | Find Greatest Common Divisor of 350 and 123, using Euclidean algorithm. | 1 |
| 5283 | Find Greatest Common Divisor of 72 and 6, using prime factorization. | 1 |
| 5284 | Find Greatest Common Divisor of 72 and 7, using prime factorization. | 1 |
| 5285 | Find Greatest Common Divisor of 23 and 79, using prime factorization. | 1 |
| 5286 | Find Greatest Common Divisor of 3 and 8, by listing out the factors. | 1 |
| 5287 | Find Greatest Common Divisor of 902 and 412, using prime factorization. | 1 |
| 5288 | Find Greatest Common Divisor of 3192 and 2025, using prime factorization. | 1 |
| 5289 | Find Greatest Common Divisor of 1, 4 and 0, using prime factorization. | 1 |
| 5290 | Find Greatest Common Divisor of 2022 and 272, using prime factorization. | 1 |
| 5291 | Find Greatest Common Divisor of 13 and 60, using prime factorization. | 1 |
| 5292 | Find Greatest Common Divisor of 9 and 60, using prime factorization. | 1 |
| 5293 | Find Greatest Common Divisor of 24843 and 38675, using prime factorization. | 1 |
| 5294 | Find Greatest Common Divisor of 24843 and 38675, using Euclidean algorithm. | 1 |
| 5295 | Find Greatest Common Divisor of 667 and 29000, using prime factorization. | 1 |
| 5296 | Find Greatest Common Divisor of 16, 20 and 42, using prime factorization. | 1 |
| 5297 | Find Greatest Common Divisor of 131718 and 7241, using prime factorization. | 1 |
| 5298 | Find Greatest Common Divisor of 80045 and 5302, using Euclidean algorithm. | 1 |
| 5299 | Find Greatest Common Divisor of 912 and 1946, using Euclidean algorithm. | 1 |
| 5300 | Find Greatest Common Divisor of 1946 and 912, using Euclidean algorithm. | 1 |
