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 864 and 924, using prime factorization.	2
4302	Find Greatest Common Divisor of 165375 and 900, using prime factorization.	2
4303	Find Greatest Common Divisor of 27 and 35, using Euclidean algorithm.	2
4304	Find Greatest Common Divisor of 1, 34, 1 and 74, using prime factorization.	2
4305	Find Greatest Common Divisor of 43336 and 332, using Euclidean algorithm.	2
4306	Find Greatest Common Divisor of 49 and 15, using Euclidean algorithm.	2
4307	Find Greatest Common Divisor of 1758 and 4345, using prime factorization.	2
4308	Find Greatest Common Divisor of 349 and 4345, using prime factorization.	2
4309	Find Greatest Common Divisor of 3584 and 798, using Euclidean algorithm.	2
4310	Find Greatest Common Divisor of 5 and 286, using prime factorization.	2
4311	Find Greatest Common Divisor of 57 and 60, using Euclidean algorithm.	2
4312	Find Greatest Common Divisor of 405 and 900, using Euclidean algorithm.	2
4313	Find Greatest Common Divisor of 1000000 and 777777, using Euclidean algorithm.	2
4314	Find Greatest Common Divisor of 18 and 25, using Euclidean algorithm.	2
4315	Find Greatest Common Divisor of 918.	2
4316	Find Greatest Common Divisor of 7 and 3, using Euclidean algorithm.	2
4317	Find Greatest Common Divisor of 6 and 29, using prime factorization.	2
4318	Find Greatest Common Divisor of 6 and 29, using Euclidean algorithm.	2
4319	Find Greatest Common Divisor of 4 and 640, using Euclidean algorithm.	2
4320	Find Greatest Common Divisor of 15 and 640, using Euclidean algorithm.	2
4321	Find Greatest Common Divisor of 7 and 640, using Euclidean algorithm.	2
4322	Find Greatest Common Divisor of 12 and 640, using Euclidean algorithm.	2
4323	Find Greatest Common Divisor of 6, 1, 1 and 0, using prime factorization.	2
4324	Find Greatest Common Divisor of 639 and 640, using Euclidean algorithm.	2
4325	Find Greatest Common Divisor of 631 and 640, using Euclidean algorithm.	2
4326	Find Greatest Common Divisor of 53 and 640, using Euclidean algorithm.	2
4327	Find Greatest Common Divisor of 287 and 41, using prime factorization.	2
4328	Find Greatest Common Divisor of 287 and 49, using prime factorization.	2
4329	Find Greatest Common Divisor of 899 and 23, using prime factorization.	2
4330	Find Greatest Common Divisor of 7469 and 2464, using prime factorization.	2
4331	Find Greatest Common Divisor of 9, 6 and 15, using repeated division.	2
4332	Find Greatest Common Divisor of 4326.	2
4333	Find Greatest Common Divisor of 204 and 1300, using prime factorization.	2
4334	Find Greatest Common Divisor of 679 and 100, using prime factorization.	2
4335	Find Greatest Common Divisor of 167 and 337, using Euclidean algorithm.	2
4336	Find Greatest Common Divisor of 13527 and 4237, using Euclidean algorithm.	2
4337	Find Greatest Common Divisor of 770 and 900, using prime factorization.	2
4338	Find Greatest Common Divisor of 11891 and 2238, using Euclidean algorithm.	2
4339	Find Greatest Common Divisor of 192 and 6, using prime factorization.	2
4340	Find Greatest Common Divisor of 0 and 317, using prime factorization.	2
4341	Find Greatest Common Divisor of 0 and 317, by listing out the factors.	2
4342	Find Greatest Common Divisor of 2026 and 1780, using Euclidean algorithm.	2
4343	Find Greatest Common Divisor of 14 and 39, using prime factorization.	2
4344	Find Greatest Common Divisor of 171 and 333, using prime factorization.	2
4345	Find Greatest Common Divisor of 175 and 273, using prime factorization.	2
4346	Find Greatest Common Divisor of 189 and 217, using prime factorization.	2
4347	Find Greatest Common Divisor of 144 and 279, using prime factorization.	2
4348	Find Greatest Common Divisor of 66 and 78, using prime factorization.	2
4349	Find Greatest Common Divisor of 240 and 336, using prime factorization.	2
4350	Find Greatest Common Divisor of 25200, 30240 and 14400, using prime factorization.	2