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 16534528044 and 8332745927, using Euclidean algorithm.	8
1202	Find Greatest Common Divisor of 2.	8
1203	Find Greatest Common Divisor of 24140 and 16762, using Euclidean algorithm.	7
1204	Find Greatest Common Divisor of 98 and 273, using prime factorization.	7
1205	Find Greatest Common Divisor of 16261 and 85652, using Euclidean algorithm.	7
1206	Find Greatest Common Divisor of 48 and 18, using prime factorization.	7
1207	Find Greatest Common Divisor of 133 and 28, using Euclidean algorithm.	7
1208	Find Greatest Common Divisor of 1160718174 and 316258250, using repeated division.	7
1209	Find Greatest Common Divisor of 24 and 138, using Euclidean algorithm.	7
1210	Find Greatest Common Divisor of 330 and 156, using Euclidean algorithm.	7
1211	Find Greatest Common Divisor of 3 and 48, using prime factorization.	7
1212	Find Greatest Common Divisor of 291 and 252, using prime factorization.	7
1213	Find Greatest Common Divisor of 104 and 64, using repeated division.	7
1214	Find Greatest Common Divisor of 25.	7
1215	Find Greatest Common Divisor of 96, 144 and 192, using Euclidean algorithm.	7
1216	Find Greatest Common Divisor of 63 and 24, using prime factorization.	7
1217	Find Greatest Common Divisor of 21250 and 16250, using Euclidean algorithm.	7
1218	Find Greatest Common Divisor of 10 and 85, using prime factorization.	7
1219	Find Greatest Common Divisor of 0 and 1, using prime factorization.	7
1220	Find Greatest Common Divisor of 0, 30, 0, 45, 0 and 60, using prime factorization.	7
1221	Find Greatest Common Divisor of 158 and 57, using Euclidean algorithm.	7
1222	Find Greatest Common Divisor of 1 and 0, using prime factorization.	7
1223	Find Greatest Common Divisor of 1529 and 14039, using Euclidean algorithm.	7
1224	Find Greatest Common Divisor of 1 and 23, using Euclidean algorithm.	7
1225	Find Greatest Common Divisor of 43650 and 4980, using Euclidean algorithm.	7
1226	Find Greatest Common Divisor of 40 and 60, using prime factorization.	7
1227	Find Greatest Common Divisor of 438 and 16, using prime factorization.	7
1228	Find Greatest Common Divisor of 28 and 16, using prime factorization.	7
1229	Find Greatest Common Divisor of 142 and 8, using prime factorization.	7
1230	Find Greatest Common Divisor of 1208 and 16, using prime factorization.	7
1231	Find Greatest Common Divisor of 128 and 8, using prime factorization.	7
1232	Find Greatest Common Divisor of 117 and 12, using prime factorization.	7
1233	Find Greatest Common Divisor of 105 and 175, using prime factorization.	7
1234	Find Greatest Common Divisor of 44 and 11, using prime factorization.	7
1235	Find Greatest Common Divisor of 532 and 100, using prime factorization.	7
1236	Find Greatest Common Divisor of 38 and 42, using prime factorization.	7
1237	Find Greatest Common Divisor of 56 and 35, using prime factorization.	7
1238	Find Greatest Common Divisor of 16 and 22, using prime factorization.	7
1239	Find Greatest Common Divisor of 48 and 15, using prime factorization.	7
1240	Find Greatest Common Divisor of 8500 and 10, using prime factorization.	7
1241	Find Greatest Common Divisor of 16 and 132, using prime factorization.	7
1242	Find Greatest Common Divisor of 57 and 60, using prime factorization.	7
1243	Find Greatest Common Divisor of 121 and 11, using prime factorization.	7
1244	Find Greatest Common Divisor of 228 and 24, using prime factorization.	7
1245	Find Greatest Common Divisor of 123 and 30, using prime factorization.	7
1246	Find Greatest Common Divisor of 48, 36 and 124, using prime factorization.	7
1247	Find Greatest Common Divisor of 96 and 14, using prime factorization.	7
1248	Find Greatest Common Divisor of 466 and 267, using prime factorization.	7
1249	Find Greatest Common Divisor of 3 and 5, using prime factorization.	7
1250	Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, using prime factorization.	7