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 20 and 3, using prime factorization.	5
1402	Find Greatest Common Divisor of 45 and 33, using prime factorization.	5
1403	Find Greatest Common Divisor of 77 and 128, using prime factorization.	5
1404	Find Greatest Common Divisor of 36 and 54, using Euclidean algorithm.	5
1405	Find Greatest Common Divisor of 12 and 1234, using Euclidean algorithm.	5
1406	Find Greatest Common Divisor of 315 and 825, using prime factorization.	5
1407	Find Greatest Common Divisor of 49 and 640, using Euclidean algorithm.	5
1408	Find Greatest Common Divisor of 12345 and 54321, using Euclidean algorithm.	5
1409	Find Greatest Common Divisor of 65 and 130, using prime factorization.	5
1410	Find Greatest Common Divisor of 10 and 26, using prime factorization.	5
1411	Find Greatest Common Divisor of 3 and 8, using repeated division.	5
1412	Find Greatest Common Divisor of 49, 210 and 350, using Euclidean algorithm.	5
1413	Find Greatest Common Divisor of 93 and 42, using Euclidean algorithm.	5
1414	Find Greatest Common Divisor of 17 and 3120, using Euclidean algorithm.	5
1415	Find Greatest Common Divisor of 509 and 1177, using Euclidean algorithm.	5
1416	Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm.	5
1417	Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using prime factorization.	5
1418	Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using prime factorization.	5
1419	Find Greatest Common Divisor of 102, 170 and 255, using prime factorization.	5
1420	Find Greatest Common Divisor of 5 and 4, using prime factorization.	5
1421	Find Greatest Common Divisor of 2689 and 4001, using prime factorization.	5
1422	Find Greatest Common Divisor of 1369 and 2597, using Euclidean algorithm.	5
1423	Find Greatest Common Divisor of 0 and 6, using prime factorization.	5
1424	Find Greatest Common Divisor of 74 and 383, using Euclidean algorithm.	5
1425	Find Greatest Common Divisor of 1, 24, 1 and 6, by listing out the factors.	5
1426	Find Greatest Common Divisor of 18 and 201, using prime factorization.	5
1427	Find Greatest Common Divisor of 18 and 201, by listing out the factors.	5
1428	Find Greatest Common Divisor of 252 and 105, using Euclidean algorithm.	5
1429	Find Greatest Common Divisor of 784 and 336, using Euclidean algorithm.	5
1430	Find Greatest Common Divisor of 2.	5
1431	Find Greatest Common Divisor of 2947 and 3997, using Euclidean algorithm.	5
1432	Find Greatest Common Divisor of 84 and 28, using prime factorization.	5
1433	Find Greatest Common Divisor of 36, 54, 90 and 126, using repeated division.	5
1434	Find Greatest Common Divisor of 2772 and 1912, using prime factorization.	5
1435	Find Greatest Common Divisor of 34709 and 100313, using Euclidean algorithm.	5
1436	Find Greatest Common Divisor of 128 and 423, using prime factorization.	5
1437	Find Greatest Common Divisor of 616 and 426, using Euclidean algorithm.	5
1438	Find Greatest Common Divisor of 1220 and 288, using Euclidean algorithm.	5
1439	Find Greatest Common Divisor of 245 and 112, using Euclidean algorithm.	5
1440	Find Greatest Common Divisor of 1771 and 179, using prime factorization.	5
1441	Find Greatest Common Divisor of 10 and 0, using Euclidean algorithm.	5
1442	Find Greatest Common Divisor of 2025 and 20025, using prime factorization.	5
1443	Find Greatest Common Divisor of 121.	5
1444	Find Greatest Common Divisor of 24 and 18, using prime factorization.	5
1445	Find Greatest Common Divisor of 76 and 114, using prime factorization.	5
1446	Find Greatest Common Divisor of 1, 2, 3, 4, 5 and 6, using prime factorization.	5
1447	Find Greatest Common Divisor of 7 and 30, using Euclidean algorithm.	5
1448	Find Greatest Common Divisor of 101 and 126, using Euclidean algorithm.	5
1449	Find Greatest Common Divisor of 35 and 25, using Euclidean algorithm.	5
1450	Find Greatest Common Divisor of 111 and 11, using Euclidean algorithm.	5