GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4101	Find Greatest Common Divisor of 65 and 50, using prime factorization.	2
4102	Find Greatest Common Divisor of 26 and 118, using Euclidean algorithm.	2
4103	Find Greatest Common Divisor of 1024 and 486, using Euclidean algorithm.	2
4104	Find Greatest Common Divisor of 486 and 18, using Euclidean algorithm.	2
4105	Find Greatest Common Divisor of 52 and 21, using Euclidean algorithm.	2
4106	Find Greatest Common Divisor of 50, 75 and 120, using prime factorization.	2
4107	Find Greatest Common Divisor of 4 and 39, using Euclidean algorithm.	2
4108	Find Greatest Common Divisor of 49 and 156, using Euclidean algorithm.	2
4109	Find Greatest Common Divisor of 35 and 81, using Euclidean algorithm.	2
4110	Find Greatest Common Divisor of 10032 and 873, using prime factorization.	2
4111	Find Greatest Common Divisor of 38603578125 and 86821875, using prime factorization.	2
4112	Find Greatest Common Divisor of 6699 and 8265, using repeated division.	2
4113	Find Greatest Common Divisor of 91 and 65, using prime factorization.	2
4114	Find Greatest Common Divisor of 72 and 96, using prime factorization.	2
4115	Find Greatest Common Divisor of 66, 45 and 9, using prime factorization.	2
4116	Find Greatest Common Divisor of 50, 100 and 75, using prime factorization.	2
4117	Find Greatest Common Divisor of 5720 and 5460, using prime factorization.	2
4118	Find Greatest Common Divisor of 42 and 72, using prime factorization.	2
4119	Find Greatest Common Divisor of 123456 and 789, using repeated division.	2
4120	Find Greatest Common Divisor of 3 and 62, using prime factorization.	2
4121	Find Greatest Common Divisor of 135 and 105, using prime factorization.	2
4122	Find Greatest Common Divisor of 18, 40, 360 and 14, using prime factorization.	2
4123	Find Greatest Common Divisor of 10 and 21, using repeated division.	2
4124	Find Greatest Common Divisor of 2600 and 5500, using Euclidean algorithm.	2
4125	Find Greatest Common Divisor of 81.	2
4126	Find Greatest Common Divisor of 8130.	2
4127	Find Greatest Common Divisor of 1755 and 2475, using repeated division.	2
4128	Find Greatest Common Divisor of 6035 and 578, using Euclidean algorithm.	2
4129	Find Greatest Common Divisor of 52 and 18, using prime factorization.	2
4130	Find Greatest Common Divisor of 486 and 52, using prime factorization.	2
4131	Find Greatest Common Divisor of 1739 and 9923, using Euclidean algorithm.	2
4132	Find Greatest Common Divisor of 161 and 128, using prime factorization.	2
4133	Find Greatest Common Divisor of 21 and 92, using prime factorization.	2
4134	Find Greatest Common Divisor of 1372 and 5733, using Euclidean algorithm.	2
4135	Find Greatest Common Divisor of 445 and 556, using Euclidean algorithm.	2
4136	Find Greatest Common Divisor of 332 and 192, using Euclidean algorithm.	2
4137	Find Greatest Common Divisor of 45, 50 and 60, using prime factorization.	2
4138	Find Greatest Common Divisor of 441, 228 and 445, using prime factorization.	2
4139	Find Greatest Common Divisor of 228 and 441, using prime factorization.	2
4140	Find Greatest Common Divisor of 17.	2
4141	Find Greatest Common Divisor of 181 and 52, using prime factorization.	2
4142	Find Greatest Common Divisor of 230 and 45, using prime factorization.	2
4143	Find Greatest Common Divisor of 790 and 121, using prime factorization.	2
4144	Find Greatest Common Divisor of 48, 64 and 100, by listing out the factors.	2
4145	Find Greatest Common Divisor of 3158 and 1226, using Euclidean algorithm.	2
4146	Find Greatest Common Divisor of 11 and 39, using Euclidean algorithm.	2
4147	Find Greatest Common Divisor of 6144 and 20, using prime factorization.	2
4148	Find Greatest Common Divisor of 85672 and 242040, using Euclidean algorithm.	2
4149	Find Greatest Common Divisor of 5, 7 and 13, using prime factorization.	2
4150	Find Greatest Common Divisor of 1492 and 1066, using Euclidean algorithm.	2