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 333 and 583, using prime factorization.	2
4102	Find Greatest Common Divisor of 333 and 583, using repeated division.	2
4103	Find Greatest Common Divisor of 37 and 3120, using Euclidean algorithm.	2
4104	Find Greatest Common Divisor of 666 and 558, using prime factorization.	2
4105	Find Greatest Common Divisor of 7, 2 and 1, using Euclidean algorithm.	2
4106	Find Greatest Common Divisor of 333 and 963, by listing out the factors.	2
4107	Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using prime factorization.	2
4108	Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, by listing out the factors.	2
4109	Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using Euclidean algorithm.	2
4110	Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using prime factorization.	2
4111	Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using repeated division.	2
4112	Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, by listing out the factors.	2
4113	Find Greatest Common Divisor of 100 and 60, using prime factorization.	2
4114	Find Greatest Common Divisor of 521 and 2071, using Euclidean algorithm.	2
4115	Find Greatest Common Divisor of 593 and 1957, using Euclidean algorithm.	2
4116	Find Greatest Common Divisor of 1404 and 455, using Euclidean algorithm.	2
4117	Find Greatest Common Divisor of 4088 and 966, using prime factorization.	2
4118	Find Greatest Common Divisor of 2024 and 572, using prime factorization.	2
4119	Find Greatest Common Divisor of 75 and 21, using Euclidean algorithm.	2
4120	Find Greatest Common Divisor of 90 and 6, using prime factorization.	2
4121	Find Greatest Common Divisor of 1, 24, 1 and 6, using prime factorization.	2
4122	Find Greatest Common Divisor of 17 and 276, using prime factorization.	2
4123	Find Greatest Common Divisor of 12, 15, 24 and 72, using repeated division.	2
4124	Find Greatest Common Divisor of 36, 72 and 108, using repeated division.	2
4125	Find Greatest Common Divisor of 159 and 45, using prime factorization.	2
4126	Find Greatest Common Divisor of 671 and 77, using Euclidean algorithm.	2
4127	Find Greatest Common Divisor of 120 and 150, using prime factorization.	2
4128	Find Greatest Common Divisor of 78 and 859, using Euclidean algorithm.	2
4129	Find Greatest Common Divisor of 25979.	2
4130	Find Greatest Common Divisor of 143 and 227, using prime factorization.	2
4131	Find Greatest Common Divisor of 143 and 227, using repeated division.	2
4132	Find Greatest Common Divisor of 108045 and 120, using prime factorization.	2
4133	Find Greatest Common Divisor of 728, 1196 and 2132, using repeated division.	2
4134	Find Greatest Common Divisor of 21, 28 and 49, by listing out the factors.	2
4135	Find Greatest Common Divisor of 18 and 201, using Euclidean algorithm.	2
4136	Find Greatest Common Divisor of 2613 and 2171, using prime factorization.	2
4137	Find Greatest Common Divisor of 0 and 10, using prime factorization.	2
4138	Find Greatest Common Divisor of 6, 45 and 108, using prime factorization.	2
4139	Find Greatest Common Divisor of 34, 15 and 132, using prime factorization.	2
4140	Find Greatest Common Divisor of 192 and 1, using prime factorization.	2
4141	Find Greatest Common Divisor of 19 and 199, using prime factorization.	2
4142	Find Greatest Common Divisor of 576, 432 and 1008, using prime factorization.	2
4143	Find Greatest Common Divisor of 294, 441 and 735, using prime factorization.	2
4144	Find Greatest Common Divisor of 117, 91 and 65, using prime factorization.	2
4145	Find Greatest Common Divisor of 450, 600 and 750, using prime factorization.	2
4146	Find Greatest Common Divisor of 242, 484 and 363, using prime factorization.	2
4147	Find Greatest Common Divisor of 80 and 144, using repeated division.	2
4148	Find Greatest Common Divisor of 85 and 6, using prime factorization.	2
4149	Find Greatest Common Divisor of 7 and 160, using prime factorization.	2
4150	Find Greatest Common Divisor of 871 and 27, using Euclidean algorithm.	2