GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1401	Find Greatest Common Divisor of 37 and 11, using Euclidean algorithm.	2
1402	Find Greatest Common Divisor of 6 and 36, using repeated division.	2
1403	Find Greatest Common Divisor of 6 and 36, using Euclidean algorithm.	2
1404	Find Greatest Common Divisor of 6 and 36, by listing out the factors.	2
1405	Find Greatest Common Divisor of 40 and 210, using prime factorization.	2
1406	Find Greatest Common Divisor of 191970722221012020 and 1111707, using prime factorization.	2
1407	Find Greatest Common Divisor of 191970722221012020 and 1111707, using Euclidean algorithm.	2
1408	Find Greatest Common Divisor of 30, 45 and 60, using prime factorization.	2
1409	Find Greatest Common Divisor of 32 and 14, using repeated division.	2
1410	Find Greatest Common Divisor of 80 and 90, using prime factorization.	2
1411	Find Greatest Common Divisor of 30 and 42, using Euclidean algorithm.	2
1412	Find Greatest Common Divisor of 49 and 168, using prime factorization.	2
1413	Find Greatest Common Divisor of 585 and 234, using Euclidean algorithm.	2
1414	Find Greatest Common Divisor of 75 and 60, using prime factorization.	2
1415	Find Greatest Common Divisor of 0, 0, 68, 0, 328, 0, 68 and 328, using Euclidean algorithm.	2
1416	Find Greatest Common Divisor of 73880, 55305 and 50840, using prime factorization.	2
1417	Find Greatest Common Divisor of 2672, 1 and 67, using prime factorization.	2
1418	Find Greatest Common Divisor of 1 and 18, using prime factorization.	2
1419	Find Greatest Common Divisor of 471 and 9231, using Euclidean algorithm.	2
1420	Find Greatest Common Divisor of 26, 46 and 48, using prime factorization.	2
1421	Find Greatest Common Divisor of 1500 and 200, using prime factorization.	2
1422	Find Greatest Common Divisor of 34.	2
1423	Find Greatest Common Divisor of 321 and 100, using prime factorization.	2
1424	Find Greatest Common Divisor of 1567 and 11, using prime factorization.	2
1425	Find Greatest Common Divisor of 64, 224 and 96, using prime factorization.	2
1426	Find Greatest Common Divisor of 64, 224, 96 and 608, using prime factorization.	2
1427	Find Greatest Common Divisor of 64, 224, 96 and 304, using prime factorization.	2
1428	Find Greatest Common Divisor of 1547 and 1440, using prime factorization.	2
1429	Find Greatest Common Divisor of 210, 60 and 45, using prime factorization.	2
1430	Find Greatest Common Divisor of 10672 and 4147, using Euclidean algorithm.	2
1431	Find Greatest Common Divisor of 54321 and 9876, using Euclidean algorithm.	2
1432	Find Greatest Common Divisor of 69 and 372, using Euclidean algorithm.	2
1433	Find Greatest Common Divisor of 162 and 53, using Euclidean algorithm.	2
1434	Find Greatest Common Divisor of 52598 and 2541, using Euclidean algorithm.	2
1435	Find Greatest Common Divisor of 28 and 5, using Euclidean algorithm.	2
1436	Find Greatest Common Divisor of 46 and 23, using Euclidean algorithm.	2
1437	Find Greatest Common Divisor of 276 and 115, using Euclidean algorithm.	2
1438	Find Greatest Common Divisor of 75 and 100, using prime factorization.	2
1439	Find Greatest Common Divisor of 75 and 100, using repeated division.	2
1440	Find Greatest Common Divisor of 91 and 21, using Euclidean algorithm.	2
1441	Find Greatest Common Divisor of 524 and 148, using Euclidean algorithm.	2
1442	Find Greatest Common Divisor of 513 and 2025, using Euclidean algorithm.	2
1443	Find Greatest Common Divisor of 115 and 6644, using repeated division.	2
1444	Find Greatest Common Divisor of 115 and 644, using Euclidean algorithm.	2
1445	Find Greatest Common Divisor of 48 and 54, using prime factorization.	2
1446	Find Greatest Common Divisor of 24, 60 and 96, using prime factorization.	2
1447	Find Greatest Common Divisor of 216 and 234, using prime factorization.	2
1448	Find Greatest Common Divisor of 184 and 460, using prime factorization.	2
1449	Find Greatest Common Divisor of 64 and 70, using prime factorization.	2
1450	Find Greatest Common Divisor of 36243 and 4866, using Euclidean algorithm.	2