GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
451 | Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm. | 4 |
452 | Find Greatest Common Divisor of 21, 28 and 49, using Euclidean algorithm. | 4 |
453 | Find Greatest Common Divisor of 432, 576 and 1008, using prime factorization. | 4 |
454 | Find Greatest Common Divisor of 316 and 180, using Euclidean algorithm. | 4 |
455 | Find Greatest Common Divisor of 90 and 82, using prime factorization. | 4 |
456 | Find Greatest Common Divisor of 11 and 55, using prime factorization. | 4 |
457 | Find Greatest Common Divisor of 70 and 50, using prime factorization. | 4 |
458 | Find Greatest Common Divisor of 20 and 3, using prime factorization. | 4 |
459 | Find Greatest Common Divisor of 52 and 94, using prime factorization. | 4 |
460 | Find Greatest Common Divisor of 432, 576 and 1008, by listing out the factors. | 4 |
461 | Find Greatest Common Divisor of 2 and 78, using prime factorization. | 4 |
462 | Find Greatest Common Divisor of 63 and 77, using prime factorization. | 4 |
463 | Find Greatest Common Divisor of 2 and 82, using prime factorization. | 4 |
464 | Find Greatest Common Divisor of 36 and 60, using prime factorization. | 4 |
465 | Find Greatest Common Divisor of 82 and 90, using prime factorization. | 4 |
466 | Find Greatest Common Divisor of 215 and 364, using prime factorization. | 4 |
467 | Find Greatest Common Divisor of 504 and 385, using prime factorization. | 4 |
468 | Find Greatest Common Divisor of 5. | 4 |
469 | Find Greatest Common Divisor of 25 and 40, using prime factorization. | 3 |
470 | Find Greatest Common Divisor of 27, 80, 108, 20 and 75, using prime factorization. | 3 |
471 | Find Greatest Common Divisor of 21 and 91, using prime factorization. | 3 |
472 | Find Greatest Common Divisor of 12728 and 20000, using Euclidean algorithm. | 3 |
473 | Find Greatest Common Divisor of 16 and 38, using prime factorization. | 3 |
474 | Find Greatest Common Divisor of 77, 33 and 22, using prime factorization. | 3 |
475 | Find Greatest Common Divisor of 3, 24, 27, 33, 42 and 46, using repeated division. | 3 |
476 | Find Greatest Common Divisor of 270 and 192, using prime factorization. | 3 |
477 | Find Greatest Common Divisor of 1716 and 1260, using Euclidean algorithm. | 3 |
478 | Find Greatest Common Divisor of 18 and 48, using prime factorization. | 3 |
479 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using Euclidean algorithm. | 3 |
480 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using repeated division. | 3 |
481 | Find Greatest Common Divisor of 12378 and 3054, using Euclidean algorithm. | 3 |
482 | Find Greatest Common Divisor of 14 and 2, using prime factorization. | 3 |
483 | Find Greatest Common Divisor of 3 and 25, using prime factorization. | 3 |
484 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using repeated division. | 3 |
485 | Find Greatest Common Divisor of 17 and 34, using repeated division. | 3 |
486 | Find Greatest Common Divisor of 403, 465 and 651, using prime factorization. | 3 |
487 | Find Greatest Common Divisor of 28 and 52, using Euclidean algorithm. | 3 |
488 | Find Greatest Common Divisor of 12345 and 54321, using prime factorization. | 3 |
489 | Find Greatest Common Divisor of 310 and 62, using prime factorization. | 3 |
490 | Find Greatest Common Divisor of 2 and 1, using prime factorization. | 3 |
491 | Find Greatest Common Divisor of 500 and 100, using prime factorization. | 3 |
492 | Find Greatest Common Divisor of 1 and 3, using prime factorization. | 3 |
493 | Find Greatest Common Divisor of 52 and 54, using repeated division. | 3 |
494 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using repeated division. | 3 |
495 | Find Greatest Common Divisor of 1056 and 228, using Euclidean algorithm. | 3 |
496 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, by listing out the factors. | 3 |
497 | Find Greatest Common Divisor of 2517 and 2370, using Euclidean algorithm. | 3 |
498 | Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm. | 3 |
499 | Find Greatest Common Divisor of 3 and 20, using prime factorization. | 3 |
500 | Find Greatest Common Divisor of 2, 8 and 6, using prime factorization. | 3 |