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 25, 45 and 55, by listing out the factors.	2
4152	Find Greatest Common Divisor of 2957 and 400680, using repeated division.	2
4153	Find Greatest Common Divisor of 2957 and 400680, using prime factorization.	2
4154	Find Greatest Common Divisor of 2957 and 400680, using Euclidean algorithm.	2
4155	Find Greatest Common Divisor of 3501 and 400680, using Euclidean algorithm.	2
4156	Find Greatest Common Divisor of 819 and 72, using prime factorization.	2
4157	Find Greatest Common Divisor of 819 and 72, using repeated division.	2
4158	Find Greatest Common Divisor of 1, 8, 2 and 4, using prime factorization.	2
4159	Find Greatest Common Divisor of 1970 and 1066, using prime factorization.	2
4160	Find Greatest Common Divisor of 441, 567 and 693, using repeated division.	2
4161	Find Greatest Common Divisor of 296 and 481, using repeated division.	2
4162	Find Greatest Common Divisor of 98 and 96, using Euclidean algorithm.	2
4163	Find Greatest Common Divisor of 95 and 90, using Euclidean algorithm.	2
4164	Find Greatest Common Divisor of 116, 60, 98 and 109, using repeated division.	2
4165	Find Greatest Common Divisor of 39, 65 and 91, using prime factorization.	2
4166	Find Greatest Common Divisor of 120 and 112, using prime factorization.	2
4167	Find Greatest Common Divisor of 120 and 122, using prime factorization.	2
4168	Find Greatest Common Divisor of 5 and 17, using prime factorization.	2
4169	Find Greatest Common Divisor of 5 and 17, by listing out the factors.	2
4170	Find Greatest Common Divisor of 534, 801 and 1335, using prime factorization.	2
4171	Find Greatest Common Divisor of 49, 91 and 70, using repeated division.	2
4172	Find Greatest Common Divisor of 527 and 646, using repeated division.	2
4173	Find Greatest Common Divisor of 234 and 16, using Euclidean algorithm.	2
4174	Find Greatest Common Divisor of 54 and 90, by listing out the factors.	2
4175	Find Greatest Common Divisor of 294 and 654, using Euclidean algorithm.	2
4176	Find Greatest Common Divisor of 455 and 210, using Euclidean algorithm.	2
4177	Find Greatest Common Divisor of 960 and 112, using Euclidean algorithm.	2
4178	Find Greatest Common Divisor of 950 and 600, using prime factorization.	2
4179	Find Greatest Common Divisor of 75 and 100, by listing out the factors.	2
4180	Find Greatest Common Divisor of 32 and 60, using prime factorization.	2
4181	Find Greatest Common Divisor of 32 and 60, by listing out the factors.	2
4182	Find Greatest Common Divisor of 58 and 32, using prime factorization.	2
4183	Find Greatest Common Divisor of 456 and 74, using prime factorization.	2
4184	Find Greatest Common Divisor of 800, 400 and 200, using repeated division.	2
4185	Find Greatest Common Divisor of 910 and 6517, using prime factorization.	2
4186	Find Greatest Common Divisor of 5 and 92, using prime factorization.	2
4187	Find Greatest Common Divisor of 160485, 2, 127104 and 14, using prime factorization.	2
4188	Find Greatest Common Divisor of 63018702 and 11388300, using Euclidean algorithm.	2
4189	Find Greatest Common Divisor of 42 and 77, using Euclidean algorithm.	2
4190	Find Greatest Common Divisor of 44 and 36, using Euclidean algorithm.	2
4191	Find Greatest Common Divisor of 40 and 125, using prime factorization.	2
4192	Find Greatest Common Divisor of 34 and 14, using prime factorization.	2
4193	Find Greatest Common Divisor of 162 and 108, using prime factorization.	2
4194	Find Greatest Common Divisor of 24 and 20, using Euclidean algorithm.	2
4195	Find Greatest Common Divisor of 72 and 21, using prime factorization.	2
4196	Find Greatest Common Divisor of 72 and 252, using prime factorization.	2
4197	Find Greatest Common Divisor of 911 and 172, using prime factorization.	2
4198	Find Greatest Common Divisor of 604 and 138, using prime factorization.	2
4199	Find Greatest Common Divisor of 27 and 5, using prime factorization.	2
4200	Find Greatest Common Divisor of 205800 and 6468, using prime factorization.	2