GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
3601 | Find Greatest Common Divisor of 6897 and 1597, using Euclidean algorithm. | 1 |
3602 | Find Greatest Common Divisor of 6897 and 11155, using Euclidean algorithm. | 1 |
3603 | Find Greatest Common Divisor of 25 and 777, using prime factorization. | 1 |
3604 | Find Greatest Common Divisor of 75 and 618, using prime factorization. | 1 |
3605 | Find Greatest Common Divisor of 25 and 952, using prime factorization. | 1 |
3606 | Find Greatest Common Divisor of 2040 and 629, using Euclidean algorithm. | 1 |
3607 | Find Greatest Common Divisor of 48, 108 and 120, using prime factorization. | 1 |
3608 | Find Greatest Common Divisor of 52 and 234, using prime factorization. | 1 |
3609 | Find Greatest Common Divisor of 168 and 126, by listing out the factors. | 1 |
3610 | Find Greatest Common Divisor of 60 and 100, using repeated division. | 1 |
3611 | Find Greatest Common Divisor of 627 and 19, using prime factorization. | 1 |
3612 | Find Greatest Common Divisor of 627 and 19, using Euclidean algorithm. | 1 |
3613 | Find Greatest Common Divisor of 133 and 38, using repeated division. | 1 |
3614 | Find Greatest Common Divisor of 133 and 28, using repeated division. | 1 |
3615 | Find Greatest Common Divisor of 97 and 1045, using prime factorization. | 1 |
3616 | Find Greatest Common Divisor of 18, 24 and 12, using repeated division. | 1 |
3617 | Find Greatest Common Divisor of 18, 24 and 12, using Euclidean algorithm. | 1 |
3618 | Find Greatest Common Divisor of 18, 24 and 12, by listing out the factors. | 1 |
3619 | Find Greatest Common Divisor of 5504 and 385, using Euclidean algorithm. | 1 |
3620 | Find Greatest Common Divisor of 45 and 33, using Euclidean algorithm. | 1 |
3621 | Find Greatest Common Divisor of 31 and 17, using Euclidean algorithm. | 1 |
3622 | Find Greatest Common Divisor of 401 and 700, using prime factorization. | 1 |
3623 | Find Greatest Common Divisor of 48 and 60, using Euclidean algorithm. | 1 |
3624 | Find Greatest Common Divisor of 48 and 60, using repeated division. | 1 |
3625 | Find Greatest Common Divisor of 121 and 81, using Euclidean algorithm. | 1 |
3626 | Find Greatest Common Divisor of 121, 645, 100, 408, 832, 19, 2, 432, 902, 8, 176, 640 and 19, using prime factorization. | 1 |
3627 | Find Greatest Common Divisor of 121, 645, 100, 408, 832, 19, 2, 432, 902, 8, 176, 640 and 19, using Euclidean algorithm. | 1 |
3628 | Find Greatest Common Divisor of 121645100408832019 and 2432902008176640019, using Euclidean algorithm. | 1 |
3629 | Find Greatest Common Divisor of 119 and 43, using Euclidean algorithm. | 1 |
3630 | Find Greatest Common Divisor of 24 and 80, using Euclidean algorithm. | 1 |
3631 | Find Greatest Common Divisor of 2024 and 1277, using repeated division. | 1 |
3632 | Find Greatest Common Divisor of 36 and 121, using prime factorization. | 1 |
3633 | Find Greatest Common Divisor of 1160718174 and 316258250, using prime factorization. | 1 |
3634 | Find Greatest Common Divisor of 8400 and 6816, using repeated division. | 1 |
3635 | Find Greatest Common Divisor of 1547 and 560, using Euclidean algorithm. | 1 |
3636 | Find Greatest Common Divisor of 120 and 22, using prime factorization. | 1 |
3637 | Find Greatest Common Divisor of 18, 19 and 22, using prime factorization. | 1 |
3638 | Find Greatest Common Divisor of 9, 12 and 21, using prime factorization. | 1 |
3639 | Find Greatest Common Divisor of 4480 and 1000, using prime factorization. | 1 |
3640 | Find Greatest Common Divisor of 36, 72 and 102, using prime factorization. | 1 |
3641 | Find Greatest Common Divisor of 503, 1101 and 2002, using prime factorization. | 1 |
3642 | Find Greatest Common Divisor of 544 and 212, using Euclidean algorithm. | 1 |
3643 | Find Greatest Common Divisor of 4 and 1, using Euclidean algorithm. | 1 |
3644 | Find Greatest Common Divisor of 4480 and 1000, by listing out the factors. | 1 |
3645 | Find Greatest Common Divisor of 72 and 4, using prime factorization. | 1 |
3646 | Find Greatest Common Divisor of 4, 3, 8, 2, 20, 24, 2, 3, 18, 2, 46 and 30, using prime factorization. | 1 |
3647 | Find Greatest Common Divisor of 49 and 620, using Euclidean algorithm. | 1 |
3648 | Find Greatest Common Divisor of 91 and 267, using Euclidean algorithm. | 1 |
3649 | Find Greatest Common Divisor of 18, 12 and 24, using prime factorization. | 1 |
3650 | Find Greatest Common Divisor of 3 and 26, using Euclidean algorithm. | 1 |