GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 601 | Find Greatest Common Divisor of 6059. | 3 |
| 602 | Find Greatest Common Divisor of 3768 and 1701, using Euclidean algorithm. | 3 |
| 603 | Find Greatest Common Divisor of 108 and 124, using Euclidean algorithm. | 3 |
| 604 | Find Greatest Common Divisor of 24 and 18, using Euclidean algorithm. | 3 |
| 605 | Find Greatest Common Divisor of 8, 12 and 24, using repeated division. | 3 |
| 606 | Find Greatest Common Divisor of 391 and 667, using Euclidean algorithm. | 3 |
| 607 | Find Greatest Common Divisor of 710 and 105, using prime factorization. | 3 |
| 608 | Find Greatest Common Divisor of 18 and 3, using prime factorization. | 3 |
| 609 | Find Greatest Common Divisor of 11 and 11, using prime factorization. | 3 |
| 610 | Find Greatest Common Divisor of 53. | 3 |
| 611 | Find Greatest Common Divisor of 525. | 3 |
| 612 | Find Greatest Common Divisor of 800, 75 and 450, using prime factorization. | 3 |
| 613 | Find Greatest Common Divisor of 2300 and 1180, using repeated division. | 3 |
| 614 | Find Greatest Common Divisor of 123 and 456, using Euclidean algorithm. | 3 |
| 615 | Find Greatest Common Divisor of 14 and 3, using prime factorization. | 3 |
| 616 | Find Greatest Common Divisor of 16 and 24, by listing out the factors. | 3 |
| 617 | Find Greatest Common Divisor of 45 and 75, using prime factorization. | 3 |
| 618 | Find Greatest Common Divisor of 84 and 12, using repeated division. | 3 |
| 619 | Find Greatest Common Divisor of 13 and 7, using prime factorization. | 3 |
| 620 | Find Greatest Common Divisor of 2, 8 and 6, using prime factorization. | 3 |
| 621 | Find Greatest Common Divisor of 315, 5, 2 and 2, using repeated division. | 3 |
| 622 | Find Greatest Common Divisor of 315, 5, 2 and 2, by listing out the factors. | 3 |
| 623 | Find Greatest Common Divisor of 315, 5, 2 and 2, using Euclidean algorithm. | 3 |
| 624 | Find Greatest Common Divisor of 36 and 81, using prime factorization. | 3 |
| 625 | Find Greatest Common Divisor of 14. | 3 |
| 626 | Find Greatest Common Divisor of 36303, 3836 and 3827, using prime factorization. | 3 |
| 627 | Find Greatest Common Divisor of 36, 54, 90 and 126, using Euclidean algorithm. | 3 |
| 628 | Find Greatest Common Divisor of 123 and 297, using Euclidean algorithm. | 3 |
| 629 | Find Greatest Common Divisor of 114 and 324, using Euclidean algorithm. | 3 |
| 630 | Find Greatest Common Divisor of 420 and 200, using prime factorization. | 3 |
| 631 | Find Greatest Common Divisor of 7250 and 2360, using Euclidean algorithm. | 3 |
| 632 | Find Greatest Common Divisor of 388 and 189, using prime factorization. | 3 |
| 633 | Find Greatest Common Divisor of 388 and 189, using repeated division. | 3 |
| 634 | Find Greatest Common Divisor of 359 and 125, using Euclidean algorithm. | 3 |
| 635 | Find Greatest Common Divisor of 77, 33 and 22, using prime factorization. | 3 |
| 636 | Find Greatest Common Divisor of 1432 and 156, using prime factorization. | 3 |
| 637 | Find Greatest Common Divisor of 232 and 562, using Euclidean algorithm. | 3 |
| 638 | Find Greatest Common Divisor of 11391 and 5673, using Euclidean algorithm. | 3 |
| 639 | Find Greatest Common Divisor of 1638 and 2036, using prime factorization. | 3 |
| 640 | Find Greatest Common Divisor of 54796 and 605, using Euclidean algorithm. | 3 |
| 641 | Find Greatest Common Divisor of 75 and 253, using prime factorization. | 3 |
| 642 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, by listing out the factors. | 3 |
| 643 | Find Greatest Common Divisor of 160 and 9, using repeated division. | 3 |
| 644 | Find Greatest Common Divisor of 20 and 7, using repeated division. | 3 |
| 645 | Find Greatest Common Divisor of 20 and 10, using repeated division. | 3 |
| 646 | Find Greatest Common Divisor of 26 and 7, using Euclidean algorithm. | 3 |
| 647 | Find Greatest Common Divisor of 45 and 56, using prime factorization. | 3 |
| 648 | Find Greatest Common Divisor of 96 and 356, using Euclidean algorithm. | 3 |
| 649 | Find Greatest Common Divisor of 3, 24, 27, 33, 42 and 46, using repeated division. | 3 |
| 650 | Find Greatest Common Divisor of 9800, 420 and 2520, using prime factorization. | 3 |
