GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3501	Find Greatest Common Divisor of 220 and 8900, using prime factorization.	2
3502	Find Greatest Common Divisor of 1, 9, 1 and 3, using prime factorization.	2
3503	Find Greatest Common Divisor of 1, 8, 1 and 2, using prime factorization.	2
3504	Find Greatest Common Divisor of 36, 81 and 2, using prime factorization.	2
3505	Find Greatest Common Divisor of 4801 and 500, using Euclidean algorithm.	2
3506	Find Greatest Common Divisor of 3120.	2
3507	Find Greatest Common Divisor of 130 and 115, by listing out the factors.	2
3508	Find Greatest Common Divisor of 156 and 68, using Euclidean algorithm.	2
3509	Find Greatest Common Divisor of 156 and 68, using prime factorization.	2
3510	Find Greatest Common Divisor of 84 and 1264, using Euclidean algorithm.	2
3511	Find Greatest Common Divisor of 0, 1 and 7, using Euclidean algorithm.	2
3512	Find Greatest Common Divisor of 0, 1 and 7, using prime factorization.	2
3513	Find Greatest Common Divisor of 13 and 23, using prime factorization.	2
3514	Find Greatest Common Divisor of 1638 and 4096, using prime factorization.	2
3515	Find Greatest Common Divisor of 400 and 600, using prime factorization.	2
3516	Find Greatest Common Divisor of 60800 and 60200, using repeated division.	2
3517	Find Greatest Common Divisor of 60800 and 60200, using Euclidean algorithm.	2
3518	Find Greatest Common Divisor of 28 and 294, using prime factorization.	2
3519	Find Greatest Common Divisor of 3587 and 1819, using repeated division.	2
3520	Find Greatest Common Divisor of 244 and 117, using Euclidean algorithm.	2
3521	Find Greatest Common Divisor of 4001, 1312 and 458, using Euclidean algorithm.	2
3522	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, by listing out the factors.	2
3523	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, using repeated division.	2
3524	Find Greatest Common Divisor of 17 and 25, using repeated division.	2
3525	Find Greatest Common Divisor of 17 and 25, by listing out the factors.	2
3526	Find Greatest Common Divisor of 21 and 44, using Euclidean algorithm.	2
3527	Find Greatest Common Divisor of 3120 and 17, using Euclidean algorithm.	2
3528	Find Greatest Common Divisor of 18 and 72, using prime factorization.	2
3529	Find Greatest Common Divisor of 29 and 72, using prime factorization.	2
3530	Find Greatest Common Divisor of 17 and 72, using prime factorization.	2
3531	Find Greatest Common Divisor of 484 and 398, using prime factorization.	2
3532	Find Greatest Common Divisor of 275 and 435, using prime factorization.	2
3533	Find Greatest Common Divisor of 2835 and 8960, using prime factorization.	2
3534	Find Greatest Common Divisor of 35 and 192, using Euclidean algorithm.	2
3535	Find Greatest Common Divisor of 1914 and 899, using prime factorization.	2
3536	Find Greatest Common Divisor of 765844 and 836, using Euclidean algorithm.	2
3537	Find Greatest Common Divisor of 76587 and 836, using Euclidean algorithm.	2
3538	Find Greatest Common Divisor of 765844 and 8365, using Euclidean algorithm.	2
3539	Find Greatest Common Divisor of 765844 and 8362, using Euclidean algorithm.	2
3540	Find Greatest Common Divisor of 2001 and 2544, using Euclidean algorithm.	2
3541	Find Greatest Common Divisor of 940 and 56, using prime factorization.	2
3542	Find Greatest Common Divisor of 940 and 56, using Euclidean algorithm.	2
3543	Find Greatest Common Divisor of 4.	2
3544	Find Greatest Common Divisor of 4.	2
3545	Find Greatest Common Divisor of 4, 34, 7, 19 and 6, using Euclidean algorithm.	2
3546	Find Greatest Common Divisor of 17 and 26, using prime factorization.	2
3547	Find Greatest Common Divisor of 750, 900 and 6, using prime factorization.	2
3548	Find Greatest Common Divisor of 750, 900 and 6, by listing out the factors.	2
3549	Find Greatest Common Divisor of 21 and 72, using Euclidean algorithm.	2
3550	Find Greatest Common Divisor of 36 and 104, using Euclidean algorithm.	2