GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 651 | Find Greatest Common Divisor of 388 and 189, using repeated division. | 3 |
| 652 | Find Greatest Common Divisor of 359 and 125, using Euclidean algorithm. | 3 |
| 653 | Find Greatest Common Divisor of 77, 33 and 22, using prime factorization. | 3 |
| 654 | Find Greatest Common Divisor of 1432 and 156, using prime factorization. | 3 |
| 655 | Find Greatest Common Divisor of 232 and 562, using Euclidean algorithm. | 3 |
| 656 | Find Greatest Common Divisor of 36 and 42, using prime factorization. | 3 |
| 657 | Find Greatest Common Divisor of 1638 and 2036, using prime factorization. | 3 |
| 658 | Find Greatest Common Divisor of 11391 and 5673, using Euclidean algorithm. | 3 |
| 659 | Find Greatest Common Divisor of 54796 and 605, using Euclidean algorithm. | 3 |
| 660 | Find Greatest Common Divisor of 75 and 253, using prime factorization. | 3 |
| 661 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, by listing out the factors. | 3 |
| 662 | Find Greatest Common Divisor of 160 and 9, using repeated division. | 3 |
| 663 | Find Greatest Common Divisor of 26 and 7, using Euclidean algorithm. | 3 |
| 664 | Find Greatest Common Divisor of 20 and 7, using repeated division. | 3 |
| 665 | Find Greatest Common Divisor of 20 and 10, using repeated division. | 3 |
| 666 | Find Greatest Common Divisor of 45 and 56, using prime factorization. | 3 |
| 667 | Find Greatest Common Divisor of 96 and 356, using Euclidean algorithm. | 3 |
| 668 | Find Greatest Common Divisor of 3, 24, 27, 33, 42 and 46, using repeated division. | 3 |
| 669 | Find Greatest Common Divisor of 9800, 420 and 2520, using prime factorization. | 3 |
| 670 | Find Greatest Common Divisor of 9800, 420 and 2520, using repeated division. | 3 |
| 671 | Find Greatest Common Divisor of 10, 25 and 22, using prime factorization. | 3 |
| 672 | Find Greatest Common Divisor of 32 and 936, using repeated division. | 3 |
| 673 | Find Greatest Common Divisor of 289 and 377, using prime factorization. | 3 |
| 674 | Find Greatest Common Divisor of 22 and 10, using prime factorization. | 3 |
| 675 | Find Greatest Common Divisor of 67890 and 12345, using prime factorization. | 3 |
| 676 | Find Greatest Common Divisor of 45, 83 and 79, using Euclidean algorithm. | 3 |
| 677 | Find Greatest Common Divisor of 29 and 63, using Euclidean algorithm. | 3 |
| 678 | Find Greatest Common Divisor of 6536 and 9503, using Euclidean algorithm. | 3 |
| 679 | Find Greatest Common Divisor of 5. | 3 |
| 680 | Find Greatest Common Divisor of 1025 and 35, using prime factorization. | 3 |
| 681 | Find Greatest Common Divisor of 30 and 17, using Euclidean algorithm. | 3 |
| 682 | Find Greatest Common Divisor of 47 and 89, using Euclidean algorithm. | 3 |
| 683 | Find Greatest Common Divisor of 1100 and 57330, using prime factorization. | 3 |
| 684 | Find Greatest Common Divisor of 75 and 42, using Euclidean algorithm. | 3 |
| 685 | Find Greatest Common Divisor of 48 and 59, using Euclidean algorithm. | 3 |
| 686 | Find Greatest Common Divisor of 11520 and 5670, using prime factorization. | 3 |
| 687 | Find Greatest Common Divisor of 44 and 90, by listing out the factors. | 3 |
| 688 | Find Greatest Common Divisor of 52 and 39, using Euclidean algorithm. | 3 |
| 689 | Find Greatest Common Divisor of 634 and 472, using Euclidean algorithm. | 3 |
| 690 | Find Greatest Common Divisor of 25 and 68, using Euclidean algorithm. | 3 |
| 691 | Find Greatest Common Divisor of 91 and 32, using Euclidean algorithm. | 3 |
| 692 | Find Greatest Common Divisor of 55, 35 and 50, using Euclidean algorithm. | 3 |
| 693 | Find Greatest Common Divisor of 97 and 29, using Euclidean algorithm. | 3 |
| 694 | Find Greatest Common Divisor of 3 and 53, using prime factorization. | 3 |
| 695 | Find Greatest Common Divisor of 1 and 17, using prime factorization. | 3 |
| 696 | Find Greatest Common Divisor of 23 and 1, using Euclidean algorithm. | 3 |
| 697 | Find Greatest Common Divisor of 22 and 77, using Euclidean algorithm. | 3 |
| 698 | Find Greatest Common Divisor of 26 and 76, using Euclidean algorithm. | 3 |
| 699 | Find Greatest Common Divisor of 8 and 52, using prime factorization. | 3 |
| 700 | Find Greatest Common Divisor of 85 and 28, using Euclidean algorithm. | 3 |
