GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6301 | Find Greatest Common Divisor of 2520 and 154, using Euclidean algorithm. | 1 |
| 6302 | Find Greatest Common Divisor of 11 and 19, using prime factorization. | 1 |
| 6303 | Find Greatest Common Divisor of 350 and 5500, using prime factorization. | 1 |
| 6304 | Find Greatest Common Divisor of 563 and 1391, using prime factorization. | 1 |
| 6305 | Find Greatest Common Divisor of 563 and 1391, using Euclidean algorithm. | 1 |
| 6306 | Find Greatest Common Divisor of 108, 144 and 276, using prime factorization. | 1 |
| 6307 | Find Greatest Common Divisor of 44350 and 20785, using prime factorization. | 1 |
| 6308 | Find Greatest Common Divisor of 54 and 18, using prime factorization. | 1 |
| 6309 | Find Greatest Common Divisor of 42, 70 and 56, using prime factorization. | 1 |
| 6310 | Find Greatest Common Divisor of 96, 64 and 80, using prime factorization. | 1 |
| 6311 | Find Greatest Common Divisor of 84, 12 and 40, using prime factorization. | 1 |
| 6312 | Find Greatest Common Divisor of 34, 54 and 64, using prime factorization. | 1 |
| 6313 | Find Greatest Common Divisor of 7429 and 33649, using Euclidean algorithm. | 1 |
| 6314 | Find Greatest Common Divisor of 30107 and 437, using Euclidean algorithm. | 1 |
| 6315 | Find Greatest Common Divisor of 81719, 52003, 33649 and 30107, using prime factorization. | 1 |
| 6316 | Find Greatest Common Divisor of 23 and 4, using prime factorization. | 1 |
| 6317 | Find Greatest Common Divisor of 100 and 40, using prime factorization. | 1 |
| 6318 | Find Greatest Common Divisor of 10, 14 and 22, using prime factorization. | 1 |
| 6319 | Find Greatest Common Divisor of 6, 27 and 64, using prime factorization. | 1 |
| 6320 | Find Greatest Common Divisor of 560. | 1 |
| 6321 | Find Greatest Common Divisor of 560 and 196, using prime factorization. | 1 |
| 6322 | Find Greatest Common Divisor of 13 and 15, using prime factorization. | 1 |
| 6323 | Find Greatest Common Divisor of 123456789 and 123456788, using Euclidean algorithm. | 1 |
| 6324 | Find Greatest Common Divisor of 165 and 78, using prime factorization. | 1 |
| 6325 | Find Greatest Common Divisor of 5092 and 2768, using prime factorization. | 1 |
| 6326 | Find Greatest Common Divisor of 3, 100, 1, 3, 100 and 1, using Euclidean algorithm. | 1 |
| 6327 | Find Greatest Common Divisor of 500000001 and 5000001, using Euclidean algorithm. | 1 |
| 6328 | Find Greatest Common Divisor of 2024 and 1446, using Euclidean algorithm. | 1 |
| 6329 | Find Greatest Common Divisor of 1003 and 821, using Euclidean algorithm. | 1 |
| 6330 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization. | 1 |
| 6331 | Find Greatest Common Divisor of 99999999999999999 and 12, using prime factorization. | 1 |
| 6332 | Find Greatest Common Divisor of 3205. | 1 |
| 6333 | Find Greatest Common Divisor of 104 and 130, using prime factorization. | 1 |
| 6334 | Find Greatest Common Divisor of 400, 125 and 172, using prime factorization. | 1 |
| 6335 | Find Greatest Common Divisor of 11476 and 683, using Euclidean algorithm. | 1 |
| 6336 | Find Greatest Common Divisor of 2561124 and 46064, using Euclidean algorithm. | 1 |
| 6337 | Find Greatest Common Divisor of 17601969 and 2364768, using Euclidean algorithm. | 1 |
| 6338 | Find Greatest Common Divisor of 350 and 45, using Euclidean algorithm. | 1 |
| 6339 | Find Greatest Common Divisor of 2030 and 756, using prime factorization. | 1 |
| 6340 | Find Greatest Common Divisor of 8. | 1 |
| 6341 | Find Greatest Common Divisor of 662 and 404, using Euclidean algorithm. | 1 |
| 6342 | Find Greatest Common Divisor of 2079 and 825, using Euclidean algorithm. | 1 |
| 6343 | Find Greatest Common Divisor of 248 and 108, using prime factorization. | 1 |
| 6344 | Find Greatest Common Divisor of 19683 and 84, using prime factorization. | 1 |
| 6345 | Find Greatest Common Divisor of 22 and 58, using prime factorization. | 1 |
| 6346 | Find Greatest Common Divisor of 1252, 570 and 616, using prime factorization. | 1 |
| 6347 | Find Greatest Common Divisor of 82933 and 145393, using Euclidean algorithm. | 1 |
| 6348 | Find Greatest Common Divisor of 1112 and 1544, using Euclidean algorithm. | 1 |
| 6349 | Find Greatest Common Divisor of 45 and 36, using prime factorization. | 1 |
| 6350 | Find Greatest Common Divisor of 45 and 36, using repeated division. | 1 |