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 10 and 43, using prime factorization. | 2 |
| 3602 | Find Greatest Common Divisor of 77 and 43, using prime factorization. | 2 |
| 3603 | Find Greatest Common Divisor of 77 and 43, using repeated division. | 2 |
| 3604 | Find Greatest Common Divisor of 225 and 135, using prime factorization. | 2 |
| 3605 | Find Greatest Common Divisor of 2, 48, 2, 88, 3 and 6, using prime factorization. | 2 |
| 3606 | Find Greatest Common Divisor of 21 and 17, using prime factorization. | 2 |
| 3607 | Find Greatest Common Divisor of 37 and 11, using Euclidean algorithm. | 2 |
| 3608 | Find Greatest Common Divisor of 6 and 36, using repeated division. | 2 |
| 3609 | Find Greatest Common Divisor of 6 and 36, using Euclidean algorithm. | 2 |
| 3610 | Find Greatest Common Divisor of 6 and 36, by listing out the factors. | 2 |
| 3611 | Find Greatest Common Divisor of 40 and 210, using prime factorization. | 2 |
| 3612 | Find Greatest Common Divisor of 191970722221012020 and 1111707, using prime factorization. | 2 |
| 3613 | Find Greatest Common Divisor of 191970722221012020 and 1111707, using Euclidean algorithm. | 2 |
| 3614 | Find Greatest Common Divisor of 30, 45 and 60, using prime factorization. | 2 |
| 3615 | Find Greatest Common Divisor of 32 and 14, using repeated division. | 2 |
| 3616 | Find Greatest Common Divisor of 80 and 90, using prime factorization. | 2 |
| 3617 | Find Greatest Common Divisor of 30 and 42, using Euclidean algorithm. | 2 |
| 3618 | Find Greatest Common Divisor of 585 and 234, using Euclidean algorithm. | 2 |
| 3619 | Find Greatest Common Divisor of 75 and 60, using prime factorization. | 2 |
| 3620 | Find Greatest Common Divisor of 0, 0, 68, 0, 328, 0, 68 and 328, using Euclidean algorithm. | 2 |
| 3621 | Find Greatest Common Divisor of 73880, 55305 and 50840, using prime factorization. | 2 |
| 3622 | Find Greatest Common Divisor of 2672, 1 and 67, using prime factorization. | 2 |
| 3623 | Find Greatest Common Divisor of 1 and 18, using prime factorization. | 2 |
| 3624 | Find Greatest Common Divisor of 471 and 9231, using Euclidean algorithm. | 2 |
| 3625 | Find Greatest Common Divisor of 26, 46 and 48, using prime factorization. | 2 |
| 3626 | Find Greatest Common Divisor of 1500 and 200, using prime factorization. | 2 |
| 3627 | Find Greatest Common Divisor of 34. | 2 |
| 3628 | Find Greatest Common Divisor of 321 and 100, using prime factorization. | 2 |
| 3629 | Find Greatest Common Divisor of 1567 and 11, using prime factorization. | 2 |
| 3630 | Find Greatest Common Divisor of 64, 224 and 96, using prime factorization. | 2 |
| 3631 | Find Greatest Common Divisor of 64, 224, 96 and 608, using prime factorization. | 2 |
| 3632 | Find Greatest Common Divisor of 64, 224, 96 and 304, using prime factorization. | 2 |
| 3633 | Find Greatest Common Divisor of 1547 and 1440, using prime factorization. | 2 |
| 3634 | Find Greatest Common Divisor of 210, 60 and 45, using prime factorization. | 2 |
| 3635 | Find Greatest Common Divisor of 10672 and 4147, using Euclidean algorithm. | 2 |
| 3636 | Find Greatest Common Divisor of 54321 and 9876, using Euclidean algorithm. | 2 |
| 3637 | Find Greatest Common Divisor of 69 and 372, using Euclidean algorithm. | 2 |
| 3638 | Find Greatest Common Divisor of 162 and 53, using Euclidean algorithm. | 2 |
| 3639 | Find Greatest Common Divisor of 52598 and 2541, using Euclidean algorithm. | 2 |
| 3640 | Find Greatest Common Divisor of 28 and 5, using Euclidean algorithm. | 2 |
| 3641 | Find Greatest Common Divisor of 46 and 23, using Euclidean algorithm. | 2 |
| 3642 | Find Greatest Common Divisor of 276 and 115, using Euclidean algorithm. | 2 |
| 3643 | Find Greatest Common Divisor of 75 and 100, using repeated division. | 2 |
| 3644 | Find Greatest Common Divisor of 91 and 21, using Euclidean algorithm. | 2 |
| 3645 | Find Greatest Common Divisor of 524 and 148, using Euclidean algorithm. | 2 |
| 3646 | Find Greatest Common Divisor of 513 and 2025, using Euclidean algorithm. | 2 |
| 3647 | Find Greatest Common Divisor of 115 and 6644, using repeated division. | 2 |
| 3648 | Find Greatest Common Divisor of 115 and 644, using Euclidean algorithm. | 2 |
| 3649 | Find Greatest Common Divisor of 48 and 54, using prime factorization. | 2 |
| 3650 | Find Greatest Common Divisor of 24, 60 and 96, using prime factorization. | 2 |