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 2432 and 266, using Euclidean algorithm.	2
4252	Find Greatest Common Divisor of 2432 and 893, using Euclidean algorithm.	2
4253	Find Greatest Common Divisor of 315 and 430, using repeated division.	2
4254	Find Greatest Common Divisor of 72345 and 43215, using prime factorization.	2
4255	Find Greatest Common Divisor of 72345 and 43215, using Euclidean algorithm.	2
4256	Find Greatest Common Divisor of 300 and 18, using prime factorization.	2
4257	Find Greatest Common Divisor of 300 and 18, using Euclidean algorithm.	2
4258	Find Greatest Common Divisor of 412 and 64, using prime factorization.	2
4259	Find Greatest Common Divisor of 6828 and 447, using Euclidean algorithm.	2
4260	Find Greatest Common Divisor of 6828 and 709, using Euclidean algorithm.	2
4261	Find Greatest Common Divisor of 20 and 40, using prime factorization.	2
4262	Find Greatest Common Divisor of 39 and 40, using prime factorization.	2
4263	Find Greatest Common Divisor of 3 and 40, using prime factorization.	2
4264	Find Greatest Common Divisor of 3 and 60, using prime factorization.	2
4265	Find Greatest Common Divisor of 125 and 20, using Euclidean algorithm.	2
4266	Find Greatest Common Divisor of 10041 and 107, using Euclidean algorithm.	2
4267	Find Greatest Common Divisor of 8441 and 137, using prime factorization.	2
4268	Find Greatest Common Divisor of 8441 and 137, using Euclidean algorithm.	2
4269	Find Greatest Common Divisor of 3512 and 888, using Euclidean algorithm.	2
4270	Find Greatest Common Divisor of 3564 and 926, using prime factorization.	2
4271	Find Greatest Common Divisor of 120 and 3533, using Euclidean algorithm.	2
4272	Find Greatest Common Divisor of 6515 and 7756, using Euclidean algorithm.	2
4273	Find Greatest Common Divisor of 3510 and 99, using Euclidean algorithm.	2
4274	Find Greatest Common Divisor of 3512 and 856, using Euclidean algorithm.	2
4275	Find Greatest Common Divisor of 239 and 3731, using Euclidean algorithm.	2
4276	Find Greatest Common Divisor of 412373 and 739817, using prime factorization.	2
4277	Find Greatest Common Divisor of 113 and 110, using Euclidean algorithm.	2
4278	Find Greatest Common Divisor of 72 and 982800, using Euclidean algorithm.	2
4279	Find Greatest Common Divisor of 383 and 74, using prime factorization.	2
4280	Find Greatest Common Divisor of 17570 and 12570, using Euclidean algorithm.	2
4281	Find Greatest Common Divisor of 234 and 531, using Euclidean algorithm.	2
4282	Find Greatest Common Divisor of 43242 and 120000, using Euclidean algorithm.	2
4283	Find Greatest Common Divisor of 20 and 2, using Euclidean algorithm.	2
4284	Find Greatest Common Divisor of 20 and 3, using Euclidean algorithm.	2
4285	Find Greatest Common Divisor of 810 and 222, using repeated division.	2
4286	Find Greatest Common Divisor of 1552303 and 233927, by listing out the factors.	2
4287	Find Greatest Common Divisor of 1552303 and 233927, using repeated division.	2
4288	Find Greatest Common Divisor of 116 and 62, using Euclidean algorithm.	2
4289	Find Greatest Common Divisor of 258 and 150, using prime factorization.	2
4290	Find Greatest Common Divisor of 2452548 and 2943234, using prime factorization.	2
4291	Find Greatest Common Divisor of 2452548 and 2943234, using Euclidean algorithm.	2
4292	Find Greatest Common Divisor of 314 and 159, using prime factorization.	2
4293	Find Greatest Common Divisor of 32 and 144, using prime factorization.	2
4294	Find Greatest Common Divisor of 2565 and 99, using prime factorization.	2
4295	Find Greatest Common Divisor of 2565 and 99, using Euclidean algorithm.	2
4296	Find Greatest Common Divisor of 828 and 2332, using Euclidean algorithm.	2
4297	Find Greatest Common Divisor of 741 and 3551, using Euclidean algorithm.	2
4298	Find Greatest Common Divisor of 3572 and 288, using Euclidean algorithm.	2
4299	Find Greatest Common Divisor of 2904 and 206, using Euclidean algorithm.	2
4300	Find Greatest Common Divisor of 3584 and 368, using Euclidean algorithm.	2