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 9900, 1952303375 and 1836, by listing out the factors.	2
4252	Find Greatest Common Divisor of 140 and 56, using prime factorization.	2
4253	Find Greatest Common Divisor of 220 and 558, using prime factorization.	2
4254	Find Greatest Common Divisor of 34 and 55, using prime factorization.	2
4255	Find Greatest Common Divisor of 3915 and 825, using Euclidean algorithm.	2
4256	Find Greatest Common Divisor of 15, 25 and 5, using prime factorization.	2
4257	Find Greatest Common Divisor of 5, 15 and 23, using prime factorization.	2
4258	Find Greatest Common Divisor of 20 and 84, using prime factorization.	2
4259	Find Greatest Common Divisor of 120 and 88, using prime factorization.	2
4260	Find Greatest Common Divisor of 314 and 520, using prime factorization.	2
4261	Find Greatest Common Divisor of 315 and 55, using prime factorization.	2
4262	Find Greatest Common Divisor of 2437 and 653, using Euclidean algorithm.	2
4263	Find Greatest Common Divisor of 1024 and 18, using repeated division.	2
4264	Find Greatest Common Divisor of 1024 and 18, using Euclidean algorithm.	2
4265	Find Greatest Common Divisor of 8, 5 and 7, using prime factorization.	2
4266	Find Greatest Common Divisor of 10 and 1000, by listing out the factors.	2
4267	Find Greatest Common Divisor of 525, 619 and 1766, using prime factorization.	2
4268	Find Greatest Common Divisor of 8071 and 4655, using Euclidean algorithm.	2
4269	Find Greatest Common Divisor of 3 and 7, by listing out the factors.	2
4270	Find Greatest Common Divisor of 35 and 11, using Euclidean algorithm.	2
4271	Find Greatest Common Divisor of 19 and 192, using Euclidean algorithm.	2
4272	Find Greatest Common Divisor of 2584 and 377, using prime factorization.	2
4273	Find Greatest Common Divisor of 625 and 9, using prime factorization.	2
4274	Find Greatest Common Divisor of 352 and 31, using Euclidean algorithm.	2
4275	Find Greatest Common Divisor of 255, 165 and 195, using prime factorization.	2
4276	Find Greatest Common Divisor of 39840, 5439 and 5440, using prime factorization.	2
4277	Find Greatest Common Divisor of 14560 and 8250, using Euclidean algorithm.	2
4278	Find Greatest Common Divisor of 14973 and 4746, using Euclidean algorithm.	2
4279	Find Greatest Common Divisor of 368 and 437, using prime factorization.	2
4280	Find Greatest Common Divisor of 482 and 142, using repeated division.	2
4281	Find Greatest Common Divisor of 13572 and 4147, using Euclidean algorithm.	2
4282	Find Greatest Common Divisor of 123 and 456, using prime factorization.	2
4283	Find Greatest Common Divisor of 10, 13, 16 and 19, using prime factorization.	2
4284	Find Greatest Common Divisor of 11 and 15984, using prime factorization.	2
4285	Find Greatest Common Divisor of 117 and 189, using Euclidean algorithm.	2
4286	Find Greatest Common Divisor of 40 and 1, by listing out the factors.	2
4287	Find Greatest Common Divisor of 4999 and 1109, using repeated division.	2
4288	Find Greatest Common Divisor of 3 and 28, using prime factorization.	2
4289	Find Greatest Common Divisor of 32 and 48, using prime factorization.	2
4290	Find Greatest Common Divisor of 578 and 489, using prime factorization.	2
4291	Find Greatest Common Divisor of 578 and 489, using Euclidean algorithm.	2
4292	Find Greatest Common Divisor of 8 and 6, using Euclidean algorithm.	2
4293	Find Greatest Common Divisor of 5 and 6, using Euclidean algorithm.	2
4294	Find Greatest Common Divisor of 70 and 52, using Euclidean algorithm.	2
4295	Find Greatest Common Divisor of 48 and 72, using Euclidean algorithm.	2
4296	Find Greatest Common Divisor of 48 and 64, by listing out the factors.	2
4297	Find Greatest Common Divisor of 360 and 420, using Euclidean algorithm.	2
4298	Find Greatest Common Divisor of 864 and 924, using prime factorization.	2
4299	Find Greatest Common Divisor of 165375 and 900, using prime factorization.	2
4300	Find Greatest Common Divisor of 27 and 35, using Euclidean algorithm.	2