GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4401	Find Greatest Common Divisor of 1, 2 and 24, using prime factorization.	2
4402	Find Greatest Common Divisor of 229 and 66, using prime factorization.	2
4403	Find Greatest Common Divisor of 36 and 539, using prime factorization.	2
4404	Find Greatest Common Divisor of 259 and 621, using prime factorization.	2
4405	Find Greatest Common Divisor of 259 and 621, using Euclidean algorithm.	2
4406	Find Greatest Common Divisor of 108 and 156, using Euclidean algorithm.	2
4407	Find Greatest Common Divisor of 107 and 211, using Euclidean algorithm.	2
4408	Find Greatest Common Divisor of 397 and 450, using prime factorization.	2
4409	Find Greatest Common Divisor of 397 and 450, using Euclidean algorithm.	2
4410	Find Greatest Common Divisor of 1111 and 1111, using prime factorization.	2
4411	Find Greatest Common Divisor of 228 and 28, using prime factorization.	2
4412	Find Greatest Common Divisor of 35.	2
4413	Find Greatest Common Divisor of 2015 and 2018, using prime factorization.	2
4414	Find Greatest Common Divisor of 36 and 45, using prime factorization.	2
4415	Find Greatest Common Divisor of 16, 20 and 12, using prime factorization.	2
4416	Find Greatest Common Divisor of 972 and 2250, using prime factorization.	2
4417	Find Greatest Common Divisor of 18, 20 and 26, using prime factorization.	2
4418	Find Greatest Common Divisor of 18, 20 and 16, using prime factorization.	2
4419	Find Greatest Common Divisor of 32, 48 and 44, using prime factorization.	2
4420	Find Greatest Common Divisor of 34 and 68, using prime factorization.	2
4421	Find Greatest Common Divisor of 2771 and 206, using prime factorization.	2
4422	Find Greatest Common Divisor of 1, 8, 0, 36, 0 and 9, using prime factorization.	2
4423	Find Greatest Common Divisor of 12, 14, 34, 41, 47 and 34, using prime factorization.	2
4424	Find Greatest Common Divisor of 11 and 3, using Euclidean algorithm.	2
4425	Find Greatest Common Divisor of 1100 and 57330, using Euclidean algorithm.	2
4426	Find Greatest Common Divisor of 4113.	2
4427	Find Greatest Common Divisor of 117 and 4113, using prime factorization.	2
4428	Find Greatest Common Divisor of 457 and 13, using prime factorization.	2
4429	Find Greatest Common Divisor of 457 and 3250, using prime factorization.	2
4430	Find Greatest Common Divisor of 8, 12 and 30, using prime factorization.	2
4431	Find Greatest Common Divisor of 18, 16, 54 and 36, using prime factorization.	2
4432	Find Greatest Common Divisor of 14, 27 and 55, using prime factorization.	2
4433	Find Greatest Common Divisor of 20 and 9, using repeated division.	2
4434	Find Greatest Common Divisor of 260 and 628, using prime factorization.	2
4435	Find Greatest Common Divisor of 27 and 8, using prime factorization.	2
4436	Find Greatest Common Divisor of 406 and 945, using prime factorization.	2
4437	Find Greatest Common Divisor of 405 and 945, using prime factorization.	2
4438	Find Greatest Common Divisor of 132 and 630, using Euclidean algorithm.	2
4439	Find Greatest Common Divisor of 66 and 150, using repeated division.	2
4440	Find Greatest Common Divisor of 170 and 122, using repeated division.	2
4441	Find Greatest Common Divisor of 170 and 122, by listing out the factors.	2
4442	Find Greatest Common Divisor of 792 and 275, using prime factorization.	2
4443	Find Greatest Common Divisor of 39 and 2535, using prime factorization.	2
4444	Find Greatest Common Divisor of 54 and 888, using Euclidean algorithm.	2
4445	Find Greatest Common Divisor of 25 and 29, using prime factorization.	2
4446	Find Greatest Common Divisor of 5245 and 930, using prime factorization.	2
4447	Find Greatest Common Divisor of 4076 and 2076, using prime factorization.	2
4448	Find Greatest Common Divisor of 457 and 378, using prime factorization.	2
4449	Find Greatest Common Divisor of 780 and 224, using repeated division.	2
4450	Find Greatest Common Divisor of 25, 30 and 40, using Euclidean algorithm.	2