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 589432167.	2
1602	Find Greatest Common Divisor of 589432167.	2
1603	Find Greatest Common Divisor of 7, 5 and 6, using prime factorization.	2
1604	Find Greatest Common Divisor of 520 and 660, using prime factorization.	2
1605	Find Greatest Common Divisor of 101 and 3267, using Euclidean algorithm.	2
1606	Find Greatest Common Divisor of 9357 and 5864, using prime factorization.	2
1607	Find Greatest Common Divisor of 52 and 130, using prime factorization.	2
1608	Find Greatest Common Divisor of 1, 9, 2, 4, 4 and 30, using prime factorization.	2
1609	Find Greatest Common Divisor of 1235 and 765, using Euclidean algorithm.	2
1610	Find Greatest Common Divisor of 16 and 63, using prime factorization.	2
1611	Find Greatest Common Divisor of 112 and 128, using prime factorization.	2
1612	Find Greatest Common Divisor of 144 and 300, using prime factorization.	2
1613	Find Greatest Common Divisor of 4409 and 519, using prime factorization.	2
1614	Find Greatest Common Divisor of 459 and 663, using prime factorization.	2
1615	Find Greatest Common Divisor of 12, 8 and 6, using prime factorization.	2
1616	Find Greatest Common Divisor of 1999 and 1090909, using Euclidean algorithm.	2
1617	Find Greatest Common Divisor of 638 and 5002, using prime factorization.	2
1618	Find Greatest Common Divisor of 972 and 783, using Euclidean algorithm.	2
1619	Find Greatest Common Divisor of 48, 180 and 270, using Euclidean algorithm.	2
1620	Find Greatest Common Divisor of 2520 and 6300, using Euclidean algorithm.	2
1621	Find Greatest Common Divisor of 24.	2
1622	Find Greatest Common Divisor of 2516 and 1125, using prime factorization.	2
1623	Find Greatest Common Divisor of 2516 and 1125, using Euclidean algorithm.	2
1624	Find Greatest Common Divisor of 14860 and 4424, using Euclidean algorithm.	2
1625	Find Greatest Common Divisor of 84 and 68, using Euclidean algorithm.	2
1626	Find Greatest Common Divisor of 243 and 368, using prime factorization.	2
1627	Find Greatest Common Divisor of 512 and 384, using repeated division.	2
1628	Find Greatest Common Divisor of 6, 12 and 20, using prime factorization.	2
1629	Find Greatest Common Divisor of 30 and 8, using prime factorization.	2
1630	Find Greatest Common Divisor of 3, 5, 7, 9 and 11, using Euclidean algorithm.	2
1631	Find Greatest Common Divisor of 3, 5, 7, 9 and 11, by listing out the factors.	2
1632	Find Greatest Common Divisor of 728.	2
1633	Find Greatest Common Divisor of 324, 756 and 480, using prime factorization.	2
1634	Find Greatest Common Divisor of 756, 324 and 540, using prime factorization.	2
1635	Find Greatest Common Divisor of 35 and 77, using prime factorization.	2
1636	Find Greatest Common Divisor of 289 and 248, using prime factorization.	2
1637	Find Greatest Common Divisor of 13 and 2196, using prime factorization.	2
1638	Find Greatest Common Divisor of 65 and 50, using prime factorization.	2
1639	Find Greatest Common Divisor of 700 and 14700, using prime factorization.	2
1640	Find Greatest Common Divisor of 96 and 20, using prime factorization.	2
1641	Find Greatest Common Divisor of 26 and 118, using Euclidean algorithm.	2
1642	Find Greatest Common Divisor of 1024 and 486, using Euclidean algorithm.	2
1643	Find Greatest Common Divisor of 486 and 18, using Euclidean algorithm.	2
1644	Find Greatest Common Divisor of 52 and 21, using Euclidean algorithm.	2
1645	Find Greatest Common Divisor of 50, 75 and 120, using prime factorization.	2
1646	Find Greatest Common Divisor of 3 and 27, using prime factorization.	2
1647	Find Greatest Common Divisor of 10 and 10, using prime factorization.	2
1648	Find Greatest Common Divisor of 16 and 72, using prime factorization.	2
1649	Find Greatest Common Divisor of 4 and 39, using Euclidean algorithm.	2
1650	Find Greatest Common Divisor of 49 and 156, using Euclidean algorithm.	2