GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1551	Find Greatest Common Divisor of 0, 30, 0, 45, 0 and 60, using prime factorization.	7
1552	Find Greatest Common Divisor of 10 and 45, using prime factorization.	7
1553	Find Greatest Common Divisor of 158 and 57, using Euclidean algorithm.	7
1554	Find Greatest Common Divisor of 108 and 144, using prime factorization.	7
1555	Find Greatest Common Divisor of 1 and 0, using prime factorization.	7
1556	Find Greatest Common Divisor of 21 and 72, using prime factorization.	7
1557	Find Greatest Common Divisor of 123 and 277, using Euclidean algorithm.	7
1558	Find Greatest Common Divisor of 1529 and 14039, using Euclidean algorithm.	7
1559	Find Greatest Common Divisor of 1 and 23, using Euclidean algorithm.	7
1560	Find Greatest Common Divisor of 43650 and 4980, using Euclidean algorithm.	7
1561	Find Greatest Common Divisor of 12378 and 3054, using prime factorization.	6
1562	Find Greatest Common Divisor of 120 and 144, using prime factorization.	6
1563	Find Greatest Common Divisor of 12378 and 3054, using Euclidean algorithm.	6
1564	Find Greatest Common Divisor of 17 and 33, using Euclidean algorithm.	6
1565	Find Greatest Common Divisor of 150, 360 and 900, using prime factorization.	6
1566	Find Greatest Common Divisor of 459 and 122, using prime factorization.	6
1567	Find Greatest Common Divisor of 6, 9 and 12, by listing out the factors.	6
1568	Find Greatest Common Divisor of 48 and 100, using prime factorization.	6
1569	Find Greatest Common Divisor of 58 and 72, using prime factorization.	6
1570	Find Greatest Common Divisor of 15, 18 and 56, using prime factorization.	6
1571	Find Greatest Common Divisor of 56 and 70, using prime factorization.	6
1572	Find Greatest Common Divisor of 21 and 10, using prime factorization.	6
1573	Find Greatest Common Divisor of 15210 and 10210, using Euclidean algorithm.	6
1574	Find Greatest Common Divisor of 15290 and 10290, using Euclidean algorithm.	6
1575	Find Greatest Common Divisor of 1297 and 26, by listing out the factors.	6
1576	Find Greatest Common Divisor of 108 and 10, using Euclidean algorithm.	6
1577	Find Greatest Common Divisor of 986 and 289, using Euclidean algorithm.	6
1578	Find Greatest Common Divisor of 11 and 72, using Euclidean algorithm.	6
1579	Find Greatest Common Divisor of 30 and 13, using prime factorization.	6
1580	Find Greatest Common Divisor of 8, 9 and 45, using prime factorization.	6
1581	Find Greatest Common Divisor of 29640 and 179, by listing out the factors.	6
1582	Find Greatest Common Divisor of 1607.	6
1583	Find Greatest Common Divisor of 595 and 1463, using prime factorization.	6
1584	Find Greatest Common Divisor of 9357 and 5864, using Euclidean algorithm.	6
1585	Find Greatest Common Divisor of 91, 21, 1 and 2, using prime factorization.	6
1586	Find Greatest Common Divisor of 91, 21, 1 and 1, using prime factorization.	6
1587	Find Greatest Common Divisor of 2025 and 1089, using Euclidean algorithm.	6
1588	Find Greatest Common Divisor of 36, 63 and 108, using repeated division.	6
1589	Find Greatest Common Divisor of 9973 and 6393, using Euclidean algorithm.	6
1590	Find Greatest Common Divisor of 79 and 61, using prime factorization.	6
1591	Find Greatest Common Divisor of 2 and 87, using Euclidean algorithm.	6
1592	Find Greatest Common Divisor of 3, 4 and 2, using prime factorization.	6
1593	Find Greatest Common Divisor of 6 and 24, by listing out the factors.	6
1594	Find Greatest Common Divisor of 4288 and 464, using Euclidean algorithm.	6
1595	Find Greatest Common Divisor of 110, 180 and 540, using prime factorization.	6
1596	Find Greatest Common Divisor of 117 and 15, using prime factorization.	6
1597	Find Greatest Common Divisor of 95 and 15, using prime factorization.	6
1598	Find Greatest Common Divisor of 252 and 350, using prime factorization.	6
1599	Find Greatest Common Divisor of 342 and 8, using prime factorization.	6
1600	Find Greatest Common Divisor of 18 and 42, using repeated division.	6