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 2, 48, 2, 88, 3 and 6, using prime factorization. | 2 |
| 3652 | Find Greatest Common Divisor of 16534528044 and 8332745927, using prime factorization. | 2 |
| 3653 | Find Greatest Common Divisor of 21 and 17, using prime factorization. | 2 |
| 3654 | Find Greatest Common Divisor of 37 and 11, using Euclidean algorithm. | 2 |
| 3655 | Find Greatest Common Divisor of 6 and 36, using repeated division. | 2 |
| 3656 | Find Greatest Common Divisor of 6 and 36, using Euclidean algorithm. | 2 |
| 3657 | Find Greatest Common Divisor of 6 and 36, by listing out the factors. | 2 |
| 3658 | Find Greatest Common Divisor of 40 and 210, using prime factorization. | 2 |
| 3659 | Find Greatest Common Divisor of 191970722221012020 and 1111707, using prime factorization. | 2 |
| 3660 | Find Greatest Common Divisor of 191970722221012020 and 1111707, using Euclidean algorithm. | 2 |
| 3661 | Find Greatest Common Divisor of 30, 45 and 60, using prime factorization. | 2 |
| 3662 | Find Greatest Common Divisor of 32 and 14, using repeated division. | 2 |
| 3663 | Find Greatest Common Divisor of 80 and 90, using prime factorization. | 2 |
| 3664 | Find Greatest Common Divisor of 30 and 42, using Euclidean algorithm. | 2 |
| 3665 | Find Greatest Common Divisor of 585 and 234, using Euclidean algorithm. | 2 |
| 3666 | Find Greatest Common Divisor of 75 and 60, using prime factorization. | 2 |
| 3667 | Find Greatest Common Divisor of 0, 0, 68, 0, 328, 0, 68 and 328, using Euclidean algorithm. | 2 |
| 3668 | Find Greatest Common Divisor of 73880, 55305 and 50840, using prime factorization. | 2 |
| 3669 | Find Greatest Common Divisor of 2672, 1 and 67, using prime factorization. | 2 |
| 3670 | Find Greatest Common Divisor of 1 and 18, using prime factorization. | 2 |
| 3671 | Find Greatest Common Divisor of 471 and 9231, using Euclidean algorithm. | 2 |
| 3672 | Find Greatest Common Divisor of 26, 46 and 48, using prime factorization. | 2 |
| 3673 | Find Greatest Common Divisor of 1500 and 200, using prime factorization. | 2 |
| 3674 | Find Greatest Common Divisor of 34. | 2 |
| 3675 | Find Greatest Common Divisor of 321 and 100, using prime factorization. | 2 |
| 3676 | Find Greatest Common Divisor of 1567 and 11, using prime factorization. | 2 |
| 3677 | Find Greatest Common Divisor of 64, 224 and 96, using prime factorization. | 2 |
| 3678 | Find Greatest Common Divisor of 64, 224, 96 and 608, using prime factorization. | 2 |
| 3679 | Find Greatest Common Divisor of 64, 224, 96 and 304, using prime factorization. | 2 |
| 3680 | Find Greatest Common Divisor of 1547 and 1440, using prime factorization. | 2 |
| 3681 | Find Greatest Common Divisor of 210, 60 and 45, using prime factorization. | 2 |
| 3682 | Find Greatest Common Divisor of 10672 and 4147, using Euclidean algorithm. | 2 |
| 3683 | Find Greatest Common Divisor of 54321 and 9876, using Euclidean algorithm. | 2 |
| 3684 | Find Greatest Common Divisor of 69 and 372, using Euclidean algorithm. | 2 |
| 3685 | Find Greatest Common Divisor of 162 and 53, using Euclidean algorithm. | 2 |
| 3686 | Find Greatest Common Divisor of 52598 and 2541, using Euclidean algorithm. | 2 |
| 3687 | Find Greatest Common Divisor of 28 and 5, using Euclidean algorithm. | 2 |
| 3688 | Find Greatest Common Divisor of 46 and 23, using Euclidean algorithm. | 2 |
| 3689 | Find Greatest Common Divisor of 276 and 115, using Euclidean algorithm. | 2 |
| 3690 | Find Greatest Common Divisor of 75 and 100, using repeated division. | 2 |
| 3691 | Find Greatest Common Divisor of 91 and 21, using Euclidean algorithm. | 2 |
| 3692 | Find Greatest Common Divisor of 524 and 148, using Euclidean algorithm. | 2 |
| 3693 | Find Greatest Common Divisor of 513 and 2025, using Euclidean algorithm. | 2 |
| 3694 | Find Greatest Common Divisor of 115 and 6644, using repeated division. | 2 |
| 3695 | Find Greatest Common Divisor of 115 and 644, using Euclidean algorithm. | 2 |
| 3696 | Find Greatest Common Divisor of 48 and 54, using prime factorization. | 2 |
| 3697 | Find Greatest Common Divisor of 24, 60 and 96, using prime factorization. | 2 |
| 3698 | Find Greatest Common Divisor of 216 and 234, using prime factorization. | 2 |
| 3699 | Find Greatest Common Divisor of 184 and 460, using prime factorization. | 2 |
| 3700 | Find Greatest Common Divisor of 64 and 70, using prime factorization. | 2 |