GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
8201	Find Greatest Common Divisor of 12, 5, 35 and 55, using prime factorization.	1
8202	Find Greatest Common Divisor of 97 and 126, using Euclidean algorithm.	1
8203	Find Greatest Common Divisor of 2 and 3, using Euclidean algorithm.	1
8204	Find Greatest Common Divisor of 2 and 48, using Euclidean algorithm.	1
8205	Find Greatest Common Divisor of 2 and 17, using prime factorization.	1
8206	Find Greatest Common Divisor of 2 and 17, using Euclidean algorithm.	1
8207	Find Greatest Common Divisor of 144 and 233, using Euclidean algorithm.	1
8208	Find Greatest Common Divisor of 91 and 63, using Euclidean algorithm.	1
8209	Find Greatest Common Divisor of 91 and 63, using prime factorization.	1
8210	Find Greatest Common Divisor of 91 and 63, using repeated division.	1
8211	Find Greatest Common Divisor of 91 and 63, by listing out the factors.	1
8212	Find Greatest Common Divisor of 16 and 24, using repeated division.	1
8213	Find Greatest Common Divisor of 3036.	1
8214	Find Greatest Common Divisor of 32768 and 272, using Euclidean algorithm.	1
8215	Find Greatest Common Divisor of 900 and 201, using prime factorization.	1
8216	Find Greatest Common Divisor of 360 and 420, using prime factorization.	1
8217	Find Greatest Common Divisor of 675 and 99, using prime factorization.	1
8218	Find Greatest Common Divisor of 34496 and 1936, using prime factorization.	1
8219	Find Greatest Common Divisor of 999 and 998, using Euclidean algorithm.	1
8220	Find Greatest Common Divisor of 12075 and 4655, using repeated division.	1
8221	Find Greatest Common Divisor of 43336 and 332, using repeated division.	1
8222	Find Greatest Common Divisor of 14 and 17, using prime factorization.	1
8223	Find Greatest Common Divisor of 297 and 100, using Euclidean algorithm.	1
8224	Find Greatest Common Divisor of 735 and 225, using Euclidean algorithm.	1
8225	Find Greatest Common Divisor of 49 and 15, using prime factorization.	1
8226	Find Greatest Common Divisor of 42432 and 42334, using Euclidean algorithm.	1
8227	Find Greatest Common Divisor of 349 and 1758, using prime factorization.	1
8228	Find Greatest Common Divisor of 2587 and 4345, using prime factorization.	1
8229	Find Greatest Common Divisor of 756 and 2587, using prime factorization.	1
8230	Find Greatest Common Divisor of 13.	1
8231	Find Greatest Common Divisor of 234 and 156, using repeated division.	1
8232	Find Greatest Common Divisor of 960 and 9000, using prime factorization.	1
8233	Find Greatest Common Divisor of 72 and 333, using Euclidean algorithm.	1
8234	Find Greatest Common Divisor of 102 and 785, using Euclidean algorithm.	1
8235	Find Greatest Common Divisor of 96, 2, 11, 29, 39 and 49, using Euclidean algorithm.	1
8236	Find Greatest Common Divisor of 43 and 57, using Euclidean algorithm.	1
8237	Find Greatest Common Divisor of 7, 4 and 6, using prime factorization.	1
8238	Find Greatest Common Divisor of 480 and 512, using prime factorization.	1
8239	Find Greatest Common Divisor of 7 and 2, using prime factorization.	1
8240	Find Greatest Common Divisor of 40375 and 240000, using prime factorization.	1
8241	Find Greatest Common Divisor of 71250 and 240000, using prime factorization.	1
8242	Find Greatest Common Divisor of 111555 and 555111, using prime factorization.	1
8243	Find Greatest Common Divisor of 7 and 3, using prime factorization.	1
8244	Find Greatest Common Divisor of 12 and 697, using Euclidean algorithm.	1
8245	Find Greatest Common Divisor of 287 and 2009, using prime factorization.	1
8246	Find Greatest Common Divisor of 889 and 2009, using prime factorization.	1
8247	Find Greatest Common Divisor of 899 and 2009, using prime factorization.	1
8248	Find Greatest Common Divisor of 7469 and 2464, using repeated division.	1
8249	Find Greatest Common Divisor of 7469 and 2464, by listing out the factors.	1
8250	Find Greatest Common Divisor of 3234, 2541 and 6006, using prime factorization.	1