GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1301	Find Greatest Common Divisor of 28 and 294, using prime factorization.	2
1302	Find Greatest Common Divisor of 3587 and 1819, using repeated division.	2
1303	Find Greatest Common Divisor of 244 and 117, using Euclidean algorithm.	2
1304	Find Greatest Common Divisor of 4001, 1312 and 458, using Euclidean algorithm.	2
1305	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, by listing out the factors.	2
1306	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, using repeated division.	2
1307	Find Greatest Common Divisor of 17 and 25, using repeated division.	2
1308	Find Greatest Common Divisor of 17 and 25, by listing out the factors.	2
1309	Find Greatest Common Divisor of 21 and 44, using Euclidean algorithm.	2
1310	Find Greatest Common Divisor of 3120 and 17, by listing out the factors.	2
1311	Find Greatest Common Divisor of 3120 and 17, using Euclidean algorithm.	2
1312	Find Greatest Common Divisor of 18 and 72, using prime factorization.	2
1313	Find Greatest Common Divisor of 29 and 72, using prime factorization.	2
1314	Find Greatest Common Divisor of 17 and 72, using prime factorization.	2
1315	Find Greatest Common Divisor of 484 and 398, using prime factorization.	2
1316	Find Greatest Common Divisor of 275 and 435, using prime factorization.	2
1317	Find Greatest Common Divisor of 2835 and 8960, using prime factorization.	2
1318	Find Greatest Common Divisor of 35 and 192, using Euclidean algorithm.	2
1319	Find Greatest Common Divisor of 1914 and 899, using prime factorization.	2
1320	Find Greatest Common Divisor of 34 and 102, using prime factorization.	2
1321	Find Greatest Common Divisor of 765844 and 836, using Euclidean algorithm.	2
1322	Find Greatest Common Divisor of 76587 and 836, using Euclidean algorithm.	2
1323	Find Greatest Common Divisor of 765844 and 8365, using Euclidean algorithm.	2
1324	Find Greatest Common Divisor of 765844 and 8362, using Euclidean algorithm.	2
1325	Find Greatest Common Divisor of 2001 and 2544, using Euclidean algorithm.	2
1326	Find Greatest Common Divisor of 940 and 56, using prime factorization.	2
1327	Find Greatest Common Divisor of 940 and 56, using Euclidean algorithm.	2
1328	Find Greatest Common Divisor of 4.	2
1329	Find Greatest Common Divisor of 4.	2
1330	Find Greatest Common Divisor of 4, 34, 7, 19 and 6, using Euclidean algorithm.	2
1331	Find Greatest Common Divisor of 17 and 26, using prime factorization.	2
1332	Find Greatest Common Divisor of 750, 900 and 6, using prime factorization.	2
1333	Find Greatest Common Divisor of 750, 900 and 6, by listing out the factors.	2
1334	Find Greatest Common Divisor of 21 and 72, using prime factorization.	2
1335	Find Greatest Common Divisor of 21 and 72, using Euclidean algorithm.	2
1336	Find Greatest Common Divisor of 36 and 104, using Euclidean algorithm.	2
1337	Find Greatest Common Divisor of 370 and 210, using prime factorization.	2
1338	Find Greatest Common Divisor of 1024 and 768, using Euclidean algorithm.	2
1339	Find Greatest Common Divisor of 1176.	2
1340	Find Greatest Common Divisor of 1176.	2
1341	Find Greatest Common Divisor of 36 and 104, using prime factorization.	2
1342	Find Greatest Common Divisor of 560, 224 and 336, using prime factorization.	2
1343	Find Greatest Common Divisor of 123 and 277, using Euclidean algorithm.	2
1344	Find Greatest Common Divisor of 1529 and 14039, using Euclidean algorithm.	2
1345	Find Greatest Common Divisor of 396.	2
1346	Find Greatest Common Divisor of 60 and 24, using prime factorization.	2
1347	Find Greatest Common Divisor of 160000.	2
1348	Find Greatest Common Divisor of 20.	2
1349	Find Greatest Common Divisor of 672 and 864, using prime factorization.	2
1350	Find Greatest Common Divisor of 51 and 85, using prime factorization.	2