GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3551	Find Greatest Common Divisor of 156 and 68, using Euclidean algorithm.	2
3552	Find Greatest Common Divisor of 156 and 68, using prime factorization.	2
3553	Find Greatest Common Divisor of 84 and 1264, using Euclidean algorithm.	2
3554	Find Greatest Common Divisor of 0, 1 and 7, using Euclidean algorithm.	2
3555	Find Greatest Common Divisor of 0, 1 and 7, using prime factorization.	2
3556	Find Greatest Common Divisor of 13 and 23, using prime factorization.	2
3557	Find Greatest Common Divisor of 1638 and 4096, using prime factorization.	2
3558	Find Greatest Common Divisor of 400 and 600, using prime factorization.	2
3559	Find Greatest Common Divisor of 60800 and 60200, using repeated division.	2
3560	Find Greatest Common Divisor of 60800 and 60200, using Euclidean algorithm.	2
3561	Find Greatest Common Divisor of 28 and 294, using prime factorization.	2
3562	Find Greatest Common Divisor of 3587 and 1819, using repeated division.	2
3563	Find Greatest Common Divisor of 244 and 117, using Euclidean algorithm.	2
3564	Find Greatest Common Divisor of 4001, 1312 and 458, using Euclidean algorithm.	2
3565	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, by listing out the factors.	2
3566	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, using repeated division.	2
3567	Find Greatest Common Divisor of 17 and 25, using repeated division.	2
3568	Find Greatest Common Divisor of 17 and 25, by listing out the factors.	2
3569	Find Greatest Common Divisor of 21 and 44, using Euclidean algorithm.	2
3570	Find Greatest Common Divisor of 3120 and 17, by listing out the factors.	2
3571	Find Greatest Common Divisor of 3120 and 17, using Euclidean algorithm.	2
3572	Find Greatest Common Divisor of 18 and 72, using prime factorization.	2
3573	Find Greatest Common Divisor of 29 and 72, using prime factorization.	2
3574	Find Greatest Common Divisor of 17 and 72, using prime factorization.	2
3575	Find Greatest Common Divisor of 484 and 398, using prime factorization.	2
3576	Find Greatest Common Divisor of 275 and 435, using prime factorization.	2
3577	Find Greatest Common Divisor of 2835 and 8960, using prime factorization.	2
3578	Find Greatest Common Divisor of 35 and 192, using Euclidean algorithm.	2
3579	Find Greatest Common Divisor of 1914 and 899, using prime factorization.	2
3580	Find Greatest Common Divisor of 765844 and 836, using Euclidean algorithm.	2
3581	Find Greatest Common Divisor of 76587 and 836, using Euclidean algorithm.	2
3582	Find Greatest Common Divisor of 765844 and 8365, using Euclidean algorithm.	2
3583	Find Greatest Common Divisor of 765844 and 8362, using Euclidean algorithm.	2
3584	Find Greatest Common Divisor of 2001 and 2544, using Euclidean algorithm.	2
3585	Find Greatest Common Divisor of 940 and 56, using prime factorization.	2
3586	Find Greatest Common Divisor of 940 and 56, using Euclidean algorithm.	2
3587	Find Greatest Common Divisor of 4.	2
3588	Find Greatest Common Divisor of 4.	2
3589	Find Greatest Common Divisor of 4, 34, 7, 19 and 6, using Euclidean algorithm.	2
3590	Find Greatest Common Divisor of 17 and 26, using prime factorization.	2
3591	Find Greatest Common Divisor of 750, 900 and 6, using prime factorization.	2
3592	Find Greatest Common Divisor of 750, 900 and 6, by listing out the factors.	2
3593	Find Greatest Common Divisor of 21 and 72, using prime factorization.	2
3594	Find Greatest Common Divisor of 21 and 72, using Euclidean algorithm.	2
3595	Find Greatest Common Divisor of 36 and 104, using Euclidean algorithm.	2
3596	Find Greatest Common Divisor of 370 and 210, using prime factorization.	2
3597	Find Greatest Common Divisor of 1024 and 768, using Euclidean algorithm.	2
3598	Find Greatest Common Divisor of 1176.	2
3599	Find Greatest Common Divisor of 1176.	2
3600	Find Greatest Common Divisor of 36 and 104, using prime factorization.	2