GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
2401	Find Greatest Common Divisor of 65 and 50, using prime factorization.	2
2402	Find Greatest Common Divisor of 26 and 118, using Euclidean algorithm.	2
2403	Find Greatest Common Divisor of 1024 and 486, using Euclidean algorithm.	2
2404	Find Greatest Common Divisor of 486 and 18, using Euclidean algorithm.	2
2405	Find Greatest Common Divisor of 52 and 21, using Euclidean algorithm.	2
2406	Find Greatest Common Divisor of 50, 75 and 120, using prime factorization.	2
2407	Find Greatest Common Divisor of 4 and 39, using Euclidean algorithm.	2
2408	Find Greatest Common Divisor of 49 and 156, using Euclidean algorithm.	2
2409	Find Greatest Common Divisor of 35 and 81, using Euclidean algorithm.	2
2410	Find Greatest Common Divisor of 10032 and 873, using prime factorization.	2
2411	Find Greatest Common Divisor of 38603578125 and 86821875, using prime factorization.	2
2412	Find Greatest Common Divisor of 6699 and 8265, using repeated division.	2
2413	Find Greatest Common Divisor of 91 and 65, using prime factorization.	2
2414	Find Greatest Common Divisor of 72 and 96, using prime factorization.	2
2415	Find Greatest Common Divisor of 66, 45 and 9, using prime factorization.	2
2416	Find Greatest Common Divisor of 50, 100 and 75, using prime factorization.	2
2417	Find Greatest Common Divisor of 5720 and 5460, using prime factorization.	2
2418	Find Greatest Common Divisor of 42 and 72, using prime factorization.	2
2419	Find Greatest Common Divisor of 123456 and 789, using repeated division.	2
2420	Find Greatest Common Divisor of 3 and 62, using prime factorization.	2
2421	Find Greatest Common Divisor of 135 and 105, using prime factorization.	2
2422	Find Greatest Common Divisor of 18, 40, 360 and 14, using prime factorization.	2
2423	Find Greatest Common Divisor of 10 and 21, using repeated division.	2
2424	Find Greatest Common Divisor of 2600 and 5500, using Euclidean algorithm.	2
2425	Find Greatest Common Divisor of 81.	2
2426	Find Greatest Common Divisor of 8130.	2
2427	Find Greatest Common Divisor of 1755 and 2475, using repeated division.	2
2428	Find Greatest Common Divisor of 6035 and 578, using Euclidean algorithm.	2
2429	Find Greatest Common Divisor of 52 and 18, using prime factorization.	2
2430	Find Greatest Common Divisor of 486 and 52, using prime factorization.	2
2431	Find Greatest Common Divisor of 1739 and 9923, using Euclidean algorithm.	2
2432	Find Greatest Common Divisor of 161 and 128, using prime factorization.	2
2433	Find Greatest Common Divisor of 21 and 92, using prime factorization.	2
2434	Find Greatest Common Divisor of 1372 and 5733, using Euclidean algorithm.	2
2435	Find Greatest Common Divisor of 445 and 556, using Euclidean algorithm.	2
2436	Find Greatest Common Divisor of 332 and 192, using Euclidean algorithm.	2
2437	Find Greatest Common Divisor of 45, 50 and 60, using prime factorization.	2
2438	Find Greatest Common Divisor of 441, 228 and 445, using prime factorization.	2
2439	Find Greatest Common Divisor of 228 and 441, using prime factorization.	2
2440	Find Greatest Common Divisor of 17.	2
2441	Find Greatest Common Divisor of 181 and 52, using prime factorization.	2
2442	Find Greatest Common Divisor of 230 and 45, using prime factorization.	2
2443	Find Greatest Common Divisor of 790 and 121, using prime factorization.	2
2444	Find Greatest Common Divisor of 48, 64 and 100, by listing out the factors.	2
2445	Find Greatest Common Divisor of 3158 and 1226, using Euclidean algorithm.	2
2446	Find Greatest Common Divisor of 11 and 39, using Euclidean algorithm.	2
2447	Find Greatest Common Divisor of 6144 and 20, using prime factorization.	2
2448	Find Greatest Common Divisor of 85672 and 242040, using Euclidean algorithm.	2
2449	Find Greatest Common Divisor of 5, 7 and 13, using prime factorization.	2
2450	Find Greatest Common Divisor of 1492 and 1066, using Euclidean algorithm.	2