GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
2351	Find Greatest Common Divisor of 252 and 180, using prime factorization.	2
2352	Find Greatest Common Divisor of 60 and 45, using prime factorization.	2
2353	Find Greatest Common Divisor of 64, 48 and 16, using prime factorization.	2
2354	Find Greatest Common Divisor of 5, 15 and 25, by listing out the factors.	2
2355	Find Greatest Common Divisor of 860 and 240, using Euclidean algorithm.	2
2356	Find Greatest Common Divisor of 23 and 67, using prime factorization.	2
2357	Find Greatest Common Divisor of 180 and 192, using repeated division.	2
2358	Find Greatest Common Divisor of 180 and 192, using Euclidean algorithm.	2
2359	Find Greatest Common Divisor of 180 and 192, by listing out the factors.	2
2360	Find Greatest Common Divisor of 11 and 24, using Euclidean algorithm.	2
2361	Find Greatest Common Divisor of 9, 2, 2, 9, 2 and 2, using Euclidean algorithm.	2
2362	Find Greatest Common Divisor of 465 and 3861, using prime factorization.	2
2363	Find Greatest Common Divisor of 19950 and 14950, using Euclidean algorithm.	2
2364	Find Greatest Common Divisor of 15130 and 10130, using Euclidean algorithm.	2
2365	Find Greatest Common Divisor of 17590 and 12590, using Euclidean algorithm.	2
2366	Find Greatest Common Divisor of 17630 and 12630, using Euclidean algorithm.	2
2367	Find Greatest Common Divisor of 17650 and 12650, using Euclidean algorithm.	2
2368	Find Greatest Common Divisor of 17670 and 12670, using Euclidean algorithm.	2
2369	Find Greatest Common Divisor of 15530 and 10530, using Euclidean algorithm.	2
2370	Find Greatest Common Divisor of 15610 and 10610, using Euclidean algorithm.	2
2371	Find Greatest Common Divisor of 15710 and 10710, using Euclidean algorithm.	2
2372	Find Greatest Common Divisor of 15790 and 10790, using Euclidean algorithm.	2
2373	Find Greatest Common Divisor of 15830 and 10830, using Euclidean algorithm.	2
2374	Find Greatest Common Divisor of 15890 and 10890, using Euclidean algorithm.	2
2375	Find Greatest Common Divisor of 15970 and 10970, using Euclidean algorithm.	2
2376	Find Greatest Common Divisor of 16010 and 11010, using Euclidean algorithm.	2
2377	Find Greatest Common Divisor of 16110 and 11110, using Euclidean algorithm.	2
2378	Find Greatest Common Divisor of 16150 and 11150, using Euclidean algorithm.	2
2379	Find Greatest Common Divisor of 16210 and 11210, using Euclidean algorithm.	2
2380	Find Greatest Common Divisor of 17770 and 12770, using Euclidean algorithm.	2
2381	Find Greatest Common Divisor of 16310 and 11310, using Euclidean algorithm.	2
2382	Find Greatest Common Divisor of 16330 and 11330, using Euclidean algorithm.	2
2383	Find Greatest Common Divisor of 17870 and 12870, using Euclidean algorithm.	2
2384	Find Greatest Common Divisor of 17890 and 12890, using Euclidean algorithm.	2
2385	Find Greatest Common Divisor of 17910 and 12910, using Euclidean algorithm.	2
2386	Find Greatest Common Divisor of 17930 and 12930, using Euclidean algorithm.	2
2387	Find Greatest Common Divisor of 17950 and 12950, using Euclidean algorithm.	2
2388	Find Greatest Common Divisor of 16810 and 11810, using Euclidean algorithm.	2
2389	Find Greatest Common Divisor of 16830 and 11830, using Euclidean algorithm.	2
2390	Find Greatest Common Divisor of 16850 and 11850, using Euclidean algorithm.	2
2391	Find Greatest Common Divisor of 18010 and 13010, using Euclidean algorithm.	2
2392	Find Greatest Common Divisor of 16910 and 11910, using Euclidean algorithm.	2
2393	Find Greatest Common Divisor of 18030 and 13030, using Euclidean algorithm.	2
2394	Find Greatest Common Divisor of 17010 and 12010, using Euclidean algorithm.	2
2395	Find Greatest Common Divisor of 18090 and 13090, using Euclidean algorithm.	2
2396	Find Greatest Common Divisor of 17110 and 12110, using Euclidean algorithm.	2
2397	Find Greatest Common Divisor of 17230 and 12230, using Euclidean algorithm.	2
2398	Find Greatest Common Divisor of 18130 and 13130, using Euclidean algorithm.	2
2399	Find Greatest Common Divisor of 17330 and 12330, using Euclidean algorithm.	2
2400	Find Greatest Common Divisor of 18150 and 13150, using Euclidean algorithm.	2