GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3651 | Find Greatest Common Divisor of 1231 and 1296, using prime factorization. | 1 |
| 3652 | Find Greatest Common Divisor of 7 and 8448, using Euclidean algorithm. | 1 |
| 3653 | Find Greatest Common Divisor of 143 and 277, using prime factorization. | 1 |
| 3654 | Find Greatest Common Divisor of 136 and 232, using prime factorization. | 1 |
| 3655 | Find Greatest Common Divisor of 272 and 1479, using prime factorization. | 1 |
| 3656 | Find Greatest Common Divisor of 272 and 1479, using repeated division. | 1 |
| 3657 | Find Greatest Common Divisor of 272 and 1479, using Euclidean algorithm. | 1 |
| 3658 | Find Greatest Common Divisor of 143 and 277, by listing out the factors. | 1 |
| 3659 | Find Greatest Common Divisor of 136 and 232, by listing out the factors. | 1 |
| 3660 | Find Greatest Common Divisor of 6 and 51, by listing out the factors. | 1 |
| 3661 | Find Greatest Common Divisor of 33 and 14, by listing out the factors. | 1 |
| 3662 | Find Greatest Common Divisor of 14 and 35, by listing out the factors. | 1 |
| 3663 | Find Greatest Common Divisor of 56 and 72, by listing out the factors. | 1 |
| 3664 | Find Greatest Common Divisor of 7 and 13, using prime factorization. | 1 |
| 3665 | Find Greatest Common Divisor of 18, 24 and 30, using repeated division. | 1 |
| 3666 | Find Greatest Common Divisor of 18, 24 and 30, using Euclidean algorithm. | 1 |
| 3667 | Find Greatest Common Divisor of 18, 24 and 30, by listing out the factors. | 1 |
| 3668 | Find Greatest Common Divisor of 145 and 32, using prime factorization. | 1 |
| 3669 | Find Greatest Common Divisor of 145 and 232, using prime factorization. | 1 |
| 3670 | Find Greatest Common Divisor of 88 and 220, using prime factorization. | 1 |
| 3671 | Find Greatest Common Divisor of 88 and 220, using repeated division. | 1 |
| 3672 | Find Greatest Common Divisor of 64 and 80, by listing out the factors. | 1 |
| 3673 | Find Greatest Common Divisor of 420 and 360, using prime factorization. | 1 |
| 3674 | Find Greatest Common Divisor of 0, 132 and 763, by listing out the factors. | 1 |
| 3675 | Find Greatest Common Divisor of 90, 108 and 126, using prime factorization. | 1 |
| 3676 | Find Greatest Common Divisor of 75, 45 and 60, using prime factorization. | 1 |
| 3677 | Find Greatest Common Divisor of 36, 54 and 90, using prime factorization. | 1 |
| 3678 | Find Greatest Common Divisor of 3, 5 and 6, using prime factorization. | 1 |
| 3679 | Find Greatest Common Divisor of 179 and 67, using Euclidean algorithm. | 1 |
| 3680 | Find Greatest Common Divisor of 687 and 24, using Euclidean algorithm. | 1 |
| 3681 | Find Greatest Common Divisor of 400 and 60, using prime factorization. | 1 |
| 3682 | Find Greatest Common Divisor of 28 and 36, using prime factorization. | 1 |
| 3683 | Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using repeated division. | 1 |
| 3684 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using Euclidean algorithm. | 1 |
| 3685 | Find Greatest Common Divisor of 222 and 159, using Euclidean algorithm. | 1 |
| 3686 | Find Greatest Common Divisor of 32 and 36, using Euclidean algorithm. | 1 |
| 3687 | Find Greatest Common Divisor of 5 and 15, using Euclidean algorithm. | 1 |
| 3688 | Find Greatest Common Divisor of 2024 and 572, using Euclidean algorithm. | 1 |
| 3689 | Find Greatest Common Divisor of 60, 150 and 180, using prime factorization. | 1 |
| 3690 | Find Greatest Common Divisor of 510, 680 and 859, using prime factorization. | 1 |
| 3691 | Find Greatest Common Divisor of 510, 680 and 850, using prime factorization. | 1 |
| 3692 | Find Greatest Common Divisor of 660 and 1441, using Euclidean algorithm. | 1 |
| 3693 | Find Greatest Common Divisor of 1584 and 4968, using Euclidean algorithm. | 1 |
| 3694 | Find Greatest Common Divisor of 6, 2, 4 and 5, using prime factorization. | 1 |
| 3695 | Find Greatest Common Divisor of 110 and 2511, using prime factorization. | 1 |
| 3696 | Find Greatest Common Divisor of 180 and 252, using Euclidean algorithm. | 1 |
| 3697 | Find Greatest Common Divisor of 7 and 540, using prime factorization. | 1 |
| 3698 | Find Greatest Common Divisor of 3 and 589, using prime factorization. | 1 |
| 3699 | Find Greatest Common Divisor of 3299 and 647, using Euclidean algorithm. | 1 |
| 3700 | Find Greatest Common Divisor of 17 and 23, using Euclidean algorithm. | 1 |
