GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5601 | Find Greatest Common Divisor of 115 and 184, using repeated division. | 1 |
| 5602 | Find Greatest Common Divisor of 165 and 285, using prime factorization. | 1 |
| 5603 | Find Greatest Common Divisor of 165 and 285, using Euclidean algorithm. | 1 |
| 5604 | Find Greatest Common Divisor of 91, 64 and 87, using repeated division. | 1 |
| 5605 | Find Greatest Common Divisor of 28 and 38, using prime factorization. | 1 |
| 5606 | Find Greatest Common Divisor of 28 and 38, using repeated division. | 1 |
| 5607 | Find Greatest Common Divisor of 28 and 38, using Euclidean algorithm. | 1 |
| 5608 | Find Greatest Common Divisor of 54 and 68, using prime factorization. | 1 |
| 5609 | Find Greatest Common Divisor of 2000 and 3000, using prime factorization. | 1 |
| 5610 | Find Greatest Common Divisor of 34 and 18, using prime factorization. | 1 |
| 5611 | Find Greatest Common Divisor of 378 and 140, using prime factorization. | 1 |
| 5612 | Find Greatest Common Divisor of 378 and 140, using repeated division. | 1 |
| 5613 | Find Greatest Common Divisor of 31 and 12, using prime factorization. | 1 |
| 5614 | Find Greatest Common Divisor of 10 and 30, using Euclidean algorithm. | 1 |
| 5615 | Find Greatest Common Divisor of 42 and 18, using Euclidean algorithm. | 1 |
| 5616 | Find Greatest Common Divisor of 110 and 2511, by listing out the factors. | 1 |
| 5617 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, using prime factorization. | 1 |
| 5618 | Find Greatest Common Divisor of 616 and 32, using prime factorization. | 1 |
| 5619 | Find Greatest Common Divisor of 2282 and 420, using prime factorization. | 1 |
| 5620 | Find Greatest Common Divisor of 48153687 and 165849, using prime factorization. | 1 |
| 5621 | Find Greatest Common Divisor of 2, 50, 1, 2, 60 and 1, using prime factorization. | 1 |
| 5622 | Find Greatest Common Divisor of 23, 17, 23 and 31, using prime factorization. | 1 |
| 5623 | Find Greatest Common Divisor of 7, 5, 4, 3, 1, 8, 5, 5, 3, 2, 2 and 2, using Euclidean algorithm. | 1 |
| 5624 | Find Greatest Common Divisor of 160 and 1, using prime factorization. | 1 |
| 5625 | Find Greatest Common Divisor of 2915 and 1445, using repeated division. | 1 |
| 5626 | Find Greatest Common Divisor of 147 and 91, using Euclidean algorithm. | 1 |
| 5627 | Find Greatest Common Divisor of 130 and 99, using Euclidean algorithm. | 1 |
| 5628 | Find Greatest Common Divisor of 5, 9, 2 and 3, using Euclidean algorithm. | 1 |
| 5629 | Find Greatest Common Divisor of 52 and 104, using prime factorization. | 1 |
| 5630 | Find Greatest Common Divisor of 3 and 111, using prime factorization. | 1 |
| 5631 | Find Greatest Common Divisor of 2 and 111, using prime factorization. | 1 |
| 5632 | Find Greatest Common Divisor of 1547 and 3536, using prime factorization. | 1 |
| 5633 | Find Greatest Common Divisor of 1547 and 3543, using Euclidean algorithm. | 1 |
| 5634 | Find Greatest Common Divisor of 23, 10, 23 and 7, using prime factorization. | 1 |
| 5635 | Find Greatest Common Divisor of 5 and 10, using prime factorization. | 1 |
| 5636 | Find Greatest Common Divisor of 36 and 49, using prime factorization. | 1 |
| 5637 | Find Greatest Common Divisor of 72 and 124, using prime factorization. | 1 |
| 5638 | Find Greatest Common Divisor of 3850 and 1162, using Euclidean algorithm. | 1 |
| 5639 | Find Greatest Common Divisor of 4 and 6, using prime factorization. | 1 |
| 5640 | Find Greatest Common Divisor of 1013, 11143 and 112443, using Euclidean algorithm. | 1 |
| 5641 | Find Greatest Common Divisor of 1013, 11143 and 112443, using prime factorization. | 1 |
| 5642 | Find Greatest Common Divisor of 1013, 11143 and 112443, using repeated division. | 1 |
| 5643 | Find Greatest Common Divisor of 1013, 11143 and 112443, by listing out the factors. | 1 |
| 5644 | Find Greatest Common Divisor of 1013 and 11143, using Euclidean algorithm. | 1 |
| 5645 | Find Greatest Common Divisor of 196 and 245, using Euclidean algorithm. | 1 |
| 5646 | Find Greatest Common Divisor of 73556 and 3444, using Euclidean algorithm. | 1 |
| 5647 | Find Greatest Common Divisor of 21 and 56, using prime factorization. | 1 |
| 5648 | Find Greatest Common Divisor of 10, 12 and 60, using prime factorization. | 1 |
| 5649 | Find Greatest Common Divisor of 202 and 219, using Euclidean algorithm. | 1 |
| 5650 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using Euclidean algorithm. | 1 |
