GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5551 | Find Greatest Common Divisor of 6825 and 11846, using Euclidean algorithm. | 1 |
| 5552 | Find Greatest Common Divisor of 6897 and 1597, using Euclidean algorithm. | 1 |
| 5553 | Find Greatest Common Divisor of 6897 and 11155, using Euclidean algorithm. | 1 |
| 5554 | Find Greatest Common Divisor of 75 and 618, using prime factorization. | 1 |
| 5555 | Find Greatest Common Divisor of 25 and 952, using prime factorization. | 1 |
| 5556 | Find Greatest Common Divisor of 2040 and 629, using Euclidean algorithm. | 1 |
| 5557 | Find Greatest Common Divisor of 48, 108 and 120, using prime factorization. | 1 |
| 5558 | Find Greatest Common Divisor of 52 and 234, using prime factorization. | 1 |
| 5559 | Find Greatest Common Divisor of 168 and 126, by listing out the factors. | 1 |
| 5560 | Find Greatest Common Divisor of 60 and 100, using repeated division. | 1 |
| 5561 | Find Greatest Common Divisor of 627 and 19, using prime factorization. | 1 |
| 5562 | Find Greatest Common Divisor of 627 and 19, using Euclidean algorithm. | 1 |
| 5563 | Find Greatest Common Divisor of 133 and 38, using repeated division. | 1 |
| 5564 | Find Greatest Common Divisor of 133 and 28, using repeated division. | 1 |
| 5565 | Find Greatest Common Divisor of 18, 24 and 12, using repeated division. | 1 |
| 5566 | Find Greatest Common Divisor of 18, 24 and 12, using Euclidean algorithm. | 1 |
| 5567 | Find Greatest Common Divisor of 18, 24 and 12, by listing out the factors. | 1 |
| 5568 | Find Greatest Common Divisor of 5504 and 385, using Euclidean algorithm. | 1 |
| 5569 | Find Greatest Common Divisor of 45 and 33, using Euclidean algorithm. | 1 |
| 5570 | Find Greatest Common Divisor of 31 and 17, using Euclidean algorithm. | 1 |
| 5571 | Find Greatest Common Divisor of 401 and 700, using prime factorization. | 1 |
| 5572 | Find Greatest Common Divisor of 121 and 81, using Euclidean algorithm. | 1 |
| 5573 | Find Greatest Common Divisor of 121, 645, 100, 408, 832, 19, 2, 432, 902, 8, 176, 640 and 19, using prime factorization. | 1 |
| 5574 | Find Greatest Common Divisor of 121, 645, 100, 408, 832, 19, 2, 432, 902, 8, 176, 640 and 19, using Euclidean algorithm. | 1 |
| 5575 | Find Greatest Common Divisor of 121645100408832019 and 2432902008176640019, using Euclidean algorithm. | 1 |
| 5576 | Find Greatest Common Divisor of 119 and 43, using Euclidean algorithm. | 1 |
| 5577 | Find Greatest Common Divisor of 24 and 80, using Euclidean algorithm. | 1 |
| 5578 | Find Greatest Common Divisor of 2024 and 1277, using repeated division. | 1 |
| 5579 | Find Greatest Common Divisor of 36 and 121, using prime factorization. | 1 |
| 5580 | Find Greatest Common Divisor of 8400 and 6816, using repeated division. | 1 |
| 5581 | Find Greatest Common Divisor of 1547 and 560, using Euclidean algorithm. | 1 |
| 5582 | Find Greatest Common Divisor of 120 and 22, using prime factorization. | 1 |
| 5583 | Find Greatest Common Divisor of 18, 19 and 22, using prime factorization. | 1 |
| 5584 | Find Greatest Common Divisor of 9, 12 and 21, using prime factorization. | 1 |
| 5585 | Find Greatest Common Divisor of 4480 and 1000, using prime factorization. | 1 |
| 5586 | Find Greatest Common Divisor of 36, 72 and 102, using prime factorization. | 1 |
| 5587 | Find Greatest Common Divisor of 503, 1101 and 2002, using prime factorization. | 1 |
| 5588 | Find Greatest Common Divisor of 544 and 212, using Euclidean algorithm. | 1 |
| 5589 | Find Greatest Common Divisor of 4 and 1, using Euclidean algorithm. | 1 |
| 5590 | Find Greatest Common Divisor of 4480 and 1000, by listing out the factors. | 1 |
| 5591 | Find Greatest Common Divisor of 4, 3, 8, 2, 20, 24, 2, 3, 18, 2, 46 and 30, using prime factorization. | 1 |
| 5592 | Find Greatest Common Divisor of 49 and 620, using Euclidean algorithm. | 1 |
| 5593 | Find Greatest Common Divisor of 91 and 267, using Euclidean algorithm. | 1 |
| 5594 | Find Greatest Common Divisor of 18, 12 and 24, using prime factorization. | 1 |
| 5595 | Find Greatest Common Divisor of 3 and 26, using Euclidean algorithm. | 1 |
| 5596 | Find Greatest Common Divisor of 60 and 17, using Euclidean algorithm. | 1 |
| 5597 | Find Greatest Common Divisor of 23 and 18, using prime factorization. | 1 |
| 5598 | Find Greatest Common Divisor of 8496 and 5234, using Euclidean algorithm. | 1 |
| 5599 | Find Greatest Common Divisor of 239 and 5, using Euclidean algorithm. | 1 |
| 5600 | Find Greatest Common Divisor of 3567986 and 61063, using prime factorization. | 1 |
