GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3551 | Find Greatest Common Divisor of 3158 and 1226, using Euclidean algorithm. | 2 |
| 3552 | Find Greatest Common Divisor of 11 and 39, using Euclidean algorithm. | 2 |
| 3553 | Find Greatest Common Divisor of 6144 and 20, using prime factorization. | 2 |
| 3554 | Find Greatest Common Divisor of 85672 and 242040, using Euclidean algorithm. | 2 |
| 3555 | Find Greatest Common Divisor of 5, 7 and 13, using prime factorization. | 2 |
| 3556 | Find Greatest Common Divisor of 1492 and 1066, using Euclidean algorithm. | 2 |
| 3557 | Find Greatest Common Divisor of 2437 and 875, using Euclidean algorithm. | 2 |
| 3558 | Find Greatest Common Divisor of 20 and 220, using Euclidean algorithm. | 2 |
| 3559 | Find Greatest Common Divisor of 10612 and 252, using prime factorization. | 2 |
| 3560 | Find Greatest Common Divisor of 240 and 180, using Euclidean algorithm. | 2 |
| 3561 | Find Greatest Common Divisor of 1170 and 100, using prime factorization. | 2 |
| 3562 | Find Greatest Common Divisor of 17 and 117, using prime factorization. | 2 |
| 3563 | Find Greatest Common Divisor of 99, 198, 288 and 512, using Euclidean algorithm. | 2 |
| 3564 | Find Greatest Common Divisor of 20, 40 and 80, using repeated division. | 2 |
| 3565 | Find Greatest Common Divisor of 7373 and 5548, using Euclidean algorithm. | 2 |
| 3566 | Find Greatest Common Divisor of 0 and 0, using prime factorization. | 2 |
| 3567 | Find Greatest Common Divisor of 2465 and 5561, by listing out the factors. | 2 |
| 3568 | Find Greatest Common Divisor of 4, 36 and 84, using prime factorization. | 2 |
| 3569 | Find Greatest Common Divisor of 264 and 300, using prime factorization. | 2 |
| 3570 | Find Greatest Common Divisor of 360 and 1020, using prime factorization. | 2 |
| 3571 | Find Greatest Common Divisor of 79981981272 and 8023, using repeated division. | 2 |
| 3572 | Find Greatest Common Divisor of 72, 120 and 144, using prime factorization. | 2 |
| 3573 | Find Greatest Common Divisor of 100, 250 and 350, using repeated division. | 2 |
| 3574 | Find Greatest Common Divisor of 96, 144 and 19, using prime factorization. | 2 |
| 3575 | Find Greatest Common Divisor of 132 and 220, using repeated division. | 2 |
| 3576 | Find Greatest Common Divisor of 60, 60 and 60, using prime factorization. | 2 |
| 3577 | Find Greatest Common Divisor of 144, 192 and 48, using prime factorization. | 2 |
| 3578 | Find Greatest Common Divisor of 39 and 65, by listing out the factors. | 2 |
| 3579 | Find Greatest Common Divisor of 63 and 54, using Euclidean algorithm. | 2 |
| 3580 | Find Greatest Common Divisor of 36 and 60, by listing out the factors. | 2 |
| 3581 | Find Greatest Common Divisor of 28, 42 and 49, by listing out the factors. | 2 |
| 3582 | Find Greatest Common Divisor of 28, 42 and 49, using repeated division. | 2 |
| 3583 | Find Greatest Common Divisor of 69 and 63, using prime factorization. | 2 |
| 3584 | Find Greatest Common Divisor of 2, 1 and 6, using prime factorization. | 2 |
| 3585 | Find Greatest Common Divisor of 1, 3 and 6, using prime factorization. | 2 |
| 3586 | Find Greatest Common Divisor of 4 and 69, using prime factorization. | 2 |
| 3587 | Find Greatest Common Divisor of 60, 45 and 90, using prime factorization. | 2 |
| 3588 | Find Greatest Common Divisor of 60, 4, 5 and 3, using prime factorization. | 2 |
| 3589 | Find Greatest Common Divisor of 121 and 324, using prime factorization. | 2 |
| 3590 | Find Greatest Common Divisor of 2024 and 0, using prime factorization. | 2 |
| 3591 | Find Greatest Common Divisor of 2024 and 0, using repeated division. | 2 |
| 3592 | Find Greatest Common Divisor of 4001 and 2689, using prime factorization. | 2 |
| 3593 | Find Greatest Common Divisor of 20 and 15, using Euclidean algorithm. | 2 |
| 3594 | Find Greatest Common Divisor of 5 and 101, using prime factorization. | 2 |
| 3595 | Find Greatest Common Divisor of 5 and 101, using Euclidean algorithm. | 2 |
| 3596 | Find Greatest Common Divisor of 5 and 100, using Euclidean algorithm. | 2 |
| 3597 | Find Greatest Common Divisor of 235 and 1260, using Euclidean algorithm. | 2 |
| 3598 | Find Greatest Common Divisor of 144, 180 and 192, using prime factorization. | 2 |
| 3599 | Find Greatest Common Divisor of 48 and 68, using Euclidean algorithm. | 2 |
| 3600 | Find Greatest Common Divisor of 153 and 119, using repeated division. | 2 |