GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3751	Find Greatest Common Divisor of 61, 610, 1, 61, 671 and 1, using prime factorization.	2
3752	Find Greatest Common Divisor of 18 and 32, using Euclidean algorithm.	2
3753	Find Greatest Common Divisor of 135165.	2
3754	Find Greatest Common Divisor of 135 and 165, using Euclidean algorithm.	2
3755	Find Greatest Common Divisor of 115, 230 and 345, using repeated division.	2
3756	Find Greatest Common Divisor of 1001 and 100001, using Euclidean algorithm.	2
3757	Find Greatest Common Divisor of 55 and 33, using repeated division.	2
3758	Find Greatest Common Divisor of 67945906928237 and 158551974451753, using prime factorization.	2
3759	Find Greatest Common Divisor of 39 and 56, using Euclidean algorithm.	2
3760	Find Greatest Common Divisor of 14 and 9, using Euclidean algorithm.	2
3761	Find Greatest Common Divisor of 6897 and 11857, using Euclidean algorithm.	2
3762	Find Greatest Common Divisor of 6897 and 9481, using Euclidean algorithm.	2
3763	Find Greatest Common Divisor of 85 and 901, using prime factorization.	2
3764	Find Greatest Common Divisor of 25 and 777, using prime factorization.	2
3765	Find Greatest Common Divisor of 65 and 39, using prime factorization.	2
3766	Find Greatest Common Divisor of 66 and 286, using prime factorization.	2
3767	Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization.	2
3768	Find Greatest Common Divisor of 133 and 38, using Euclidean algorithm.	2
3769	Find Greatest Common Divisor of 97 and 1045, using prime factorization.	2
3770	Find Greatest Common Divisor of 2378 and 1764, using Euclidean algorithm.	2
3771	Find Greatest Common Divisor of 43.	2
3772	Find Greatest Common Divisor of 48 and 60, using repeated division.	2
3773	Find Greatest Common Divisor of 2517 and 2370, using prime factorization.	2
3774	Find Greatest Common Divisor of 24 and 80, using prime factorization.	2
3775	Find Greatest Common Divisor of 133 and 1729, using prime factorization.	2
3776	Find Greatest Common Divisor of 20 and 216, using prime factorization.	2
3777	Find Greatest Common Divisor of 16, 38, 16 and 38, using prime factorization.	2
3778	Find Greatest Common Divisor of 7, 17, 11, 28, 13, 347, 19, 11, 33, 13 and 30, using prime factorization.	2
3779	Find Greatest Common Divisor of 2 and 1, using Euclidean algorithm.	2
3780	Find Greatest Common Divisor of 116369 and 2873, by listing out the factors.	2
3781	Find Greatest Common Divisor of 38, 57 and 19, using Euclidean algorithm.	2
3782	Find Greatest Common Divisor of 3 and 2, using Euclidean algorithm.	2
3783	Find Greatest Common Divisor of 4 and 2, using Euclidean algorithm.	2
3784	Find Greatest Common Divisor of 4 and 3, using Euclidean algorithm.	2
3785	Find Greatest Common Divisor of 18, 19 and 22, by listing out the factors.	2
3786	Find Greatest Common Divisor of 36, 72 and 102, by listing out the factors.	2
3787	Find Greatest Common Divisor of 503, 1101 and 2002, by listing out the factors.	2
3788	Find Greatest Common Divisor of 4736 and 8, using prime factorization.	2
3789	Find Greatest Common Divisor of 24 and 3, using repeated division.	2
3790	Find Greatest Common Divisor of 116 and 25, using prime factorization.	2
3791	Find Greatest Common Divisor of 56 and 72, using prime factorization.	2
3792	Find Greatest Common Divisor of 285.	2
3793	Find Greatest Common Divisor of 54 and 252, using prime factorization.	2
3794	Find Greatest Common Divisor of 1759 and 550, using prime factorization.	2
3795	Find Greatest Common Divisor of 14, 3 and 5, using prime factorization.	2
3796	Find Greatest Common Divisor of 816 and 3612, using Euclidean algorithm.	2
3797	Find Greatest Common Divisor of 220 and 400, using prime factorization.	2
3798	Find Greatest Common Divisor of 100 and 101, using prime factorization.	2
3799	Find Greatest Common Divisor of 11, 7 and 8, using Euclidean algorithm.	2
3800	Find Greatest Common Divisor of 12 and 77, using Euclidean algorithm.	2