GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4351	Find Greatest Common Divisor of 345 and 912, using Euclidean algorithm.	2
4352	Find Greatest Common Divisor of 392 and 23, using Euclidean algorithm.	2
4353	Find Greatest Common Divisor of 3921 and 23, using Euclidean algorithm.	2
4354	Find Greatest Common Divisor of 3921 and 238, using Euclidean algorithm.	2
4355	Find Greatest Common Divisor of 3921 and 538, using Euclidean algorithm.	2
4356	Find Greatest Common Divisor of 3621 and 938, using Euclidean algorithm.	2
4357	Find Greatest Common Divisor of 3621 and 1938, using Euclidean algorithm.	2
4358	Find Greatest Common Divisor of 623 and 51, using Euclidean algorithm.	2
4359	Find Greatest Common Divisor of 623 and 59, using Euclidean algorithm.	2
4360	Find Greatest Common Divisor of 623 and 98, using Euclidean algorithm.	2
4361	Find Greatest Common Divisor of 317.	2
4362	Find Greatest Common Divisor of 36 and 56, using repeated division.	2
4363	Find Greatest Common Divisor of 34 and 62, using repeated division.	2
4364	Find Greatest Common Divisor of 34 and 66, using repeated division.	2
4365	Find Greatest Common Divisor of 34 and 70, using repeated division.	2
4366	Find Greatest Common Divisor of 34 and 700, using repeated division.	2
4367	Find Greatest Common Divisor of 34 and 708, using repeated division.	2
4368	Find Greatest Common Divisor of 34 and 718, using repeated division.	2
4369	Find Greatest Common Divisor of 54 and 36, using repeated division.	2
4370	Find Greatest Common Divisor of 54 and 36, using Euclidean algorithm.	2
4371	Find Greatest Common Divisor of 56 and 36, using Euclidean algorithm.	2
4372	Find Greatest Common Divisor of 30690 and 93093, using prime factorization.	2
4373	Find Greatest Common Divisor of 30690 and 93093, using Euclidean algorithm.	2
4374	Find Greatest Common Divisor of 378 and 858, using prime factorization.	2
4375	Find Greatest Common Divisor of 36 and 248, using Euclidean algorithm.	2
4376	Find Greatest Common Divisor of 5, 17, 23, 14 and 83, using prime factorization.	2
4377	Find Greatest Common Divisor of 5, 17, 23, 14 and 83, using Euclidean algorithm.	2
4378	Find Greatest Common Divisor of 3991 and 285, using prime factorization.	2
4379	Find Greatest Common Divisor of 3991 and 285, using Euclidean algorithm.	2
4380	Find Greatest Common Divisor of 3991 and 328, using Euclidean algorithm.	2
4381	Find Greatest Common Divisor of 9 and 512, using prime factorization.	2
4382	Find Greatest Common Divisor of 169 and 6, using Euclidean algorithm.	2
4383	Find Greatest Common Divisor of 223 and 11, using Euclidean algorithm.	2
4384	Find Greatest Common Divisor of 52 and 30, using Euclidean algorithm.	2
4385	Find Greatest Common Divisor of 1625 and 975, using repeated division.	2
4386	Find Greatest Common Divisor of 1625 and 975, using prime factorization.	2
4387	Find Greatest Common Divisor of 3 and 40, using Euclidean algorithm.	2
4388	Find Greatest Common Divisor of 74, 89 and 96, using prime factorization.	2
4389	Find Greatest Common Divisor of 21 and 7, using Euclidean algorithm.	2
4390	Find Greatest Common Divisor of 299 and 3, using prime factorization.	2
4391	Find Greatest Common Divisor of 3 and 99, using prime factorization.	2
4392	Find Greatest Common Divisor of 16 and 112, using repeated division.	2
4393	Find Greatest Common Divisor of 25, 30 and 35, using repeated division.	2
4394	Find Greatest Common Divisor of 16, 20 and 28, using repeated division.	2
4395	Find Greatest Common Divisor of 20, 30, 36 and 45, using repeated division.	2
4396	Find Greatest Common Divisor of 24 and 138, using prime factorization.	2
4397	Find Greatest Common Divisor of 902 and 412, using Euclidean algorithm.	2
4398	Find Greatest Common Divisor of 405 and 1372, using prime factorization.	2
4399	Find Greatest Common Divisor of 2 and 26, using prime factorization.	2
4400	Find Greatest Common Divisor of 1251096 and 29249, using Euclidean algorithm.	2