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 628 and 2260, using prime factorization. | 4 |
| 602 | Find Greatest Common Divisor of 7, 62, 8 and 52, using prime factorization. | 4 |
| 603 | Find Greatest Common Divisor of 1 and 91, using prime factorization. | 4 |
| 604 | Find Greatest Common Divisor of 48 and 88, using prime factorization. | 4 |
| 605 | Find Greatest Common Divisor of 0 and 8, using prime factorization. | 4 |
| 606 | Find Greatest Common Divisor of 13 and 7, using prime factorization. | 4 |
| 607 | Find Greatest Common Divisor of 2533 and 466, using Euclidean algorithm. | 4 |
| 608 | Find Greatest Common Divisor of 56 and 98, using prime factorization. | 4 |
| 609 | Find Greatest Common Divisor of 356 and 25824, using prime factorization. | 4 |
| 610 | Find Greatest Common Divisor of 685, 192 and 189, using prime factorization. | 4 |
| 611 | Find Greatest Common Divisor of 31415 and 14142, using repeated division. | 4 |
| 612 | Find Greatest Common Divisor of 54. | 4 |
| 613 | Find Greatest Common Divisor of 244 and 292, using Euclidean algorithm. | 4 |
| 614 | Find Greatest Common Divisor of 168 and 504, using Euclidean algorithm. | 4 |
| 615 | Find Greatest Common Divisor of 792 and 275, using Euclidean algorithm. | 4 |
| 616 | Find Greatest Common Divisor of 66 and 150, using prime factorization. | 4 |
| 617 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, using prime factorization. | 4 |
| 618 | Find Greatest Common Divisor of 77 and 30, using Euclidean algorithm. | 4 |
| 619 | Find Greatest Common Divisor of 54, 60 and 45, using Euclidean algorithm. | 4 |
| 620 | Find Greatest Common Divisor of 427 and 321, using prime factorization. | 4 |
| 621 | Find Greatest Common Divisor of 45, 83 and 79, using prime factorization. | 4 |
| 622 | Find Greatest Common Divisor of 24 and 8, using prime factorization. | 4 |
| 623 | Find Greatest Common Divisor of 33728 and 26880, using prime factorization. | 4 |
| 624 | Find Greatest Common Divisor of 414 and 662, by listing out the factors. | 4 |
| 625 | Find Greatest Common Divisor of 20 and 67, using Euclidean algorithm. | 4 |
| 626 | Find Greatest Common Divisor of 1 and 19, using prime factorization. | 4 |
| 627 | Find Greatest Common Divisor of 22 and 33, using Euclidean algorithm. | 4 |
| 628 | Find Greatest Common Divisor of 5 and 75, using Euclidean algorithm. | 4 |
| 629 | Find Greatest Common Divisor of 15 and 35, using Euclidean algorithm. | 4 |
| 630 | Find Greatest Common Divisor of 1204 and 2400, using prime factorization. | 4 |
| 631 | Find Greatest Common Divisor of 8976 and 345, using Euclidean algorithm. | 4 |
| 632 | Find Greatest Common Divisor of 72, 108 and 2100, using prime factorization. | 4 |
| 633 | Find Greatest Common Divisor of 25 and 49, using prime factorization. | 4 |
| 634 | Find Greatest Common Divisor of 130 and 115, using prime factorization. | 4 |
| 635 | Find Greatest Common Divisor of 140 and 320, using prime factorization. | 4 |
| 636 | Find Greatest Common Divisor of 83 and 47, using prime factorization. | 4 |
| 637 | Find Greatest Common Divisor of 4, 3 and 49, using prime factorization. | 4 |
| 638 | Find Greatest Common Divisor of 2, 8 and 6, using prime factorization. | 3 |
| 639 | Find Greatest Common Divisor of 315, 5, 2 and 2, using repeated division. | 3 |
| 640 | Find Greatest Common Divisor of 315, 5, 2 and 2, by listing out the factors. | 3 |
| 641 | Find Greatest Common Divisor of 315, 5, 2 and 2, using Euclidean algorithm. | 3 |
| 642 | Find Greatest Common Divisor of 36 and 81, using prime factorization. | 3 |
| 643 | Find Greatest Common Divisor of 14. | 3 |
| 644 | Find Greatest Common Divisor of 36303, 3836 and 3827, using prime factorization. | 3 |
| 645 | Find Greatest Common Divisor of 36, 54, 90 and 126, using Euclidean algorithm. | 3 |
| 646 | Find Greatest Common Divisor of 123 and 297, using Euclidean algorithm. | 3 |
| 647 | Find Greatest Common Divisor of 114 and 324, using Euclidean algorithm. | 3 |
| 648 | Find Greatest Common Divisor of 2024. | 3 |
| 649 | Find Greatest Common Divisor of 420 and 200, using prime factorization. | 3 |
| 650 | Find Greatest Common Divisor of 7250 and 2360, using Euclidean algorithm. | 3 |
