GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1351	Find Greatest Common Divisor of 144 and 105, using prime factorization.	2
1352	Find Greatest Common Divisor of 3 and 105, using prime factorization.	2
1353	Find Greatest Common Divisor of 484 and 561, using Euclidean algorithm.	2
1354	Find Greatest Common Divisor of 16128, 27216 and 25200, using prime factorization.	2
1355	Find Greatest Common Divisor of 9, 5 and 43, using prime factorization.	2
1356	Find Greatest Common Divisor of 143 and 277, using Euclidean algorithm.	2
1357	Find Greatest Common Divisor of 1, 12, 9 and 14, using prime factorization.	2
1358	Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, using prime factorization.	2
1359	Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, by listing out the factors.	2
1360	Find Greatest Common Divisor of 233 and 5880420, using prime factorization.	2
1361	Find Greatest Common Divisor of 5 and 72, using prime factorization.	2
1362	Find Greatest Common Divisor of 16 and 209, using prime factorization.	2
1363	Find Greatest Common Divisor of 451 and 209, using prime factorization.	2
1364	Find Greatest Common Divisor of 1369 and 2597, using prime factorization.	2
1365	Find Greatest Common Divisor of 2689 and 1369, using Euclidean algorithm.	2
1366	Find Greatest Common Divisor of 272 and 1479, by listing out the factors.	2
1367	Find Greatest Common Divisor of 1 and 10, using Euclidean algorithm.	2
1368	Find Greatest Common Divisor of 24 and 30, using Euclidean algorithm.	2
1369	Find Greatest Common Divisor of 7, 12 and 14, using prime factorization.	2
1370	Find Greatest Common Divisor of 7, 12 and 14, using repeated division.	2
1371	Find Greatest Common Divisor of 203 and 833, using Euclidean algorithm.	2
1372	Find Greatest Common Divisor of 36, 87, 90 and 120, using prime factorization.	2
1373	Find Greatest Common Divisor of 900, 216, 36, 120, 144, 108, 49, 60, 150 and 25, using prime factorization.	2
1374	Find Greatest Common Divisor of 10 and 14, using Euclidean algorithm.	2
1375	Find Greatest Common Divisor of 34 and 23, using prime factorization.	2
1376	Find Greatest Common Divisor of 1126 and 884, using prime factorization.	2
1377	Find Greatest Common Divisor of 64 and 80, using prime factorization.	2
1378	Find Greatest Common Divisor of 110 and 88, using prime factorization.	2
1379	Find Greatest Common Divisor of 204 and 255, using prime factorization.	2
1380	Find Greatest Common Divisor of 1 and 6, using prime factorization.	2
1381	Find Greatest Common Divisor of 0, 132 and 763, using prime factorization.	2
1382	Find Greatest Common Divisor of 10 and 18, using repeated division.	2
1383	Find Greatest Common Divisor of 40902 and 24140, using prime factorization.	2
1384	Find Greatest Common Divisor of 35 and 67, using Euclidean algorithm.	2
1385	Find Greatest Common Divisor of 5 and 11, using Euclidean algorithm.	2
1386	Find Greatest Common Divisor of 48, 72, 108, 120, 144, 180, 192, 216, 240 and 300, using prime factorization.	2
1387	Find Greatest Common Divisor of 120 and 84, using Euclidean algorithm.	2
1388	Find Greatest Common Divisor of 74 and 383, using Euclidean algorithm.	2
1389	Find Greatest Common Divisor of 285 and 741, using Euclidean algorithm.	2
1390	Find Greatest Common Divisor of 21, 42 and 84, using repeated division.	2
1391	Find Greatest Common Divisor of 32 and 108, using prime factorization.	2
1392	Find Greatest Common Divisor of 93 and 55, using prime factorization.	2
1393	Find Greatest Common Divisor of 24 and 13, using prime factorization.	2
1394	Find Greatest Common Divisor of 3 and 84, using prime factorization.	2
1395	Find Greatest Common Divisor of 2223 and 912, using Euclidean algorithm.	2
1396	Find Greatest Common Divisor of 49 and 33, using Euclidean algorithm.	2
1397	Find Greatest Common Divisor of 333 and 583, using prime factorization.	2
1398	Find Greatest Common Divisor of 333 and 583, using repeated division.	2
1399	Find Greatest Common Divisor of 37 and 3120, using Euclidean algorithm.	2
1400	Find Greatest Common Divisor of 666 and 558, using prime factorization.	2