GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1501	Find Greatest Common Divisor of 25 and 60, using Euclidean algorithm.	8
1502	Find Greatest Common Divisor of 5 and 360, using prime factorization.	8
1503	Find Greatest Common Divisor of 90 and 8, using prime factorization.	8
1504	Find Greatest Common Divisor of 54 and 9, using prime factorization.	8
1505	Find Greatest Common Divisor of 13 and 17, using Euclidean algorithm.	8
1506	Find Greatest Common Divisor of 36 and 6, using prime factorization.	7
1507	Find Greatest Common Divisor of 291 and 24, using prime factorization.	7
1508	Find Greatest Common Divisor of 8 and 240, using prime factorization.	7
1509	Find Greatest Common Divisor of 140 and 2, using prime factorization.	7
1510	Find Greatest Common Divisor of 389 and 245, using prime factorization.	7
1511	Find Greatest Common Divisor of 369 and 368, using Euclidean algorithm.	7
1512	Find Greatest Common Divisor of 466 and 267, using prime factorization.	7
1513	Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, using prime factorization.	7
1514	Find Greatest Common Divisor of 30 and 10, using prime factorization.	7
1515	Find Greatest Common Divisor of 8 and 5, using prime factorization.	7
1516	Find Greatest Common Divisor of 96, 144 and 192, using Euclidean algorithm.	7
1517	Find Greatest Common Divisor of 63 and 24, using prime factorization.	7
1518	Find Greatest Common Divisor of 21250 and 16250, using Euclidean algorithm.	7
1519	Find Greatest Common Divisor of 0 and 1, using prime factorization.	7
1520	Find Greatest Common Divisor of 24140 and 16762, using Euclidean algorithm.	7
1521	Find Greatest Common Divisor of 98 and 273, using prime factorization.	7
1522	Find Greatest Common Divisor of 16261 and 85652, using Euclidean algorithm.	7
1523	Find Greatest Common Divisor of 133 and 28, using Euclidean algorithm.	7
1524	Find Greatest Common Divisor of 1160718174 and 316258250, using repeated division.	7
1525	Find Greatest Common Divisor of 24 and 138, using Euclidean algorithm.	7
1526	Find Greatest Common Divisor of 4 and 5, using prime factorization.	7
1527	Find Greatest Common Divisor of 330 and 156, using Euclidean algorithm.	7
1528	Find Greatest Common Divisor of 160 and 7, using prime factorization.	7
1529	Find Greatest Common Divisor of 291 and 252, using prime factorization.	7
1530	Find Greatest Common Divisor of 104 and 64, using repeated division.	7
1531	Find Greatest Common Divisor of 25.	7
1532	Find Greatest Common Divisor of 166 and 10, using prime factorization.	7
1533	Find Greatest Common Divisor of 116 and 10, using prime factorization.	7
1534	Find Greatest Common Divisor of 31 and 31, using prime factorization.	7
1535	Find Greatest Common Divisor of 48, 36 and 124, using prime factorization.	7
1536	Find Greatest Common Divisor of 62 and 124, using prime factorization.	7
1537	Find Greatest Common Divisor of 626 and 8, using prime factorization.	7
1538	Find Greatest Common Divisor of 80 and 15, using prime factorization.	7
1539	Find Greatest Common Divisor of 70 and 5, using prime factorization.	7
1540	Find Greatest Common Divisor of 51 and 9, using prime factorization.	7
1541	Find Greatest Common Divisor of 475 and 100, using prime factorization.	7
1542	Find Greatest Common Divisor of 836 and 10, using prime factorization.	7
1543	Find Greatest Common Divisor of 6048 and 95040, using prime factorization.	7
1544	Find Greatest Common Divisor of 555 and 24, using prime factorization.	7
1545	Find Greatest Common Divisor of 96 and 1320, using prime factorization.	7
1546	Find Greatest Common Divisor of 100 and 8, using prime factorization.	7
1547	Find Greatest Common Divisor of 34205 and 1000, using prime factorization.	7
1548	Find Greatest Common Divisor of 98 and 10, using prime factorization.	7
1549	Find Greatest Common Divisor of 82 and 8, using prime factorization.	7
1550	Find Greatest Common Divisor of 52 and 12, using prime factorization.	7