GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1651	Find Greatest Common Divisor of 84 and 68, using Euclidean algorithm.	2
1652	Find Greatest Common Divisor of 243 and 368, using prime factorization.	2
1653	Find Greatest Common Divisor of 512 and 384, using repeated division.	2
1654	Find Greatest Common Divisor of 6, 12 and 20, using prime factorization.	2
1655	Find Greatest Common Divisor of 30 and 8, using prime factorization.	2
1656	Find Greatest Common Divisor of 3, 5, 7, 9 and 11, using Euclidean algorithm.	2
1657	Find Greatest Common Divisor of 3, 5, 7, 9 and 11, by listing out the factors.	2
1658	Find Greatest Common Divisor of 728.	2
1659	Find Greatest Common Divisor of 324, 756 and 480, using prime factorization.	2
1660	Find Greatest Common Divisor of 756, 324 and 540, using prime factorization.	2
1661	Find Greatest Common Divisor of 35 and 77, using prime factorization.	2
1662	Find Greatest Common Divisor of 289 and 248, using prime factorization.	2
1663	Find Greatest Common Divisor of 13 and 2196, using prime factorization.	2
1664	Find Greatest Common Divisor of 65 and 50, using prime factorization.	2
1665	Find Greatest Common Divisor of 700 and 14700, using prime factorization.	2
1666	Find Greatest Common Divisor of 96 and 20, using prime factorization.	2
1667	Find Greatest Common Divisor of 26 and 118, using Euclidean algorithm.	2
1668	Find Greatest Common Divisor of 1024 and 486, using Euclidean algorithm.	2
1669	Find Greatest Common Divisor of 486 and 18, using Euclidean algorithm.	2
1670	Find Greatest Common Divisor of 52 and 21, using Euclidean algorithm.	2
1671	Find Greatest Common Divisor of 50, 75 and 120, using prime factorization.	2
1672	Find Greatest Common Divisor of 3 and 27, using prime factorization.	2
1673	Find Greatest Common Divisor of 10 and 10, using prime factorization.	2
1674	Find Greatest Common Divisor of 16 and 72, using prime factorization.	2
1675	Find Greatest Common Divisor of 4 and 39, using Euclidean algorithm.	2
1676	Find Greatest Common Divisor of 49 and 156, using Euclidean algorithm.	2
1677	Find Greatest Common Divisor of 35 and 81, using Euclidean algorithm.	2
1678	Find Greatest Common Divisor of 24 and 40, using prime factorization.	2
1679	Find Greatest Common Divisor of 10032 and 873, using prime factorization.	2
1680	Find Greatest Common Divisor of 122 and 48, using prime factorization.	2
1681	Find Greatest Common Divisor of 38603578125 and 86821875, using prime factorization.	2
1682	Find Greatest Common Divisor of 37968 and 56, using prime factorization.	2
1683	Find Greatest Common Divisor of 80 and 32, using prime factorization.	2
1684	Find Greatest Common Divisor of 11 and 99, using prime factorization.	2
1685	Find Greatest Common Divisor of 6699 and 8265, using repeated division.	2
1686	Find Greatest Common Divisor of 91 and 65, using prime factorization.	2
1687	Find Greatest Common Divisor of 72 and 96, using prime factorization.	2
1688	Find Greatest Common Divisor of 66, 45 and 9, using prime factorization.	2
1689	Find Greatest Common Divisor of 50, 100 and 75, using prime factorization.	2
1690	Find Greatest Common Divisor of 5720 and 5460, using prime factorization.	2
1691	Find Greatest Common Divisor of 42 and 72, using prime factorization.	2
1692	Find Greatest Common Divisor of 24 and 32, using prime factorization.	2
1693	Find Greatest Common Divisor of 123456 and 789, using repeated division.	2
1694	Find Greatest Common Divisor of 3 and 62, using prime factorization.	2
1695	Find Greatest Common Divisor of 135 and 105, using prime factorization.	2
1696	Find Greatest Common Divisor of 18, 40, 360 and 14, using prime factorization.	2
1697	Find Greatest Common Divisor of 10 and 21, using repeated division.	2
1698	Find Greatest Common Divisor of 2600 and 5500, using Euclidean algorithm.	2
1699	Find Greatest Common Divisor of 81.	2
1700	Find Greatest Common Divisor of 8130.	2