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 12345 and 54321, using Euclidean algorithm.	5
1752	Find Greatest Common Divisor of 65 and 130, using prime factorization.	5
1753	Find Greatest Common Divisor of 3 and 8, using repeated division.	5
1754	Find Greatest Common Divisor of 49, 210 and 350, using Euclidean algorithm.	5
1755	Find Greatest Common Divisor of 93 and 42, using Euclidean algorithm.	5
1756	Find Greatest Common Divisor of 17 and 3120, using Euclidean algorithm.	5
1757	Find Greatest Common Divisor of 509 and 1177, using Euclidean algorithm.	5
1758	Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm.	5
1759	Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using prime factorization.	5
1760	Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using prime factorization.	5
1761	Find Greatest Common Divisor of 102, 170 and 255, using prime factorization.	5
1762	Find Greatest Common Divisor of 5 and 4, using prime factorization.	5
1763	Find Greatest Common Divisor of 2689 and 4001, using prime factorization.	5
1764	Find Greatest Common Divisor of 1369 and 2597, using Euclidean algorithm.	5
1765	Find Greatest Common Divisor of 3 and 7, using Euclidean algorithm.	5
1766	Find Greatest Common Divisor of 0 and 6, using prime factorization.	5
1767	Find Greatest Common Divisor of 74 and 383, using Euclidean algorithm.	5
1768	Find Greatest Common Divisor of 1, 24, 1 and 6, by listing out the factors.	5
1769	Find Greatest Common Divisor of 18 and 201, using prime factorization.	5
1770	Find Greatest Common Divisor of 18 and 201, by listing out the factors.	5
1771	Find Greatest Common Divisor of 20789 and 1189, using Euclidean algorithm.	5
1772	Find Greatest Common Divisor of 252 and 105, using Euclidean algorithm.	5
1773	Find Greatest Common Divisor of 784 and 336, using Euclidean algorithm.	5
1774	Find Greatest Common Divisor of 2.	5
1775	Find Greatest Common Divisor of 2947 and 3997, using Euclidean algorithm.	5
1776	Find Greatest Common Divisor of 252 and 198, using Euclidean algorithm.	5
1777	Find Greatest Common Divisor of 84 and 28, using prime factorization.	5
1778	Find Greatest Common Divisor of 36, 54, 90 and 126, using repeated division.	5
1779	Find Greatest Common Divisor of 2772 and 1912, using prime factorization.	5
1780	Find Greatest Common Divisor of 34709 and 100313, using Euclidean algorithm.	5
1781	Find Greatest Common Divisor of 128 and 423, using prime factorization.	5
1782	Find Greatest Common Divisor of 616 and 426, using Euclidean algorithm.	5
1783	Find Greatest Common Divisor of 1220 and 288, using Euclidean algorithm.	5
1784	Find Greatest Common Divisor of 245 and 112, using Euclidean algorithm.	5
1785	Find Greatest Common Divisor of 1771 and 179, using prime factorization.	5
1786	Find Greatest Common Divisor of 10 and 0, using Euclidean algorithm.	5
1787	Find Greatest Common Divisor of 2025 and 20025, using prime factorization.	5
1788	Find Greatest Common Divisor of 121.	5
1789	Find Greatest Common Divisor of 30 and 10, using prime factorization.	5
1790	Find Greatest Common Divisor of 76 and 114, using prime factorization.	5
1791	Find Greatest Common Divisor of 1, 2, 3, 4, 5 and 6, using prime factorization.	5
1792	Find Greatest Common Divisor of 7 and 30, using Euclidean algorithm.	5
1793	Find Greatest Common Divisor of 16261 and 85652, using prime factorization.	4
1794	Find Greatest Common Divisor of 81, 54 and 108, using prime factorization.	4
1795	Find Greatest Common Divisor of 1002 and 558, using Euclidean algorithm.	4
1796	Find Greatest Common Divisor of 2040 and 1368, using Euclidean algorithm.	4
1797	Find Greatest Common Divisor of 377 and 238, using prime factorization.	4
1798	Find Greatest Common Divisor of 12 and 270, using Euclidean algorithm.	4
1799	Find Greatest Common Divisor of 24.	4
1800	Find Greatest Common Divisor of 60 and 24, using Euclidean algorithm.	4