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 1728 and 3072, using Euclidean algorithm.	2
3852	Find Greatest Common Divisor of 8, 332 and 1004, using repeated division.	2
3853	Find Greatest Common Divisor of 168, 420 and 588, using repeated division.	2
3854	Find Greatest Common Divisor of 576, 672 and 1632, using repeated division.	2
3855	Find Greatest Common Divisor of 65 and 37, using Euclidean algorithm.	2
3856	Find Greatest Common Divisor of 10, 12 and 14, using prime factorization.	2
3857	Find Greatest Common Divisor of 360 and 504, using repeated division.	2
3858	Find Greatest Common Divisor of 162 and 297, using repeated division.	2
3859	Find Greatest Common Divisor of 60, 132 and 168, using repeated division.	2
3860	Find Greatest Common Divisor of 234 and 261, using repeated division.	2
3861	Find Greatest Common Divisor of 420, 560 and 630, using repeated division.	2
3862	Find Greatest Common Divisor of 1105 and 780, using Euclidean algorithm.	2
3863	Find Greatest Common Divisor of 2806 and 1702, using prime factorization.	2
3864	Find Greatest Common Divisor of 4200 and 1008, using prime factorization.	2
3865	Find Greatest Common Divisor of 7936259 and 16593996, using prime factorization.	2
3866	Find Greatest Common Divisor of 345 and 912, using Euclidean algorithm.	2
3867	Find Greatest Common Divisor of 392 and 23, using Euclidean algorithm.	2
3868	Find Greatest Common Divisor of 3921 and 23, using Euclidean algorithm.	2
3869	Find Greatest Common Divisor of 3921 and 238, using Euclidean algorithm.	2
3870	Find Greatest Common Divisor of 3921 and 538, using Euclidean algorithm.	2
3871	Find Greatest Common Divisor of 3621 and 938, using Euclidean algorithm.	2
3872	Find Greatest Common Divisor of 3621 and 1938, using Euclidean algorithm.	2
3873	Find Greatest Common Divisor of 623 and 51, using Euclidean algorithm.	2
3874	Find Greatest Common Divisor of 623 and 59, using Euclidean algorithm.	2
3875	Find Greatest Common Divisor of 623 and 98, using Euclidean algorithm.	2
3876	Find Greatest Common Divisor of 317.	2
3877	Find Greatest Common Divisor of 36 and 56, using repeated division.	2
3878	Find Greatest Common Divisor of 34 and 62, using repeated division.	2
3879	Find Greatest Common Divisor of 34 and 66, using repeated division.	2
3880	Find Greatest Common Divisor of 34 and 70, using repeated division.	2
3881	Find Greatest Common Divisor of 34 and 700, using repeated division.	2
3882	Find Greatest Common Divisor of 34 and 708, using repeated division.	2
3883	Find Greatest Common Divisor of 34 and 718, using repeated division.	2
3884	Find Greatest Common Divisor of 54 and 36, using repeated division.	2
3885	Find Greatest Common Divisor of 54 and 36, using Euclidean algorithm.	2
3886	Find Greatest Common Divisor of 56 and 36, using Euclidean algorithm.	2
3887	Find Greatest Common Divisor of 30690 and 93093, using prime factorization.	2
3888	Find Greatest Common Divisor of 30690 and 93093, using Euclidean algorithm.	2
3889	Find Greatest Common Divisor of 378 and 858, using prime factorization.	2
3890	Find Greatest Common Divisor of 36 and 248, using Euclidean algorithm.	2
3891	Find Greatest Common Divisor of 5, 17, 23, 14 and 83, using prime factorization.	2
3892	Find Greatest Common Divisor of 5, 17, 23, 14 and 83, using Euclidean algorithm.	2
3893	Find Greatest Common Divisor of 3991 and 285, using prime factorization.	2
3894	Find Greatest Common Divisor of 3991 and 285, using Euclidean algorithm.	2
3895	Find Greatest Common Divisor of 3991 and 328, using Euclidean algorithm.	2
3896	Find Greatest Common Divisor of 9 and 512, using prime factorization.	2
3897	Find Greatest Common Divisor of 169 and 6, using Euclidean algorithm.	2
3898	Find Greatest Common Divisor of 223 and 11, using Euclidean algorithm.	2
3899	Find Greatest Common Divisor of 52 and 30, using Euclidean algorithm.	2
3900	Find Greatest Common Divisor of 1625 and 975, using repeated division.	2