GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4201	Find Greatest Common Divisor of 60 and 136, using repeated division.	2
4202	Find Greatest Common Divisor of 14039 and 1529, using Euclidean algorithm.	2
4203	Find Greatest Common Divisor of 6773760 and 12902400, using Euclidean algorithm.	2
4204	Find Greatest Common Divisor of 40 and 158, using prime factorization.	2
4205	Find Greatest Common Divisor of 40 and 150, using prime factorization.	2
4206	Find Greatest Common Divisor of 60 and 136, using prime factorization.	2
4207	Find Greatest Common Divisor of 27972.	2
4208	Find Greatest Common Divisor of 728 and 10780, using prime factorization.	2
4209	Find Greatest Common Divisor of 3768 and 1701, using repeated division.	2
4210	Find Greatest Common Divisor of 9, 12 and 21, using Euclidean algorithm.	2
4211	Find Greatest Common Divisor of 2, 4, 6 and 10, using prime factorization.	2
4212	Find Greatest Common Divisor of 2, 4, 6 and 10, using Euclidean algorithm.	2
4213	Find Greatest Common Divisor of 21, 45, 9 and 81, using Euclidean algorithm.	2
4214	Find Greatest Common Divisor of 21, 45, 9 and 81, by listing out the factors.	2
4215	Find Greatest Common Divisor of 377 and 610, using Euclidean algorithm.	2
4216	Find Greatest Common Divisor of 123456789 and 987654321, using Euclidean algorithm.	2
4217	Find Greatest Common Divisor of 8, 12 and 24, by listing out the factors.	2
4218	Find Greatest Common Divisor of 8, 12 and 24, using Euclidean algorithm.	2
4219	Find Greatest Common Divisor of 391, 667513, 1134 and 1215, using repeated division.	2
4220	Find Greatest Common Divisor of 391 and 667, using repeated division.	2
4221	Find Greatest Common Divisor of 36, 48, 84 and 140, using prime factorization.	2
4222	Find Greatest Common Divisor of 530778276 and 999983, using Euclidean algorithm.	2
4223	Find Greatest Common Divisor of 63, 105 and 210, using repeated division.	2
4224	Find Greatest Common Divisor of 63, 105 and 210, using prime factorization.	2
4225	Find Greatest Common Divisor of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 and 17, using prime factorization.	2
4226	Find Greatest Common Divisor of 15265.	2
4227	Find Greatest Common Divisor of 33 and 150, using Euclidean algorithm.	2
4228	Find Greatest Common Divisor of 10692 and 25, using Euclidean algorithm.	2
4229	Find Greatest Common Divisor of 528 and 72, using prime factorization.	2
4230	Find Greatest Common Divisor of 456 and 72, using prime factorization.	2
4231	Find Greatest Common Divisor of 44208 and 88456, using Euclidean algorithm.	2
4232	Find Greatest Common Divisor of 530778276 and 30841329, using prime factorization.	2
4233	Find Greatest Common Divisor of 530778276 and 999983, using prime factorization.	2
4234	Find Greatest Common Divisor of 96, 84 and 60, using prime factorization.	2
4235	Find Greatest Common Divisor of 54, 72 and 90, using prime factorization.	2
4236	Find Greatest Common Divisor of 100 and 5, using repeated division.	2
4237	Find Greatest Common Divisor of 36, 54 and 120, using prime factorization.	2
4238	Find Greatest Common Divisor of 90, 126 and 210, using prime factorization.	2
4239	Find Greatest Common Divisor of 90, 126 and 210, using Euclidean algorithm.	2
4240	Find Greatest Common Divisor of 792 and 55, using Euclidean algorithm.	2
4241	Find Greatest Common Divisor of 187 and 61, using prime factorization.	2
4242	Find Greatest Common Divisor of 81 and 122, using prime factorization.	2
4243	Find Greatest Common Divisor of 15 and 72, using prime factorization.	2
4244	Find Greatest Common Divisor of 30, 45 and 75, using prime factorization.	2
4245	Find Greatest Common Divisor of 54 and 306, using prime factorization.	2
4246	Find Greatest Common Divisor of 192 and 264, using Euclidean algorithm.	2
4247	Find Greatest Common Divisor of 520 and 314, using Euclidean algorithm.	2
4248	Find Greatest Common Divisor of 731 and 952, using Euclidean algorithm.	2
4249	Find Greatest Common Divisor of 4453 and 5767, using Euclidean algorithm.	2
4250	Find Greatest Common Divisor of 138 and 24, using Euclidean algorithm.	2