GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1701 | Find Greatest Common Divisor of 7939 and 437325, using Euclidean algorithm. | 5 |
| 1702 | Find Greatest Common Divisor of 2304, 20736 and 576, using prime factorization. | 5 |
| 1703 | Find Greatest Common Divisor of 52, 9843 and 105, using prime factorization. | 5 |
| 1704 | Find Greatest Common Divisor of 120 and 180, using repeated division. | 5 |
| 1705 | Find Greatest Common Divisor of 1625 and 975, using Euclidean algorithm. | 5 |
| 1706 | Find Greatest Common Divisor of 7963409. | 5 |
| 1707 | Find Greatest Common Divisor of 54, 84 and 108, using Euclidean algorithm. | 5 |
| 1708 | Find Greatest Common Divisor of 54, 84 and 108, using repeated division. | 5 |
| 1709 | Find Greatest Common Divisor of 69 and 161, using Euclidean algorithm. | 5 |
| 1710 | Find Greatest Common Divisor of 2210 and 1131, using Euclidean algorithm. | 5 |
| 1711 | Find Greatest Common Divisor of 45 and 67, using prime factorization. | 5 |
| 1712 | Find Greatest Common Divisor of 27 and 180, using prime factorization. | 5 |
| 1713 | Find Greatest Common Divisor of 2 and 90, using prime factorization. | 5 |
| 1714 | Find Greatest Common Divisor of 82071 and 1133349, using prime factorization. | 5 |
| 1715 | Find Greatest Common Divisor of 104 and 42, using Euclidean algorithm. | 5 |
| 1716 | Find Greatest Common Divisor of 98 and 57, using prime factorization. | 5 |
| 1717 | Find Greatest Common Divisor of 98 and 105, using prime factorization. | 5 |
| 1718 | Find Greatest Common Divisor of 34 and 255, using Euclidean algorithm. | 5 |
| 1719 | Find Greatest Common Divisor of 36, 24 and 60, using prime factorization. | 5 |
| 1720 | Find Greatest Common Divisor of 36, 24 and 60, using repeated division. | 5 |
| 1721 | Find Greatest Common Divisor of 7 and 8, using Euclidean algorithm. | 5 |
| 1722 | Find Greatest Common Divisor of 16. | 5 |
| 1723 | Find Greatest Common Divisor of 756 and 537, using Euclidean algorithm. | 5 |
| 1724 | Find Greatest Common Divisor of 114. | 5 |
| 1725 | Find Greatest Common Divisor of 98 and 199, using Euclidean algorithm. | 5 |
| 1726 | Find Greatest Common Divisor of 4901 and 1729, using prime factorization. | 5 |
| 1727 | Find Greatest Common Divisor of 120. | 5 |
| 1728 | Find Greatest Common Divisor of 120 and 168, using prime factorization. | 5 |
| 1729 | Find Greatest Common Divisor of 128 and 1001, using Euclidean algorithm. | 5 |
| 1730 | Find Greatest Common Divisor of 7234 and 3476, using Euclidean algorithm. | 5 |
| 1731 | Find Greatest Common Divisor of 30864 and 15400, using prime factorization. | 5 |
| 1732 | Find Greatest Common Divisor of 3486 and 10292, using Euclidean algorithm. | 5 |
| 1733 | Find Greatest Common Divisor of 180 and 4725, using prime factorization. | 5 |
| 1734 | Find Greatest Common Divisor of 4900 and 602, using repeated division. | 5 |
| 1735 | Find Greatest Common Divisor of 537 and 120, using Euclidean algorithm. | 5 |
| 1736 | Find Greatest Common Divisor of 110, 180 and 540, using Euclidean algorithm. | 5 |
| 1737 | Find Greatest Common Divisor of 110, 180 and 540, using repeated division. | 5 |
| 1738 | Find Greatest Common Divisor of 1200 and 3400, using prime factorization. | 5 |
| 1739 | Find Greatest Common Divisor of 70, 105 and 175, by listing out the factors. | 5 |
| 1740 | | 5 |
| 1741 | Find Greatest Common Divisor of 12, 15 and 75, using repeated division. | 5 |
| 1742 | Find Greatest Common Divisor of 161 and 28, using prime factorization. | 5 |
| 1743 | Find Greatest Common Divisor of 96, 112 and 144, by listing out the factors. | 5 |
| 1744 | Find Greatest Common Divisor of 20 and 3, using prime factorization. | 5 |
| 1745 | Find Greatest Common Divisor of 45 and 33, using prime factorization. | 5 |
| 1746 | Find Greatest Common Divisor of 77 and 128, using prime factorization. | 5 |
| 1747 | Find Greatest Common Divisor of 36 and 54, using Euclidean algorithm. | 5 |
| 1748 | Find Greatest Common Divisor of 12 and 1234, using Euclidean algorithm. | 5 |
| 1749 | Find Greatest Common Divisor of 315 and 825, using prime factorization. | 5 |
| 1750 | Find Greatest Common Divisor of 49 and 640, using Euclidean algorithm. | 5 |