GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1801	Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm.	6
1802	Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm.	6
1803	Find Greatest Common Divisor of 35 and 192, using prime factorization.	6
1804	Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using prime factorization.	6
1805	Find Greatest Common Divisor of 272 and 1479, using Euclidean algorithm.	6
1806	Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm.	6
1807	Find Greatest Common Divisor of 1 and 6, using prime factorization.	6
1808	Find Greatest Common Divisor of 973 and 301, using prime factorization.	6
1809	Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization.	6
1810	Find Greatest Common Divisor of 96, 112 and 144, by listing out the factors.	5
1811	Find Greatest Common Divisor of 20 and 3, using prime factorization.	5
1812	Find Greatest Common Divisor of 45 and 33, using prime factorization.	5
1813	Find Greatest Common Divisor of 77 and 128, using prime factorization.	5
1814	Find Greatest Common Divisor of 7 and 20, using Euclidean algorithm.	5
1815	Find Greatest Common Divisor of 36 and 54, using Euclidean algorithm.	5
1816	Find Greatest Common Divisor of 12 and 1234, using Euclidean algorithm.	5
1817	Find Greatest Common Divisor of 315 and 825, using prime factorization.	5
1818	Find Greatest Common Divisor of 49 and 640, using Euclidean algorithm.	5
1819	Find Greatest Common Divisor of 12345 and 54321, using Euclidean algorithm.	5
1820	Find Greatest Common Divisor of 65 and 130, using prime factorization.	5
1821	Find Greatest Common Divisor of 3 and 8, using repeated division.	5
1822	Find Greatest Common Divisor of 49, 210 and 350, using Euclidean algorithm.	5
1823	Find Greatest Common Divisor of 93 and 42, using Euclidean algorithm.	5
1824	Find Greatest Common Divisor of 17 and 3120, using Euclidean algorithm.	5
1825	Find Greatest Common Divisor of 509 and 1177, using Euclidean algorithm.	5
1826	Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm.	5
1827	Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using prime factorization.	5
1828	Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using prime factorization.	5
1829	Find Greatest Common Divisor of 102, 170 and 255, using prime factorization.	5
1830	Find Greatest Common Divisor of 5 and 4, using prime factorization.	5
1831	Find Greatest Common Divisor of 2689 and 4001, using prime factorization.	5
1832	Find Greatest Common Divisor of 1369 and 2597, using Euclidean algorithm.	5
1833	Find Greatest Common Divisor of 3 and 7, using Euclidean algorithm.	5
1834	Find Greatest Common Divisor of 0 and 6, using prime factorization.	5
1835	Find Greatest Common Divisor of 74 and 383, using Euclidean algorithm.	5
1836	Find Greatest Common Divisor of 1, 24, 1 and 6, by listing out the factors.	5
1837	Find Greatest Common Divisor of 18 and 201, using prime factorization.	5
1838	Find Greatest Common Divisor of 18 and 201, by listing out the factors.	5
1839	Find Greatest Common Divisor of 84 and 56, using prime factorization.	5
1840	Find Greatest Common Divisor of 54, 72 and 96, using repeated division.	5
1841	Find Greatest Common Divisor of 21 and 28, using prime factorization.	5
1842	Find Greatest Common Divisor of 1876 and 342, using prime factorization.	5
1843	Find Greatest Common Divisor of 15270 and 10270, using Euclidean algorithm.	5
1844	Find Greatest Common Divisor of 15310 and 10310, using Euclidean algorithm.	5
1845	Find Greatest Common Divisor of 15430 and 10430, using Euclidean algorithm.	5
1846	Find Greatest Common Divisor of 15450 and 10450, using Euclidean algorithm.	5
1847	Find Greatest Common Divisor of 15470 and 10470, using Euclidean algorithm.	5
1848	Find Greatest Common Divisor of 16250 and 11250, using Euclidean algorithm.	5
1849	Find Greatest Common Divisor of 16650 and 11650, using Euclidean algorithm.	5
1850	Find Greatest Common Divisor of 18050 and 13050, using Euclidean algorithm.	5