GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4151	Find Greatest Common Divisor of 2437 and 875, using Euclidean algorithm.	2
4152	Find Greatest Common Divisor of 20 and 220, using Euclidean algorithm.	2
4153	Find Greatest Common Divisor of 10612 and 252, using prime factorization.	2
4154	Find Greatest Common Divisor of 240 and 180, using Euclidean algorithm.	2
4155	Find Greatest Common Divisor of 1170 and 100, using prime factorization.	2
4156	Find Greatest Common Divisor of 17 and 117, using prime factorization.	2
4157	Find Greatest Common Divisor of 99, 198, 288 and 512, using Euclidean algorithm.	2
4158	Find Greatest Common Divisor of 20, 40 and 80, using repeated division.	2
4159	Find Greatest Common Divisor of 7373 and 5548, using Euclidean algorithm.	2
4160	Find Greatest Common Divisor of 0 and 0, using prime factorization.	2
4161	Find Greatest Common Divisor of 2465 and 5561, by listing out the factors.	2
4162	Find Greatest Common Divisor of 4, 36 and 84, using prime factorization.	2
4163	Find Greatest Common Divisor of 264 and 300, using prime factorization.	2
4164	Find Greatest Common Divisor of 360 and 1020, using prime factorization.	2
4165	Find Greatest Common Divisor of 79981981272 and 8023, using repeated division.	2
4166	Find Greatest Common Divisor of 72, 120 and 144, using prime factorization.	2
4167	Find Greatest Common Divisor of 100, 250 and 350, using repeated division.	2
4168	Find Greatest Common Divisor of 96, 144 and 19, using prime factorization.	2
4169	Find Greatest Common Divisor of 132 and 220, using repeated division.	2
4170	Find Greatest Common Divisor of 60, 60 and 60, using prime factorization.	2
4171	Find Greatest Common Divisor of 144, 192 and 48, using prime factorization.	2
4172	Find Greatest Common Divisor of 39 and 65, by listing out the factors.	2
4173	Find Greatest Common Divisor of 63 and 54, using Euclidean algorithm.	2
4174	Find Greatest Common Divisor of 36 and 60, by listing out the factors.	2
4175	Find Greatest Common Divisor of 28, 42 and 49, by listing out the factors.	2
4176	Find Greatest Common Divisor of 28, 42 and 49, using repeated division.	2
4177	Find Greatest Common Divisor of 69 and 63, using prime factorization.	2
4178	Find Greatest Common Divisor of 2, 1 and 6, using prime factorization.	2
4179	Find Greatest Common Divisor of 1, 3 and 6, using prime factorization.	2
4180	Find Greatest Common Divisor of 4 and 69, using prime factorization.	2
4181	Find Greatest Common Divisor of 60, 45 and 90, using prime factorization.	2
4182	Find Greatest Common Divisor of 60, 4, 5 and 3, using prime factorization.	2
4183	Find Greatest Common Divisor of 121 and 324, using prime factorization.	2
4184	Find Greatest Common Divisor of 2024 and 0, using prime factorization.	2
4185	Find Greatest Common Divisor of 2024 and 0, using repeated division.	2
4186	Find Greatest Common Divisor of 4001 and 2689, using prime factorization.	2
4187	Find Greatest Common Divisor of 20 and 15, using Euclidean algorithm.	2
4188	Find Greatest Common Divisor of 5 and 101, using prime factorization.	2
4189	Find Greatest Common Divisor of 5 and 101, using Euclidean algorithm.	2
4190	Find Greatest Common Divisor of 5 and 100, using Euclidean algorithm.	2
4191	Find Greatest Common Divisor of 235 and 1260, using Euclidean algorithm.	2
4192	Find Greatest Common Divisor of 144, 180 and 192, using prime factorization.	2
4193	Find Greatest Common Divisor of 48 and 68, using Euclidean algorithm.	2
4194	Find Greatest Common Divisor of 153 and 119, using repeated division.	2
4195	Find Greatest Common Divisor of 21, 32, 43, 54 and 65, using prime factorization.	2
4196	Find Greatest Common Divisor of 45 and 18, using repeated division.	2
4197	Find Greatest Common Divisor of 2 and 7, by listing out the factors.	2
4198	Find Greatest Common Divisor of 25012.	2
4199	Find Greatest Common Divisor of 25012.	2
4200	Find Greatest Common Divisor of 60 and 136, using Euclidean algorithm.	2