GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4301	Find Greatest Common Divisor of 2316 and 243, using Euclidean algorithm.	2
4302	Find Greatest Common Divisor of 1098 and 977, using Euclidean algorithm.	2
4303	Find Greatest Common Divisor of 4924 and 203, using Euclidean algorithm.	2
4304	Find Greatest Common Divisor of 2 and 4, using Euclidean algorithm.	2
4305	Find Greatest Common Divisor of 2191 and 1351, using Euclidean algorithm.	2
4306	Find Greatest Common Divisor of 687 and 24, using prime factorization.	2
4307	Find Greatest Common Divisor of 55 and 24, using repeated division.	2
4308	Find Greatest Common Divisor of 26 and 741, using prime factorization.	2
4309	Find Greatest Common Divisor of 35 and 322, using prime factorization.	2
4310	Find Greatest Common Divisor of 25 and 818, using prime factorization.	2
4311	Find Greatest Common Divisor of 5007 and 5028, using prime factorization.	2
4312	Find Greatest Common Divisor of 575 and 9, using Euclidean algorithm.	2
4313	Find Greatest Common Divisor of 858 and 336, using Euclidean algorithm.	2
4314	Find Greatest Common Divisor of 123 and 328, using Euclidean algorithm.	2
4315	Find Greatest Common Divisor of 2059 and 581, using prime factorization.	2
4316	Find Greatest Common Divisor of 4056 and 674, using Euclidean algorithm.	2
4317	Find Greatest Common Divisor of 3 and 10, using repeated division.	2
4318	Find Greatest Common Divisor of 3 and 10, using Euclidean algorithm.	2
4319	Find Greatest Common Divisor of 4 and 12, using Euclidean algorithm.	2
4320	Find Greatest Common Divisor of 1476 and 588, using Euclidean algorithm.	2
4321	Find Greatest Common Divisor of 7939 and 437325, using prime factorization.	2
4322	Find Greatest Common Divisor of 110 and 13, using Euclidean algorithm.	2
4323	Find Greatest Common Divisor of 90, 75 and 120, using prime factorization.	2
4324	Find Greatest Common Divisor of 31250 and 26250, using Euclidean algorithm.	2
4325	Find Greatest Common Divisor of 9103 and 2365, using Euclidean algorithm.	2
4326	Find Greatest Common Divisor of 20, 60 and 80, using prime factorization.	2
4327	Find Greatest Common Divisor of 36, 48 and 96, using prime factorization.	2
4328	Find Greatest Common Divisor of 197, 33 and 78, using prime factorization.	2
4329	Find Greatest Common Divisor of 10 and 30, using prime factorization.	2
4330	Find Greatest Common Divisor of 846 and 835, using prime factorization.	2
4331	Find Greatest Common Divisor of 846, 360 and 835, using prime factorization.	2
4332	Find Greatest Common Divisor of 846 and 300600, using prime factorization.	2
4333	Find Greatest Common Divisor of 50, 180 and 168, using repeated division.	2
4334	Find Greatest Common Divisor of 272 and 192, using Euclidean algorithm.	2
4335	Find Greatest Common Divisor of 1638 and 2394, using Euclidean algorithm.	2
4336	Find Greatest Common Divisor of 2601 and 1836, using Euclidean algorithm.	2
4337	Find Greatest Common Divisor of 1728 and 3072, using Euclidean algorithm.	2
4338	Find Greatest Common Divisor of 8, 332 and 1004, using repeated division.	2
4339	Find Greatest Common Divisor of 168, 420 and 588, using repeated division.	2
4340	Find Greatest Common Divisor of 576, 672 and 1632, using repeated division.	2
4341	Find Greatest Common Divisor of 65 and 37, using Euclidean algorithm.	2
4342	Find Greatest Common Divisor of 10, 12 and 14, using prime factorization.	2
4343	Find Greatest Common Divisor of 360 and 504, using repeated division.	2
4344	Find Greatest Common Divisor of 162 and 297, using repeated division.	2
4345	Find Greatest Common Divisor of 60, 132 and 168, using repeated division.	2
4346	Find Greatest Common Divisor of 234 and 261, using repeated division.	2
4347	Find Greatest Common Divisor of 420, 560 and 630, using repeated division.	2
4348	Find Greatest Common Divisor of 1105 and 780, using Euclidean algorithm.	2
4349	Find Greatest Common Divisor of 2806 and 1702, using prime factorization.	2
4350	Find Greatest Common Divisor of 4200 and 1008, using prime factorization.	2