GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6351 | Find Greatest Common Divisor of 21 and 56, using prime factorization. | 1 |
| 6352 | Find Greatest Common Divisor of 10, 12 and 60, using prime factorization. | 1 |
| 6353 | Find Greatest Common Divisor of 202 and 219, using Euclidean algorithm. | 1 |
| 6354 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using Euclidean algorithm. | 1 |
| 6355 | Find Greatest Common Divisor of 126 and 18, using prime factorization. | 1 |
| 6356 | Find Greatest Common Divisor of 126 and 18, using Euclidean algorithm. | 1 |
| 6357 | Find Greatest Common Divisor of 126 and 18, using repeated division. | 1 |
| 6358 | Find Greatest Common Divisor of 126 and 18, by listing out the factors. | 1 |
| 6359 | Find Greatest Common Divisor of 432 and 95256, using prime factorization. | 1 |
| 6360 | Find Greatest Common Divisor of 8448 and 6335, using prime factorization. | 1 |
| 6361 | Find Greatest Common Divisor of 22 and 64, using prime factorization. | 1 |
| 6362 | Find Greatest Common Divisor of 1 and 12, using prime factorization. | 1 |
| 6363 | Find Greatest Common Divisor of 1231 and 1296, using prime factorization. | 1 |
| 6364 | Find Greatest Common Divisor of 7 and 8448, using Euclidean algorithm. | 1 |
| 6365 | Find Greatest Common Divisor of 143 and 277, using prime factorization. | 1 |
| 6366 | Find Greatest Common Divisor of 136 and 232, using prime factorization. | 1 |
| 6367 | Find Greatest Common Divisor of 272 and 1479, using prime factorization. | 1 |
| 6368 | Find Greatest Common Divisor of 272 and 1479, using repeated division. | 1 |
| 6369 | Find Greatest Common Divisor of 143 and 277, by listing out the factors. | 1 |
| 6370 | Find Greatest Common Divisor of 136 and 232, by listing out the factors. | 1 |
| 6371 | Find Greatest Common Divisor of 6 and 51, by listing out the factors. | 1 |
| 6372 | Find Greatest Common Divisor of 33 and 14, by listing out the factors. | 1 |
| 6373 | Find Greatest Common Divisor of 14 and 35, by listing out the factors. | 1 |
| 6374 | Find Greatest Common Divisor of 56 and 72, by listing out the factors. | 1 |
| 6375 | Find Greatest Common Divisor of 7 and 13, using prime factorization. | 1 |
| 6376 | Find Greatest Common Divisor of 18, 24 and 30, using repeated division. | 1 |
| 6377 | Find Greatest Common Divisor of 18, 24 and 30, using Euclidean algorithm. | 1 |
| 6378 | Find Greatest Common Divisor of 18, 24 and 30, by listing out the factors. | 1 |
| 6379 | Find Greatest Common Divisor of 145 and 32, using prime factorization. | 1 |
| 6380 | Find Greatest Common Divisor of 145 and 232, using prime factorization. | 1 |
| 6381 | Find Greatest Common Divisor of 88 and 220, using prime factorization. | 1 |
| 6382 | Find Greatest Common Divisor of 88 and 220, using repeated division. | 1 |
| 6383 | Find Greatest Common Divisor of 64 and 80, by listing out the factors. | 1 |
| 6384 | Find Greatest Common Divisor of 420 and 360, using prime factorization. | 1 |
| 6385 | Find Greatest Common Divisor of 0, 132 and 763, by listing out the factors. | 1 |
| 6386 | Find Greatest Common Divisor of 90, 108 and 126, using prime factorization. | 1 |
| 6387 | Find Greatest Common Divisor of 75, 45 and 60, using prime factorization. | 1 |
| 6388 | Find Greatest Common Divisor of 36, 54 and 90, using prime factorization. | 1 |
| 6389 | Find Greatest Common Divisor of 3, 5 and 6, using prime factorization. | 1 |
| 6390 | Find Greatest Common Divisor of 179 and 67, using Euclidean algorithm. | 1 |
| 6391 | Find Greatest Common Divisor of 400 and 60, using prime factorization. | 1 |
| 6392 | Find Greatest Common Divisor of 28 and 36, using prime factorization. | 1 |
| 6393 | Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using repeated division. | 1 |
| 6394 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using Euclidean algorithm. | 1 |
| 6395 | Find Greatest Common Divisor of 222 and 159, using Euclidean algorithm. | 1 |
| 6396 | Find Greatest Common Divisor of 32 and 36, using Euclidean algorithm. | 1 |
| 6397 | Find Greatest Common Divisor of 5 and 15, using Euclidean algorithm. | 1 |
| 6398 | Find Greatest Common Divisor of 2024 and 572, using Euclidean algorithm. | 1 |
| 6399 | Find Greatest Common Divisor of 60, 150 and 180, using prime factorization. | 1 |
| 6400 | Find Greatest Common Divisor of 510, 680 and 859, using prime factorization. | 1 |
