GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4251	Find Greatest Common Divisor of 17 and 25, using repeated division.	2
4252	Find Greatest Common Divisor of 17 and 25, by listing out the factors.	2
4253	Find Greatest Common Divisor of 21 and 44, using Euclidean algorithm.	2
4254	Find Greatest Common Divisor of 3120 and 17, using Euclidean algorithm.	2
4255	Find Greatest Common Divisor of 18 and 72, using prime factorization.	2
4256	Find Greatest Common Divisor of 29 and 72, using prime factorization.	2
4257	Find Greatest Common Divisor of 17 and 72, using prime factorization.	2
4258	Find Greatest Common Divisor of 484 and 398, using prime factorization.	2
4259	Find Greatest Common Divisor of 275 and 435, using prime factorization.	2
4260	Find Greatest Common Divisor of 2835 and 8960, using prime factorization.	2
4261	Find Greatest Common Divisor of 35 and 192, using Euclidean algorithm.	2
4262	Find Greatest Common Divisor of 1914 and 899, using prime factorization.	2
4263	Find Greatest Common Divisor of 765844 and 836, using Euclidean algorithm.	2
4264	Find Greatest Common Divisor of 76587 and 836, using Euclidean algorithm.	2
4265	Find Greatest Common Divisor of 765844 and 8365, using Euclidean algorithm.	2
4266	Find Greatest Common Divisor of 765844 and 8362, using Euclidean algorithm.	2
4267	Find Greatest Common Divisor of 2001 and 2544, using Euclidean algorithm.	2
4268	Find Greatest Common Divisor of 940 and 56, using prime factorization.	2
4269	Find Greatest Common Divisor of 940 and 56, using Euclidean algorithm.	2
4270	Find Greatest Common Divisor of 4.	2
4271	Find Greatest Common Divisor of 4.	2
4272	Find Greatest Common Divisor of 4, 34, 7, 19 and 6, using Euclidean algorithm.	2
4273	Find Greatest Common Divisor of 17 and 26, using prime factorization.	2
4274	Find Greatest Common Divisor of 750, 900 and 6, using prime factorization.	2
4275	Find Greatest Common Divisor of 750, 900 and 6, by listing out the factors.	2
4276	Find Greatest Common Divisor of 21 and 72, using Euclidean algorithm.	2
4277	Find Greatest Common Divisor of 36 and 104, using Euclidean algorithm.	2
4278	Find Greatest Common Divisor of 370 and 210, using prime factorization.	2
4279	Find Greatest Common Divisor of 1024 and 768, using Euclidean algorithm.	2
4280	Find Greatest Common Divisor of 1176.	2
4281	Find Greatest Common Divisor of 1176.	2
4282	Find Greatest Common Divisor of 36 and 104, using prime factorization.	2
4283	Find Greatest Common Divisor of 560, 224 and 336, using prime factorization.	2
4284	Find Greatest Common Divisor of 396.	2
4285	Find Greatest Common Divisor of 60 and 24, using prime factorization.	2
4286	Find Greatest Common Divisor of 160000.	2
4287	Find Greatest Common Divisor of 20.	2
4288	Find Greatest Common Divisor of 672 and 864, using prime factorization.	2
4289	Find Greatest Common Divisor of 51 and 85, using prime factorization.	2
4290	Find Greatest Common Divisor of 8, 10 and 12, using prime factorization.	2
4291	Find Greatest Common Divisor of 270 and 358, using prime factorization.	2
4292	Find Greatest Common Divisor of 259 and 222, using repeated division.	2
4293	Find Greatest Common Divisor of 159 and 53, using repeated division.	2
4294	Find Greatest Common Divisor of 429 and 468, using repeated division.	2
4295	Find Greatest Common Divisor of 366 and 305, using repeated division.	2
4296	Find Greatest Common Divisor of 294 and 441, using repeated division.	2
4297	Find Greatest Common Divisor of 108 and 24, using prime factorization.	2
4298	Find Greatest Common Divisor of 108 and 24, using repeated division.	2
4299	Find Greatest Common Divisor of 123 and 7, using Euclidean algorithm.	2
4300	Find Greatest Common Divisor of 20 and 7, using Euclidean algorithm.	2