GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4501	Find Greatest Common Divisor of 4655 and 12075, using prime factorization.	2
4502	Find Greatest Common Divisor of 4655 and 12075, using repeated division.	2
4503	Find Greatest Common Divisor of 4, 21 and 60, using prime factorization.	2
4504	Find Greatest Common Divisor of 15 and 22, using prime factorization.	2
4505	Find Greatest Common Divisor of 20, 15 and 5, using prime factorization.	2
4506	Find Greatest Common Divisor of 3, 6 and 7, using prime factorization.	2
4507	Find Greatest Common Divisor of 345 and 369, using prime factorization.	2
4508	Find Greatest Common Divisor of 369 and 345, using repeated division.	2
4509	Find Greatest Common Divisor of 369 and 345, using Euclidean algorithm.	2
4510	Find Greatest Common Divisor of 1 and 100, using Euclidean algorithm.	2
4511	Find Greatest Common Divisor of 9, 15 and 12, using prime factorization.	2
4512	Find Greatest Common Divisor of 8217949832 and 8181353375, using prime factorization.	2
4513	Find Greatest Common Divisor of 290184 and 351, using prime factorization.	2
4514	Find Greatest Common Divisor of 1111 and 11, using Euclidean algorithm.	2
4515	Find Greatest Common Divisor of 12, 116, 56 and 764, using prime factorization.	2
4516	Find Greatest Common Divisor of 13, 7 and 72, using prime factorization.	2
4517	Find Greatest Common Divisor of 442 and 1120, using Euclidean algorithm.	2
4518	Find Greatest Common Divisor of 2 and 0, using repeated division.	2
4519	Find Greatest Common Divisor of 7 and 4, using Euclidean algorithm.	2
4520	Find Greatest Common Divisor of 79 and 41, using Euclidean algorithm.	2
4521	Find Greatest Common Divisor of 218, 908, 36, 124, 144, 180, 49, 60, 150 and 4, using prime factorization.	2
4522	Find Greatest Common Divisor of 126 and 147, by listing out the factors.	2
4523	Find Greatest Common Divisor of 6638 and 22783, using Euclidean algorithm.	2
4524	Find Greatest Common Divisor of 1001 and 910, using prime factorization.	2
4525	Find Greatest Common Divisor of 16, 24, 36 and 48, by listing out the factors.	2
4526	Find Greatest Common Divisor of 22 and 45, using repeated division.	2
4527	Find Greatest Common Divisor of 22 and 48, using repeated division.	2
4528	Find Greatest Common Divisor of 24 and 48, using Euclidean algorithm.	2
4529	Find Greatest Common Divisor of 24 and 49, by listing out the factors.	2
4530	Find Greatest Common Divisor of 65537 and 899, using prime factorization.	2
4531	Find Greatest Common Divisor of 197070 and 17739, using prime factorization.	2
4532	Find Greatest Common Divisor of 2560 and 1440, using repeated division.	2
4533	Find Greatest Common Divisor of 2560 and 1440, using Euclidean algorithm.	2
4534	Find Greatest Common Divisor of 15, 50 and 46, using prime factorization.	2
4535	Find Greatest Common Divisor of 507885 and 60808, using prime factorization.	2
4536	Find Greatest Common Divisor of 175, 225 and 350, using prime factorization.	2
4537	Find Greatest Common Divisor of 175, 225 and 350, using Euclidean algorithm.	2
4538	Find Greatest Common Divisor of 1874 and 602, using prime factorization.	2
4539	Find Greatest Common Divisor of 1874 and 602, using Euclidean algorithm.	2
4540	Find Greatest Common Divisor of 36 and 233, using Euclidean algorithm.	2
4541	Find Greatest Common Divisor of 941688 and 133980, using prime factorization.	2
4542	Find Greatest Common Divisor of 941688 and 133980, using Euclidean algorithm.	2
4543	Find Greatest Common Divisor of 40 and 3, using prime factorization.	2
4544	Find Greatest Common Divisor of 42, 105 and 91, using Euclidean algorithm.	2
4545	Find Greatest Common Divisor of 0 and 2, using prime factorization.	2
4546	Find Greatest Common Divisor of 1023 and 217, using prime factorization.	2
4547	Find Greatest Common Divisor of 3 and 12, using Euclidean algorithm.	2
4548	Find Greatest Common Divisor of 48030.	2
4549	Find Greatest Common Divisor of 48, 30 and 9, using prime factorization.	2
4550	Find Greatest Common Divisor of 5 and 8, using Euclidean algorithm.	2