GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1601	Find Greatest Common Divisor of 78 and 14, using Euclidean algorithm.	2
1602	Find Greatest Common Divisor of 3, 5 and 4, using prime factorization.	2
1603	Find Greatest Common Divisor of 89 and 80, using Euclidean algorithm.	2
1604	Find Greatest Common Divisor of 72 and 63, using Euclidean algorithm.	2
1605	Find Greatest Common Divisor of 25 and 12, using Euclidean algorithm.	2
1606	Find Greatest Common Divisor of 1, 746, 28 and 324, using prime factorization.	2
1607	Find Greatest Common Divisor of 89 and 79, using Euclidean algorithm.	2
1608	Find Greatest Common Divisor of 156 and 54, using Euclidean algorithm.	2
1609	Find Greatest Common Divisor of 67 and 63, using Euclidean algorithm.	2
1610	Find Greatest Common Divisor of 5 and 67, using Euclidean algorithm.	2
1611	Find Greatest Common Divisor of 7 and 67, using Euclidean algorithm.	2
1612	Find Greatest Common Divisor of 76 and 70, using Euclidean algorithm.	2
1613	Find Greatest Common Divisor of 67 and 58, using Euclidean algorithm.	2
1614	Find Greatest Common Divisor of 19 and 36, using Euclidean algorithm.	2
1615	Find Greatest Common Divisor of 4 and 20, using Euclidean algorithm.	2
1616	Find Greatest Common Divisor of 86 and 40, using Euclidean algorithm.	2
1617	Find Greatest Common Divisor of 71 and 41, using Euclidean algorithm.	2
1618	Find Greatest Common Divisor of 12906 and 42905, using Euclidean algorithm.	2
1619	Find Greatest Common Divisor of 125 and 52, using Euclidean algorithm.	2
1620	Find Greatest Common Divisor of 300 and 110, using Euclidean algorithm.	2
1621	Find Greatest Common Divisor of 8 and 2, using Euclidean algorithm.	2
1622	Find Greatest Common Divisor of 1 and 99, using Euclidean algorithm.	2
1623	Find Greatest Common Divisor of 19 and 34, using Euclidean algorithm.	2
1624	Find Greatest Common Divisor of 35 and 82, using Euclidean algorithm.	2
1625	Find Greatest Common Divisor of 32 and 14, using Euclidean algorithm.	2
1626	Find Greatest Common Divisor of 73 and 91, using Euclidean algorithm.	2
1627	Find Greatest Common Divisor of 71 and 48, using Euclidean algorithm.	2
1628	Find Greatest Common Divisor of 30 and 18, using Euclidean algorithm.	2
1629	Find Greatest Common Divisor of 48 and 2, using Euclidean algorithm.	2
1630	Find Greatest Common Divisor of 48 and 22, using Euclidean algorithm.	2
1631	Find Greatest Common Divisor of 87 and 54, using Euclidean algorithm.	2
1632	Find Greatest Common Divisor of 28 and 95, using Euclidean algorithm.	2
1633	Find Greatest Common Divisor of 33 and 84, using Euclidean algorithm.	2
1634	Find Greatest Common Divisor of 95 and 22, using Euclidean algorithm.	2
1635	Find Greatest Common Divisor of 80 and 24, using Euclidean algorithm.	2
1636	Find Greatest Common Divisor of 88 and 84, using Euclidean algorithm.	2
1637	Find Greatest Common Divisor of 76 and 84, using Euclidean algorithm.	2
1638	Find Greatest Common Divisor of 42 and 41, using Euclidean algorithm.	2
1639	Find Greatest Common Divisor of 34 and 57, using Euclidean algorithm.	2
1640	Find Greatest Common Divisor of 93 and 66, using Euclidean algorithm.	2
1641	Find Greatest Common Divisor of 57 and 78, using Euclidean algorithm.	2
1642	Find Greatest Common Divisor of 19 and 3, using Euclidean algorithm.	2
1643	Find Greatest Common Divisor of 13 and 93, using Euclidean algorithm.	2
1644	Find Greatest Common Divisor of 44 and 67, using Euclidean algorithm.	2
1645	Find Greatest Common Divisor of 23 and 88, using Euclidean algorithm.	2
1646	Find Greatest Common Divisor of 47 and 81, using Euclidean algorithm.	2
1647	Find Greatest Common Divisor of 64 and 2, using Euclidean algorithm.	2
1648	Find Greatest Common Divisor of 31 and 31, using Euclidean algorithm.	2
1649	Find Greatest Common Divisor of 96 and 46, using Euclidean algorithm.	2
1650	Find Greatest Common Divisor of 88 and 60, using Euclidean algorithm.	2