GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1251	Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using Euclidean algorithm.	2
1252	Find Greatest Common Divisor of 9801 and 1452891650, using Euclidean algorithm.	2
1253	Find Greatest Common Divisor of 35 and 192, by listing out the factors.	2
1254	Find Greatest Common Divisor of 605 and 210, using Euclidean algorithm.	2
1255	Find Greatest Common Divisor of 5 and 2772, using prime factorization.	2
1256	Find Greatest Common Divisor of 7 and 26, using Euclidean algorithm.	2
1257	Find Greatest Common Divisor of 9 and 40, using prime factorization.	2
1258	Find Greatest Common Divisor of 928 and 612, using prime factorization.	2
1259	Find Greatest Common Divisor of 6437 and 2393, using prime factorization.	2
1260	Find Greatest Common Divisor of 28, 38, 52, 54, 68 and 8, using prime factorization.	2
1261	Find Greatest Common Divisor of 32, 48 and 80, using prime factorization.	2
1262	Find Greatest Common Divisor of 80 and 144, using prime factorization.	2
1263	Find Greatest Common Divisor of 1152 and 1728, using prime factorization.	2
1264	Find Greatest Common Divisor of 28, 38, 52, 54 and 68, using prime factorization.	2
1265	Find Greatest Common Divisor of 2000 and 1713, using Euclidean algorithm.	2
1266	Find Greatest Common Divisor of 2000 and 1713, using prime factorization.	2
1267	Find Greatest Common Divisor of 2000 and 1713, using repeated division.	2
1268	Find Greatest Common Divisor of 588 and 90, using prime factorization.	2
1269	Find Greatest Common Divisor of 588 and 90, using repeated division.	2
1270	Find Greatest Common Divisor of 1 and 8, using prime factorization.	2
1271	Find Greatest Common Divisor of 115 and 184, using Euclidean algorithm.	2
1272	Find Greatest Common Divisor of 115 and 184, by listing out the factors.	2
1273	Find Greatest Common Divisor of 8, 56 and 64, using prime factorization.	2
1274	Find Greatest Common Divisor of 91, 64 and 87, using prime factorization.	2
1275	Find Greatest Common Divisor of 38 and 52, using repeated division.	2
1276	Find Greatest Common Divisor of 28 and 52, using prime factorization.	2
1277	Find Greatest Common Divisor of 28 and 52, using repeated division.	2
1278	Find Greatest Common Divisor of 52 and 54, using prime factorization.	2
1279	Find Greatest Common Divisor of 52 and 54, by listing out the factors.	2
1280	Find Greatest Common Divisor of 17 and 34, using prime factorization.	2
1281	Find Greatest Common Divisor of 17, 34, 56, 60 and 61, by listing out the factors.	2
1282	Find Greatest Common Divisor of 17 and 61, using Euclidean algorithm.	2
1283	Find Greatest Common Divisor of 17 and 60, using Euclidean algorithm.	2
1284	Find Greatest Common Divisor of 378 and 140, using Euclidean algorithm.	2
1285	Find Greatest Common Divisor of 66 and 35, using Euclidean algorithm.	2
1286	Find Greatest Common Divisor of 2282 and 420, using repeated division.	2
1287	Find Greatest Common Divisor of 2282 and 420, using Euclidean algorithm.	2
1288	Find Greatest Common Divisor of 3425 and 273, using prime factorization.	2
1289	Find Greatest Common Divisor of 26 and 19, using prime factorization.	2
1290	Find Greatest Common Divisor of 187 and 34, using prime factorization.	2
1291	Find Greatest Common Divisor of 24, 45 and 5, by listing out the factors.	2
1292	Find Greatest Common Divisor of 24, 45 and 5, using repeated division.	2
1293	Find Greatest Common Divisor of 187 and 34, using Euclidean algorithm.	2
1294	Find Greatest Common Divisor of 17 and 33, using prime factorization.	2
1295	Find Greatest Common Divisor of 1048 and 136, using Euclidean algorithm.	2
1296	Find Greatest Common Divisor of 16481, 16326, 16473, 16485, 16320, 16531, 16269 and 16773, using prime factorization.	2
1297	Find Greatest Common Divisor of 2456 and 73, using prime factorization.	2
1298	Find Greatest Common Divisor of 894 and 24, using prime factorization.	2
1299	Find Greatest Common Divisor of 112 and 30, using prime factorization.	2
1300	Find Greatest Common Divisor of 657 and 143, using Euclidean algorithm.	2