GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4151	Find Greatest Common Divisor of 48 and 30, using Euclidean algorithm.	2
4152	Find Greatest Common Divisor of 2160 and 2204, using prime factorization.	2
4153	Find Greatest Common Divisor of 13 and 41, using Euclidean algorithm.	2
4154	Find Greatest Common Divisor of 84, 36 and 75, using prime factorization.	2
4155	Find Greatest Common Divisor of 12 and 15, using repeated division.	2
4156	Find Greatest Common Divisor of 213 and 466, using prime factorization.	2
4157	Find Greatest Common Divisor of 312 and 418, using Euclidean algorithm.	2
4158	Find Greatest Common Divisor of 38.	2
4159	Find Greatest Common Divisor of 1, 2, 5 and 7, using prime factorization.	2
4160	Find Greatest Common Divisor of 2024.	2
4161	Find Greatest Common Divisor of 868 and 378, using Euclidean algorithm.	2
4162	Find Greatest Common Divisor of 214.	2
4163	Find Greatest Common Divisor of 214 and 210, using prime factorization.	2
4164	Find Greatest Common Divisor of 378, 588 and 252, using prime factorization.	2
4165	Find Greatest Common Divisor of 16, 28, 32, 37, 45, 1 and 11, using Euclidean algorithm.	2
4166	Find Greatest Common Divisor of 10 and 20, using Euclidean algorithm.	2
4167	Find Greatest Common Divisor of 10 and 25, using Euclidean algorithm.	2
4168	Find Greatest Common Divisor of 123 and 48, using prime factorization.	2
4169	Find Greatest Common Divisor of 7800 and 4900, using prime factorization.	2
4170	Find Greatest Common Divisor of 240 and 150, using prime factorization.	2
4171	Find Greatest Common Divisor of 90, 36 and 72, using prime factorization.	2
4172	Find Greatest Common Divisor of 3454 and 4666, using prime factorization.	2
4173	Find Greatest Common Divisor of 15 and 100, by listing out the factors.	2
4174	Find Greatest Common Divisor of 150 and 100, using prime factorization.	2
4175	Find Greatest Common Divisor of 1981, 2 and 100, using prime factorization.	2
4176	Find Greatest Common Divisor of 24 and 90, using prime factorization.	2
4177	Find Greatest Common Divisor of 24 and 56, using prime factorization.	2
4178	Find Greatest Common Divisor of 24 and 56, using repeated division.	2
4179	Find Greatest Common Divisor of 44 and 88, using prime factorization.	2
4180	Find Greatest Common Divisor of 523 and 728, using prime factorization.	2
4181	Find Greatest Common Divisor of 11 and 2112, using prime factorization.	2
4182	Find Greatest Common Divisor of 8 and 7, using prime factorization.	2
4183	Find Greatest Common Divisor of 12 and 1, using prime factorization.	2
4184	Find Greatest Common Divisor of 113 and 2013, using Euclidean algorithm.	2
4185	Find Greatest Common Divisor of 2740 and 1760, using prime factorization.	2
4186	Find Greatest Common Divisor of 27 and 25, using repeated division.	2
4187	Find Greatest Common Divisor of 735 and 294, using repeated division.	2
4188	Find Greatest Common Divisor of 1350, 6075, 3375 and 7425, using repeated division.	2
4189	Find Greatest Common Divisor of 24696, 5488, 8232 and 19208, using repeated division.	2
4190	Find Greatest Common Divisor of 621 and 333, using Euclidean algorithm.	2
4191	Find Greatest Common Divisor of 5700, 3192, 2128 and 3496, using repeated division.	2
4192	Find Greatest Common Divisor of 43 and 59, using prime factorization.	2
4193	Find Greatest Common Divisor of 66 and 90, using prime factorization.	2
4194	Find Greatest Common Divisor of 456 and 123, using Euclidean algorithm.	2
4195	Find Greatest Common Divisor of 199 and 98, using Euclidean algorithm.	2
4196	Find Greatest Common Divisor of 172 and 246, using prime factorization.	2
4197	Find Greatest Common Divisor of 24 and 55, using prime factorization.	2
4198	Find Greatest Common Divisor of 216 and 352, using repeated division.	2
4199	Find Greatest Common Divisor of 98 and 74, using prime factorization.	2
4200	Find Greatest Common Divisor of 64, 192 and 960, using prime factorization.	2