GCD – Solved Problems Database

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

Change category

ID	Problem	Count
1201	Find Greatest Common Divisor of 9357 and 5864, using prime factorization.	2
1202	Find Greatest Common Divisor of 35 and 77, using prime factorization.	2
1203	Find Greatest Common Divisor of 20 and 220, using Euclidean algorithm.	2
1204	Find Greatest Common Divisor of 2 and 1200, using Euclidean algorithm.	2
1205	Find Greatest Common Divisor of 1320 and 1872, using repeated division.	2
1206	Find Greatest Common Divisor of 26513 and 32321, using Euclidean algorithm.	2
1207	Find Greatest Common Divisor of 92 and 27, using Euclidean algorithm.	2
1208	Find Greatest Common Divisor of 197070 and 17739, using prime factorization.	2
1209	Find Greatest Common Divisor of 143, 110 and 11, using prime factorization.	2
1210	Find Greatest Common Divisor of 689 and 489, using prime factorization.	2
1211	Find Greatest Common Divisor of 576, 432 and 1008, using prime factorization.	2
1212	Find Greatest Common Divisor of 391 and 667, using repeated division.	2
1213	Find Greatest Common Divisor of 3 and 1200, using prime factorization.	2
1214	Find Greatest Common Divisor of 83 and 49, using Euclidean algorithm.	2
1215	Find Greatest Common Divisor of 59 and 66, using Euclidean algorithm.	2
1216	Find Greatest Common Divisor of 40 and 20, using prime factorization.	2
1217	Find Greatest Common Divisor of 1243564 and 45267964, by listing out the factors.	2
1218	Find Greatest Common Divisor of 2725 and 1370, using prime factorization.	2
1219	Find Greatest Common Divisor of 220 and 558, using prime factorization.	2
1220	Find Greatest Common Divisor of 1243564 and 45267964, using Euclidean algorithm.	2
1221	Find Greatest Common Divisor of 6120 and 3000, using Euclidean algorithm.	2
1222	Find Greatest Common Divisor of 4088 and 966, using prime factorization.	2
1223	Find Greatest Common Divisor of 249 and 147, using prime factorization.	2
1224	Find Greatest Common Divisor of 112 and 30, using prime factorization.	2
1225	Find Greatest Common Divisor of 7 and 1200, using prime factorization.	2
1226	Find Greatest Common Divisor of 27 and 37, using Euclidean algorithm.	2
1227	Find Greatest Common Divisor of 98 and 96, using Euclidean algorithm.	2
1228	Find Greatest Common Divisor of 40 and 20, using Euclidean algorithm.	2
1229	Find Greatest Common Divisor of 72 and 47, using Euclidean algorithm.	2
1230	Find Greatest Common Divisor of 95 and 90, using Euclidean algorithm.	2
1231	Find Greatest Common Divisor of 16, 24, 36 and 48, by listing out the factors.	2
1232	Find Greatest Common Divisor of 605 and 210, using Euclidean algorithm.	2
1233	Find Greatest Common Divisor of 525, 619 and 1766, using prime factorization.	2
1234	Find Greatest Common Divisor of 40 and 1, by listing out the factors.	2
1235	Find Greatest Common Divisor of 32 and 4, using Euclidean algorithm.	2
1236	Find Greatest Common Divisor of 14 and 2, using Euclidean algorithm.	2
1237	Find Greatest Common Divisor of 56 and 999, using Euclidean algorithm.	2
1238	Find Greatest Common Divisor of 1010 and 407, using Euclidean algorithm.	2
1239	Find Greatest Common Divisor of 71 and 83, using Euclidean algorithm.	2
1240	Find Greatest Common Divisor of 32 and 4, using Euclidean algorithm.	2
1241	Find Greatest Common Divisor of 8 and 2, using Euclidean algorithm.	2
1242	Find Greatest Common Divisor of 280 and 117, using Euclidean algorithm.	2
1243	Find Greatest Common Divisor of 38603578125 and 86821875, using prime factorization.	2
1244	Find Greatest Common Divisor of 63 and 54, using Euclidean algorithm.	2
1245	Find Greatest Common Divisor of 294, 441 and 735, using prime factorization.	2
1246	Find Greatest Common Divisor of 8 and 52, using Euclidean algorithm.	2
1247	Find Greatest Common Divisor of 156 and 54, using Euclidean algorithm.	2
1248	Find Greatest Common Divisor of 117, 91 and 65, using prime factorization.	2
1249	Find Greatest Common Divisor of 60 and 136, using Euclidean algorithm.	2
1250	Find Greatest Common Divisor of 58 and 40, using Euclidean algorithm.	2