GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
401 | Find Greatest Common Divisor of 119 and 272, using Euclidean algorithm. | 6 |
402 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using prime factorization. | 6 |
403 | Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm. | 6 |
404 | Find Greatest Common Divisor of 35 and 192, using prime factorization. | 6 |
405 | Find Greatest Common Divisor of 504 and 385, using Euclidean algorithm. | 6 |
406 | Find Greatest Common Divisor of 104 and 64, using repeated division. | 6 |
407 | Find Greatest Common Divisor of 65 and 130, using prime factorization. | 5 |
408 | Find Greatest Common Divisor of 96, 112 and 144, by listing out the factors. | 5 |
409 | Find Greatest Common Divisor of 38 and 52, using prime factorization. | 5 |
410 | Find Greatest Common Divisor of 24140 and 16762, using Euclidean algorithm. | 5 |
411 | Find Greatest Common Divisor of 504 and 270, using Euclidean algorithm. | 5 |
412 | Find Greatest Common Divisor of 330 and 156, using Euclidean algorithm. | 5 |
413 | Find Greatest Common Divisor of 14 and 8, using prime factorization. | 5 |
414 | Find Greatest Common Divisor of 45 and 33, using prime factorization. | 5 |
415 | Find Greatest Common Divisor of 77 and 128, using prime factorization. | 5 |
416 | Find Greatest Common Divisor of 18 and 201, by listing out the factors. | 5 |
417 | Find Greatest Common Divisor of 18 and 201, using prime factorization. | 5 |
418 | Find Greatest Common Divisor of 18 and 32, using prime factorization. | 5 |
419 | Find Greatest Common Divisor of 17 and 3120, using prime factorization. | 5 |
420 | Find Greatest Common Divisor of 16534528044 and 8332745927, using Euclidean algorithm. | 5 |
421 | Find Greatest Common Divisor of 17 and 3120, using Euclidean algorithm. | 5 |
422 | Find Greatest Common Divisor of 93 and 42, using Euclidean algorithm. | 5 |
423 | Find Greatest Common Divisor of 509 and 1177, using Euclidean algorithm. | 5 |
424 | Find Greatest Common Divisor of 1, 24, 1 and 6, by listing out the factors. | 5 |
425 | Find Greatest Common Divisor of 160 and 7, using prime factorization. | 5 |
426 | Find Greatest Common Divisor of 102, 170 and 255, using prime factorization. | 5 |
427 | Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm. | 5 |
428 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using prime factorization. | 5 |
429 | Find Greatest Common Divisor of 49, 210 and 350, using Euclidean algorithm. | 5 |
430 | Find Greatest Common Divisor of 0 and 6, using prime factorization. | 5 |
431 | Find Greatest Common Divisor of 36 and 54, using Euclidean algorithm. | 5 |
432 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using prime factorization. | 5 |
433 | Find Greatest Common Divisor of 12 and 1234, using Euclidean algorithm. | 5 |
434 | Find Greatest Common Divisor of 1369 and 2597, using Euclidean algorithm. | 5 |
435 | Find Greatest Common Divisor of 315 and 825, using prime factorization. | 5 |
436 | Find Greatest Common Divisor of 24 and 138, using Euclidean algorithm. | 5 |
437 | Find Greatest Common Divisor of 9 and 9, using prime factorization. | 5 |
438 | Find Greatest Common Divisor of 101 and 126, using Euclidean algorithm. | 5 |
439 | Find Greatest Common Divisor of 58 and 32, using Euclidean algorithm. | 5 |
440 | Find Greatest Common Divisor of 36 and 48, using prime factorization. | 5 |
441 | Find Greatest Common Divisor of 2 and 82, using prime factorization. | 5 |
442 | Find Greatest Common Divisor of 3587 and 1819, using prime factorization. | 5 |
443 | Find Greatest Common Divisor of 576 and 324, using prime factorization. | 5 |
444 | Find Greatest Common Divisor of 816 and 1071, using Euclidean algorithm. | 5 |
445 | Find Greatest Common Divisor of 26 and 3, using prime factorization. | 5 |
446 | Find Greatest Common Divisor of 8. | 5 |
447 | Find Greatest Common Divisor of 28. | 5 |
448 | Find Greatest Common Divisor of 6 and 36, using prime factorization. | 5 |
449 | Find Greatest Common Divisor of 35 and 25, using Euclidean algorithm. | 5 |
450 | Find Greatest Common Divisor of 12378 and 3054, using Euclidean algorithm. | 5 |