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 576, 1152, 1280, 136 and 200, using prime factorization. | 3 |
| 602 | Find Greatest Common Divisor of 48 and 64, using prime factorization. | 3 |
| 603 | Find Greatest Common Divisor of 2486625522 and 41582215163, using repeated division. | 3 |
| 604 | Find Greatest Common Divisor of 12, 33 and 15, using prime factorization. | 3 |
| 605 | Find Greatest Common Divisor of 710 and 310, using Euclidean algorithm. | 3 |
| 606 | Find Greatest Common Divisor of 16 and 64, using prime factorization. | 3 |
| 607 | Find Greatest Common Divisor of 48 and 180, using prime factorization. | 3 |
| 608 | Find Greatest Common Divisor of 210 and 315, using prime factorization. | 3 |
| 609 | Find Greatest Common Divisor of 299 and 256, using repeated division. | 3 |
| 610 | Find Greatest Common Divisor of 257, 234 and 185, using prime factorization. | 3 |
| 611 | Find Greatest Common Divisor of 54 and 72, by listing out the factors. | 3 |
| 612 | Find Greatest Common Divisor of 9 and 54, using prime factorization. | 3 |
| 613 | Find Greatest Common Divisor of 15 and 129, using prime factorization. | 3 |
| 614 | Find Greatest Common Divisor of 25 and 100, using prime factorization. | 3 |
| 615 | Find Greatest Common Divisor of 22 and 11, using prime factorization. | 3 |
| 616 | Find Greatest Common Divisor of 9216 and 256, using prime factorization. | 3 |
| 617 | Find Greatest Common Divisor of 66 and 55, using prime factorization. | 3 |
| 618 | Find Greatest Common Divisor of 60 and 24, using Euclidean algorithm. | 3 |
| 619 | Find Greatest Common Divisor of 14 and 24, using prime factorization. | 3 |
| 620 | Find Greatest Common Divisor of 309692 and 556, using prime factorization. | 3 |
| 621 | Find Greatest Common Divisor of 31192 and 56, using prime factorization. | 3 |
| 622 | Find Greatest Common Divisor of 90 and 72, using prime factorization. | 3 |
| 623 | Find Greatest Common Divisor of 10 and 20, using prime factorization. | 3 |
| 624 | Find Greatest Common Divisor of 12 and 8, by listing out the factors. | 3 |
| 625 | Find Greatest Common Divisor of 35742 and 13566, using Euclidean algorithm. | 3 |
| 626 | Find Greatest Common Divisor of 35742 and 13566, using prime factorization. | 3 |
| 627 | Find Greatest Common Divisor of 4357 and 3754, using prime factorization. | 3 |
| 628 | Find Greatest Common Divisor of 1024 and 486, using prime factorization. | 3 |
| 629 | Find Greatest Common Divisor of 486 and 18, using prime factorization. | 3 |
| 630 | Find Greatest Common Divisor of 120 and 500, using prime factorization. | 3 |
| 631 | Find Greatest Common Divisor of 6, 11, 17, 22, 28, 33, 38, 44, 49 and 55, using prime factorization. | 3 |
| 632 | Find Greatest Common Divisor of 1858 and 342, using prime factorization. | 3 |
| 633 | Find Greatest Common Divisor of 34709 and 100313, using Euclidean algorithm. | 3 |
| 634 | Find Greatest Common Divisor of 2437 and 875, using prime factorization. | 3 |
| 635 | Find Greatest Common Divisor of 1001 and 121, using prime factorization. | 3 |
| 636 | Find Greatest Common Divisor of 7373 and 5548, using repeated division. | 3 |
| 637 | Find Greatest Common Divisor of 51 and 3, using prime factorization. | 3 |
| 638 | Find Greatest Common Divisor of 99 and 101, using Euclidean algorithm. | 3 |
| 639 | Find Greatest Common Divisor of 36 and 42, using Euclidean algorithm. | 3 |
| 640 | Find Greatest Common Divisor of 90, 36 and 54, using prime factorization. | 3 |
| 641 | Find Greatest Common Divisor of 11907 and 25, using Euclidean algorithm. | 3 |
| 642 | Find Greatest Common Divisor of 16 and 52, using prime factorization. | 3 |
| 643 | Find Greatest Common Divisor of 6175 and 10000, using prime factorization. | 3 |
| 644 | Find Greatest Common Divisor of 616 and 426, using prime factorization. | 3 |
| 645 | Find Greatest Common Divisor of 123 and 36, using prime factorization. | 3 |
| 646 | Find Greatest Common Divisor of 45 and 240, using prime factorization. | 3 |
| 647 | Find Greatest Common Divisor of 6059. | 3 |
| 648 | Find Greatest Common Divisor of 3768 and 1701, using Euclidean algorithm. | 3 |
| 649 | Find Greatest Common Divisor of 108 and 124, using Euclidean algorithm. | 3 |
| 650 | Find Greatest Common Divisor of 24 and 18, using Euclidean algorithm. | 3 |
