GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1201	Find Greatest Common Divisor of 65537 and 296208, using prime factorization.	2
1202	Find Greatest Common Divisor of 1333 and 455, using prime factorization.	2
1203	Find Greatest Common Divisor of 9999 and 213, using prime factorization.	2
1204	Find Greatest Common Divisor of 11327 and 333, using prime factorization.	2
1205	Find Greatest Common Divisor of 200, 10, 120 and 11, using repeated division.	2
1206	Find Greatest Common Divisor of 221 and 45, using Euclidean algorithm.	2
1207	Find Greatest Common Divisor of 341 and 2, using Euclidean algorithm.	2
1208	Find Greatest Common Divisor of 197 and 7, using Euclidean algorithm.	2
1209	Find Greatest Common Divisor of 312 and 518, using Euclidean algorithm.	2
1210	Find Greatest Common Divisor of 312 and 528, using Euclidean algorithm.	2
1211	Find Greatest Common Divisor of 360 and 84, using Euclidean algorithm.	2
1212	Find Greatest Common Divisor of 982 and 224, using prime factorization.	2
1213	Find Greatest Common Divisor of 34 and 56, using Euclidean algorithm.	2
1214	Find Greatest Common Divisor of 56 and 60, using Euclidean algorithm.	2
1215	Find Greatest Common Divisor of 56 and 60, using prime factorization.	2
1216	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, by listing out the factors.	2
1217	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using Euclidean algorithm.	2
1218	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using prime factorization.	2
1219	Find Greatest Common Divisor of 48 and 57, using prime factorization.	2
1220	Find Greatest Common Divisor of 48 and 57, using repeated division.	2
1221	Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using Euclidean algorithm.	2
1222	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using prime factorization.	2
1223	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, by listing out the factors.	2
1224	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using repeated division.	2
1225	Find Greatest Common Divisor of 9 and 30, using Euclidean algorithm.	2
1226	Find Greatest Common Divisor of 509, 1 and 177, using Euclidean algorithm.	2
1227	Find Greatest Common Divisor of 5 and 192, using repeated division.	2
1228	Find Greatest Common Divisor of 78 and 66, using repeated division.	2
1229	Find Greatest Common Divisor of 78 and 66, by listing out the factors.	2
1230	Find Greatest Common Divisor of 78 and 66, using Euclidean algorithm.	2
1231	Find Greatest Common Divisor of 17 and 264, using Euclidean algorithm.	2
1232	Find Greatest Common Divisor of 504 and 980, using prime factorization.	2
1233	Find Greatest Common Divisor of 1, 2, 3 and 4, using prime factorization.	2
1234	Find Greatest Common Divisor of 437 and 219, by listing out the factors.	2
1235	Find Greatest Common Divisor of 3375 and 1000, using repeated division.	2
1236	Find Greatest Common Divisor of 2625 and 1000, using repeated division.	2
1237	Find Greatest Common Divisor of 7 and 40, using prime factorization.	2
1238	Find Greatest Common Divisor of 36, 64 and 72, using repeated division.	2
1239	Find Greatest Common Divisor of 36, 64 and 72, using prime factorization.	2
1240	Find Greatest Common Divisor of 78 and 99, using prime factorization.	2
1241	Find Greatest Common Divisor of 341 and 271, using repeated division.	2
1242	Find Greatest Common Divisor of 3 and 36, using prime factorization.	2
1243	Find Greatest Common Divisor of 88 and 187, using repeated division.	2
1244	Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using prime factorization.	2
1245	Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using repeated division.	2
1246	Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, by listing out the factors.	2
1247	Find Greatest Common Divisor of 197 and 144, using Euclidean algorithm.	2
1248	Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using repeated division.	2
1249	Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using Euclidean algorithm.	2
1250	Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using Euclidean algorithm.	2