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 2 and 47, using prime factorization.	2
1352	Find Greatest Common Divisor of 1 and 9, using prime factorization.	2
1353	Find Greatest Common Divisor of 1 and 32, using prime factorization.	2
1354	Find Greatest Common Divisor of 1 and 56, using prime factorization.	2
1355	Find Greatest Common Divisor of 3 and 53, using Euclidean algorithm.	2
1356	Find Greatest Common Divisor of 3 and 53, using repeated division.	2
1357	Find Greatest Common Divisor of 3 and 53, by listing out the factors.	2
1358	Find Greatest Common Divisor of 18, 24, 3 and 53, by listing out the factors.	2
1359	Find Greatest Common Divisor of 18, 24, 3 and 53, using repeated division.	2
1360	Find Greatest Common Divisor of 18, 24, 3 and 53, using prime factorization.	2
1361	Find Greatest Common Divisor of 18, 24 and 247, using prime factorization.	2
1362	Find Greatest Common Divisor of 18, 24 and 241, using prime factorization.	2
1363	Find Greatest Common Divisor of 18, 24, 10 and 43, using prime factorization.	2
1364	Find Greatest Common Divisor of 10 and 43, using prime factorization.	2
1365	Find Greatest Common Divisor of 77 and 43, using prime factorization.	2
1366	Find Greatest Common Divisor of 77 and 43, using repeated division.	2
1367	Find Greatest Common Divisor of 225 and 135, using prime factorization.	2
1368	Find Greatest Common Divisor of 2, 48, 2, 88, 3 and 6, using prime factorization.	2
1369	Find Greatest Common Divisor of 16534528044 and 8332745927, using prime factorization.	2
1370	Find Greatest Common Divisor of 21 and 17, using prime factorization.	2
1371	Find Greatest Common Divisor of 37 and 11, using Euclidean algorithm.	2
1372	Find Greatest Common Divisor of 6 and 36, using repeated division.	2
1373	Find Greatest Common Divisor of 6 and 36, using Euclidean algorithm.	2
1374	Find Greatest Common Divisor of 6 and 36, by listing out the factors.	2
1375	Find Greatest Common Divisor of 40 and 210, using prime factorization.	2
1376	Find Greatest Common Divisor of 191970722221012020 and 1111707, using prime factorization.	2
1377	Find Greatest Common Divisor of 191970722221012020 and 1111707, using Euclidean algorithm.	2
1378	Find Greatest Common Divisor of 30, 45 and 60, using prime factorization.	2
1379	Find Greatest Common Divisor of 32 and 14, using repeated division.	2
1380	Find Greatest Common Divisor of 80 and 90, using prime factorization.	2
1381	Find Greatest Common Divisor of 30 and 42, using Euclidean algorithm.	2
1382	Find Greatest Common Divisor of 49 and 168, using prime factorization.	2
1383	Find Greatest Common Divisor of 585 and 234, using Euclidean algorithm.	2
1384	Find Greatest Common Divisor of 75 and 60, using prime factorization.	2
1385	Find Greatest Common Divisor of 0, 0, 68, 0, 328, 0, 68 and 328, using Euclidean algorithm.	2
1386	Find Greatest Common Divisor of 73880, 55305 and 50840, using prime factorization.	2
1387	Find Greatest Common Divisor of 2672, 1 and 67, using prime factorization.	2
1388	Find Greatest Common Divisor of 1 and 18, using prime factorization.	2
1389	Find Greatest Common Divisor of 471 and 9231, using Euclidean algorithm.	2
1390	Find Greatest Common Divisor of 26, 46 and 48, using prime factorization.	2
1391	Find Greatest Common Divisor of 1500 and 200, using prime factorization.	2
1392	Find Greatest Common Divisor of 34.	2
1393	Find Greatest Common Divisor of 321 and 100, using prime factorization.	2
1394	Find Greatest Common Divisor of 1567 and 11, using prime factorization.	2
1395	Find Greatest Common Divisor of 64, 224 and 96, using prime factorization.	2
1396	Find Greatest Common Divisor of 64, 224, 96 and 608, using prime factorization.	2
1397	Find Greatest Common Divisor of 64, 224, 96 and 304, using prime factorization.	2
1398	Find Greatest Common Divisor of 1547 and 1440, using prime factorization.	2
1399	Find Greatest Common Divisor of 210, 60 and 45, using prime factorization.	2
1400	Find Greatest Common Divisor of 10672 and 4147, using Euclidean algorithm.	2