GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1751 | Find Greatest Common Divisor of 22 and 90, using prime factorization. | 4 |
| 1752 | Find Greatest Common Divisor of 3605 and 371, using Euclidean algorithm. | 4 |
| 1753 | Find Greatest Common Divisor of 5 and 90, using prime factorization. | 4 |
| 1754 | Find Greatest Common Divisor of 55 and 15, using prime factorization. | 4 |
| 1755 | Find Greatest Common Divisor of 340 and 66, using prime factorization. | 4 |
| 1756 | Find Greatest Common Divisor of 128, 213 and 343, using prime factorization. | 4 |
| 1757 | Find Greatest Common Divisor of 32 and 32, using prime factorization. | 4 |
| 1758 | Find Greatest Common Divisor of 1234 and 5678, using repeated division. | 4 |
| 1759 | Find Greatest Common Divisor of 83, 67, 249 and 134, using prime factorization. | 4 |
| 1760 | Find Greatest Common Divisor of 57 and 19, using prime factorization. | 4 |
| 1761 | Find Greatest Common Divisor of 363 and 1254, using prime factorization. | 4 |
| 1762 | Find Greatest Common Divisor of 81 and 36, using Euclidean algorithm. | 4 |
| 1763 | Find Greatest Common Divisor of 2133132421. | 4 |
| 1764 | Find Greatest Common Divisor of 19242530496. | 4 |
| 1765 | Find Greatest Common Divisor of 12 and 44, using repeated division. | 4 |
| 1766 | Find Greatest Common Divisor of 201 and 12, using prime factorization. | 4 |
| 1767 | Find Greatest Common Divisor of 128 and 16, using prime factorization. | 4 |
| 1768 | Find Greatest Common Divisor of 8, 9 and 15, using prime factorization. | 4 |
| 1769 | Find Greatest Common Divisor of 177 and 6, using prime factorization. | 4 |
| 1770 | Find Greatest Common Divisor of 22 and 36, using prime factorization. | 4 |
| 1771 | Find Greatest Common Divisor of 9 and 42, using prime factorization. | 4 |
| 1772 | Find Greatest Common Divisor of 123 and 12, using prime factorization. | 4 |
| 1773 | Find Greatest Common Divisor of 300 and 45, using prime factorization. | 4 |
| 1774 | Find Greatest Common Divisor of 548 and 742, using prime factorization. | 4 |
| 1775 | Find Greatest Common Divisor of 16261 and 85652, using prime factorization. | 4 |
| 1776 | Find Greatest Common Divisor of 81, 54 and 108, using prime factorization. | 4 |
| 1777 | Find Greatest Common Divisor of 1002 and 558, using Euclidean algorithm. | 4 |
| 1778 | Find Greatest Common Divisor of 2040 and 1368, using Euclidean algorithm. | 4 |
| 1779 | Find Greatest Common Divisor of 377 and 238, using prime factorization. | 4 |
| 1780 | Find Greatest Common Divisor of 12 and 270, using Euclidean algorithm. | 4 |
| 1781 | Find Greatest Common Divisor of 24. | 4 |
| 1782 | Find Greatest Common Divisor of 24 and 40, using prime factorization. | 4 |
| 1783 | Find Greatest Common Divisor of 60 and 24, using Euclidean algorithm. | 4 |
| 1784 | Find Greatest Common Divisor of 6699 and 8265, using prime factorization. | 4 |
| 1785 | Find Greatest Common Divisor of 12. | 4 |
| 1786 | Find Greatest Common Divisor of 2600 and 5500, using prime factorization. | 4 |
| 1787 | Find Greatest Common Divisor of 52 and 16, using prime factorization. | 4 |
| 1788 | Find Greatest Common Divisor of 42 and 36, using prime factorization. | 4 |
| 1789 | Find Greatest Common Divisor of 1092 and 2295, using Euclidean algorithm. | 4 |
| 1790 | Find Greatest Common Divisor of 4999 and 1109, using prime factorization. | 4 |
| 1791 | Find Greatest Common Divisor of 4076 and 1024, using Euclidean algorithm. | 4 |
| 1792 | Find Greatest Common Divisor of 220 and 1323, using prime factorization. | 4 |
| 1793 | Find Greatest Common Divisor of 72, 120 and 144, using repeated division. | 4 |
| 1794 | Find Greatest Common Divisor of 40 and 25, using Euclidean algorithm. | 4 |
| 1795 | Find Greatest Common Divisor of 45 and 10, using repeated division. | 4 |
| 1796 | Find Greatest Common Divisor of 6773760 and 12902400, using prime factorization. | 4 |
| 1797 | Find Greatest Common Divisor of 24 and 36, using Euclidean algorithm. | 4 |
| 1798 | Find Greatest Common Divisor of 513, 1134 and 1215, using Euclidean algorithm. | 4 |
| 1799 | Find Greatest Common Divisor of 72, 108 and 2100, using Euclidean algorithm. | 4 |
| 1800 | Find Greatest Common Divisor of 27 and 108, using prime factorization. | 4 |
