GCD

(the database of solved problems)

All the problems and solutions shown below were generated using the GCD Calculator.

Select category

ID	Problem	Count
1751	Find Greatest Common Divisor of 86 and 10, using prime factorization.	6
1752	Find Greatest Common Divisor of 2 and 36, using prime factorization.	6
1753	Find Greatest Common Divisor of 65 and 100, using prime factorization.	6
1754	Find Greatest Common Divisor of 18 and 24, using prime factorization.	6
1755	Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm.	6
1756	Find Greatest Common Divisor of 2486625522 and 41582215163, using prime factorization.	6
1757	Find Greatest Common Divisor of 45 and 36, using Euclidean algorithm.	6
1758	Find Greatest Common Divisor of 7 and 9, using prime factorization.	6
1759	Find Greatest Common Divisor of 123456 and 789, using prime factorization.	6
1760	Find Greatest Common Divisor of 93149832 and 73482, using Euclidean algorithm.	6
1761	Find Greatest Common Divisor of 1424 and 3084, using Euclidean algorithm.	6
1762	Find Greatest Common Divisor of 252 and 198, using prime factorization.	6
1763	Find Greatest Common Divisor of 4788 and 31256, using Euclidean algorithm.	6
1764	Find Greatest Common Divisor of 19 and 160, using prime factorization.	6
1765	Find Greatest Common Divisor of 6 and 400, using prime factorization.	6
1766	Find Greatest Common Divisor of 42 and 14, using prime factorization.	6
1767	Find Greatest Common Divisor of 119 and 272, using Euclidean algorithm.	6
1768	Find Greatest Common Divisor of 32 and 640, using Euclidean algorithm.	6
1769	Find Greatest Common Divisor of 504 and 385, using Euclidean algorithm.	6
1770	Find Greatest Common Divisor of 48 and 60, using Euclidean algorithm.	6
1771	Find Greatest Common Divisor of 11111 and 111111, using Euclidean algorithm.	6
1772	Find Greatest Common Divisor of 3, 5 and 7, using prime factorization.	6
1773	Find Greatest Common Divisor of 504 and 270, using Euclidean algorithm.	6
1774	Find Greatest Common Divisor of 17 and 3120, using prime factorization.	6
1775	Find Greatest Common Divisor of 4131 and 2431, using Euclidean algorithm.	6
1776	Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm.	6
1777	Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm.	6
1778	Find Greatest Common Divisor of 35 and 192, using prime factorization.	6
1779	Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using prime factorization.	6
1780	Find Greatest Common Divisor of 272 and 1479, using Euclidean algorithm.	6
1781	Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm.	6
1782	Find Greatest Common Divisor of 1 and 6, using prime factorization.	6
1783	Find Greatest Common Divisor of 973 and 301, using prime factorization.	6
1784	Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization.	6
1785	Find Greatest Common Divisor of 58 and 72, using prime factorization.	6
1786	Find Greatest Common Divisor of 15, 18 and 56, using prime factorization.	6
1787	Find Greatest Common Divisor of 56 and 70, using prime factorization.	6
1788	Find Greatest Common Divisor of 21 and 10, using prime factorization.	6
1789	Find Greatest Common Divisor of 15210 and 10210, using Euclidean algorithm.	6
1790	Find Greatest Common Divisor of 15290 and 10290, using Euclidean algorithm.	6
1791	Find Greatest Common Divisor of 1297 and 26, by listing out the factors.	6
1792	Find Greatest Common Divisor of 108 and 10, using Euclidean algorithm.	6
1793	Find Greatest Common Divisor of 986 and 289, using Euclidean algorithm.	6
1794	Find Greatest Common Divisor of 11 and 72, using Euclidean algorithm.	6
1795	Find Greatest Common Divisor of 30 and 13, using prime factorization.	6
1796	Find Greatest Common Divisor of 8, 9 and 45, using prime factorization.	6
1797	Find Greatest Common Divisor of 29640 and 179, by listing out the factors.	6
1798	Find Greatest Common Divisor of 1607.	6
1799	Find Greatest Common Divisor of 595 and 1463, using prime factorization.	6
1800	Find Greatest Common Divisor of 9357 and 5864, using Euclidean algorithm.	6