GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5651 | Find Greatest Common Divisor of 21 and 56, using prime factorization. | 1 |
| 5652 | Find Greatest Common Divisor of 10, 12 and 60, using prime factorization. | 1 |
| 5653 | Find Greatest Common Divisor of 202 and 219, using Euclidean algorithm. | 1 |
| 5654 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using Euclidean algorithm. | 1 |
| 5655 | Find Greatest Common Divisor of 126 and 18, using prime factorization. | 1 |
| 5656 | Find Greatest Common Divisor of 126 and 18, using Euclidean algorithm. | 1 |
| 5657 | Find Greatest Common Divisor of 126 and 18, using repeated division. | 1 |
| 5658 | Find Greatest Common Divisor of 126 and 18, by listing out the factors. | 1 |
| 5659 | Find Greatest Common Divisor of 432 and 95256, using prime factorization. | 1 |
| 5660 | Find Greatest Common Divisor of 8448 and 6335, using prime factorization. | 1 |
| 5661 | Find Greatest Common Divisor of 22 and 64, using prime factorization. | 1 |
| 5662 | Find Greatest Common Divisor of 1 and 12, using prime factorization. | 1 |
| 5663 | Find Greatest Common Divisor of 1231 and 1296, using prime factorization. | 1 |
| 5664 | Find Greatest Common Divisor of 7 and 8448, using Euclidean algorithm. | 1 |
| 5665 | Find Greatest Common Divisor of 143 and 277, using prime factorization. | 1 |
| 5666 | Find Greatest Common Divisor of 136 and 232, using prime factorization. | 1 |
| 5667 | Find Greatest Common Divisor of 272 and 1479, using prime factorization. | 1 |
| 5668 | Find Greatest Common Divisor of 272 and 1479, using repeated division. | 1 |
| 5669 | Find Greatest Common Divisor of 143 and 277, by listing out the factors. | 1 |
| 5670 | Find Greatest Common Divisor of 136 and 232, by listing out the factors. | 1 |
| 5671 | Find Greatest Common Divisor of 6 and 51, by listing out the factors. | 1 |
| 5672 | Find Greatest Common Divisor of 33 and 14, by listing out the factors. | 1 |
| 5673 | Find Greatest Common Divisor of 14 and 35, by listing out the factors. | 1 |
| 5674 | Find Greatest Common Divisor of 56 and 72, by listing out the factors. | 1 |
| 5675 | Find Greatest Common Divisor of 7 and 13, using prime factorization. | 1 |
| 5676 | Find Greatest Common Divisor of 18, 24 and 30, using repeated division. | 1 |
| 5677 | Find Greatest Common Divisor of 18, 24 and 30, using Euclidean algorithm. | 1 |
| 5678 | Find Greatest Common Divisor of 18, 24 and 30, by listing out the factors. | 1 |
| 5679 | Find Greatest Common Divisor of 145 and 32, using prime factorization. | 1 |
| 5680 | Find Greatest Common Divisor of 145 and 232, using prime factorization. | 1 |
| 5681 | Find Greatest Common Divisor of 88 and 220, using prime factorization. | 1 |
| 5682 | Find Greatest Common Divisor of 88 and 220, using repeated division. | 1 |
| 5683 | Find Greatest Common Divisor of 64 and 80, by listing out the factors. | 1 |
| 5684 | Find Greatest Common Divisor of 420 and 360, using prime factorization. | 1 |
| 5685 | Find Greatest Common Divisor of 0, 132 and 763, by listing out the factors. | 1 |
| 5686 | Find Greatest Common Divisor of 90, 108 and 126, using prime factorization. | 1 |
| 5687 | Find Greatest Common Divisor of 75, 45 and 60, using prime factorization. | 1 |
| 5688 | Find Greatest Common Divisor of 36, 54 and 90, using prime factorization. | 1 |
| 5689 | Find Greatest Common Divisor of 3, 5 and 6, using prime factorization. | 1 |
| 5690 | Find Greatest Common Divisor of 179 and 67, using Euclidean algorithm. | 1 |
| 5691 | Find Greatest Common Divisor of 400 and 60, using prime factorization. | 1 |
| 5692 | Find Greatest Common Divisor of 28 and 36, using prime factorization. | 1 |
| 5693 | Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using repeated division. | 1 |
| 5694 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using Euclidean algorithm. | 1 |
| 5695 | Find Greatest Common Divisor of 222 and 159, using Euclidean algorithm. | 1 |
| 5696 | Find Greatest Common Divisor of 32 and 36, using Euclidean algorithm. | 1 |
| 5697 | Find Greatest Common Divisor of 5 and 15, using Euclidean algorithm. | 1 |
| 5698 | Find Greatest Common Divisor of 2024 and 572, using Euclidean algorithm. | 1 |
| 5699 | Find Greatest Common Divisor of 60, 150 and 180, using prime factorization. | 1 |
| 5700 | Find Greatest Common Divisor of 510, 680 and 859, using prime factorization. | 1 |
