GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3851	Find Greatest Common Divisor of 36 and 54, using repeated division.	2
3852	Find Greatest Common Divisor of 145 and 15, using Euclidean algorithm.	2
3853	Find Greatest Common Divisor of 145, 15 and 5, using Euclidean algorithm.	2
3854	Find Greatest Common Divisor of 311 and 28, using repeated division.	2
3855	Find Greatest Common Divisor of 143, 110 and 11, using prime factorization.	2
3856	Find Greatest Common Divisor of 1032 and 780, using Euclidean algorithm.	2
3857	Find Greatest Common Divisor of 61, 610, 1, 61, 671 and 1, using prime factorization.	2
3858	Find Greatest Common Divisor of 18 and 32, using Euclidean algorithm.	2
3859	Find Greatest Common Divisor of 135165.	2
3860	Find Greatest Common Divisor of 135 and 165, using Euclidean algorithm.	2
3861	Find Greatest Common Divisor of 115, 230 and 345, using repeated division.	2
3862	Find Greatest Common Divisor of 1001 and 100001, using Euclidean algorithm.	2
3863	Find Greatest Common Divisor of 55 and 33, using repeated division.	2
3864	Find Greatest Common Divisor of 67945906928237 and 158551974451753, using prime factorization.	2
3865	Find Greatest Common Divisor of 39 and 56, using Euclidean algorithm.	2
3866	Find Greatest Common Divisor of 14 and 9, using Euclidean algorithm.	2
3867	Find Greatest Common Divisor of 6897 and 11857, using Euclidean algorithm.	2
3868	Find Greatest Common Divisor of 6897 and 9481, using Euclidean algorithm.	2
3869	Find Greatest Common Divisor of 85 and 901, using prime factorization.	2
3870	Find Greatest Common Divisor of 25 and 777, using prime factorization.	2
3871	Find Greatest Common Divisor of 65 and 39, using prime factorization.	2
3872	Find Greatest Common Divisor of 66 and 286, using prime factorization.	2
3873	Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization.	2
3874	Find Greatest Common Divisor of 133 and 38, using Euclidean algorithm.	2
3875	Find Greatest Common Divisor of 97 and 1045, using prime factorization.	2
3876	Find Greatest Common Divisor of 2378 and 1764, using Euclidean algorithm.	2
3877	Find Greatest Common Divisor of 43.	2
3878	Find Greatest Common Divisor of 48 and 60, using repeated division.	2
3879	Find Greatest Common Divisor of 2517 and 2370, using prime factorization.	2
3880	Find Greatest Common Divisor of 24 and 80, using prime factorization.	2
3881	Find Greatest Common Divisor of 133 and 1729, using prime factorization.	2
3882	Find Greatest Common Divisor of 20 and 216, using prime factorization.	2
3883	Find Greatest Common Divisor of 16, 38, 16 and 38, using prime factorization.	2
3884	Find Greatest Common Divisor of 7, 17, 11, 28, 13, 347, 19, 11, 33, 13 and 30, using prime factorization.	2
3885	Find Greatest Common Divisor of 2 and 1, using Euclidean algorithm.	2
3886	Find Greatest Common Divisor of 116369 and 2873, by listing out the factors.	2
3887	Find Greatest Common Divisor of 38, 57 and 19, using Euclidean algorithm.	2
3888	Find Greatest Common Divisor of 3 and 2, using Euclidean algorithm.	2
3889	Find Greatest Common Divisor of 4 and 2, using Euclidean algorithm.	2
3890	Find Greatest Common Divisor of 4 and 3, using Euclidean algorithm.	2
3891	Find Greatest Common Divisor of 18, 19 and 22, by listing out the factors.	2
3892	Find Greatest Common Divisor of 36, 72 and 102, by listing out the factors.	2
3893	Find Greatest Common Divisor of 503, 1101 and 2002, by listing out the factors.	2
3894	Find Greatest Common Divisor of 4736 and 8, using prime factorization.	2
3895	Find Greatest Common Divisor of 24 and 3, using repeated division.	2
3896	Find Greatest Common Divisor of 116 and 25, using prime factorization.	2
3897	Find Greatest Common Divisor of 56 and 72, using prime factorization.	2
3898	Find Greatest Common Divisor of 285.	2
3899	Find Greatest Common Divisor of 54 and 252, using prime factorization.	2
3900	Find Greatest Common Divisor of 1759 and 550, using prime factorization.	2