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 54321 and 9876, using Euclidean algorithm.	2
1402	Find Greatest Common Divisor of 69 and 372, using Euclidean algorithm.	2
1403	Find Greatest Common Divisor of 162 and 53, using Euclidean algorithm.	2
1404	Find Greatest Common Divisor of 52598 and 2541, using Euclidean algorithm.	2
1405	Find Greatest Common Divisor of 28 and 5, using Euclidean algorithm.	2
1406	Find Greatest Common Divisor of 46 and 23, using Euclidean algorithm.	2
1407	Find Greatest Common Divisor of 276 and 115, using Euclidean algorithm.	2
1408	Find Greatest Common Divisor of 75 and 100, using prime factorization.	2
1409	Find Greatest Common Divisor of 75 and 100, using repeated division.	2
1410	Find Greatest Common Divisor of 91 and 21, using Euclidean algorithm.	2
1411	Find Greatest Common Divisor of 524 and 148, using Euclidean algorithm.	2
1412	Find Greatest Common Divisor of 513 and 2025, using Euclidean algorithm.	2
1413	Find Greatest Common Divisor of 115 and 6644, using repeated division.	2
1414	Find Greatest Common Divisor of 115 and 644, using Euclidean algorithm.	2
1415	Find Greatest Common Divisor of 48 and 54, using prime factorization.	2
1416	Find Greatest Common Divisor of 24, 60 and 96, using prime factorization.	2
1417	Find Greatest Common Divisor of 216 and 234, using prime factorization.	2
1418	Find Greatest Common Divisor of 184 and 460, using prime factorization.	2
1419	Find Greatest Common Divisor of 64 and 70, using prime factorization.	2
1420	Find Greatest Common Divisor of 36243 and 4866, using Euclidean algorithm.	2
1421	Find Greatest Common Divisor of 48 and 63, using prime factorization.	2
1422	Find Greatest Common Divisor of 20 and 101, using prime factorization.	2
1423	Find Greatest Common Divisor of 41445 and 4806, using Euclidean algorithm.	2
1424	Find Greatest Common Divisor of 28458 and 5280, using Euclidean algorithm.	2
1425	Find Greatest Common Divisor of 24552 and 4884, using Euclidean algorithm.	2
1426	Find Greatest Common Divisor of 150.	2
1427	Find Greatest Common Divisor of 1, 0 and 5, using prime factorization.	2
1428	Find Greatest Common Divisor of 84 and 126, using Euclidean algorithm.	2
1429	Find Greatest Common Divisor of 9876 and 54321, using prime factorization.	2
1430	Find Greatest Common Divisor of 6 and 18, using Euclidean algorithm.	2
1431	Find Greatest Common Divisor of 341 and 385, using prime factorization.	2
1432	Find Greatest Common Divisor of 220 and 33, using Euclidean algorithm.	2
1433	Find Greatest Common Divisor of 22, 54 and 198, using prime factorization.	2
1434	Find Greatest Common Divisor of 18 and 38, using prime factorization.	2
1435	Find Greatest Common Divisor of 100 and 150, using prime factorization.	2
1436	Find Greatest Common Divisor of 6 and 5, using repeated division.	2
1437	Find Greatest Common Divisor of 2 and 48, using repeated division.	2
1438	Find Greatest Common Divisor of 32 and 936, using prime factorization.	2
1439	Find Greatest Common Divisor of 36 and 14, using prime factorization.	2
1440	Find Greatest Common Divisor of 25 and 441, using repeated division.	2
1441	Find Greatest Common Divisor of 1, 2 and 24, using prime factorization.	2
1442	Find Greatest Common Divisor of 12 and 18, using repeated division.	2
1443	Find Greatest Common Divisor of 229 and 66, using prime factorization.	2
1444	Find Greatest Common Divisor of 36 and 539, using prime factorization.	2
1445	Find Greatest Common Divisor of 259 and 621, using prime factorization.	2
1446	Find Greatest Common Divisor of 259 and 621, using Euclidean algorithm.	2
1447	Find Greatest Common Divisor of 108 and 156, using Euclidean algorithm.	2
1448	Find Greatest Common Divisor of 20 and 35, using prime factorization.	2
1449	Find Greatest Common Divisor of 107 and 211, using Euclidean algorithm.	2
1450	Find Greatest Common Divisor of 397 and 450, using prime factorization.	2