GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4701	Find Greatest Common Divisor of 12, 116, 56 and 764, using prime factorization.	2
4702	Find Greatest Common Divisor of 13, 7 and 72, using prime factorization.	2
4703	Find Greatest Common Divisor of 123 and 48, using prime factorization.	2
4704	Find Greatest Common Divisor of 7800 and 4900, using prime factorization.	2
4705	Find Greatest Common Divisor of 240 and 150, using prime factorization.	2
4706	Find Greatest Common Divisor of 90, 36 and 72, using prime factorization.	2
4707	Find Greatest Common Divisor of 3454 and 4666, using prime factorization.	2
4708	Find Greatest Common Divisor of 15 and 100, by listing out the factors.	2
4709	Find Greatest Common Divisor of 150 and 100, using prime factorization.	2
4710	Find Greatest Common Divisor of 1981, 2 and 100, using prime factorization.	2
4711	Find Greatest Common Divisor of 24 and 90, using prime factorization.	2
4712	Find Greatest Common Divisor of 24 and 56, using prime factorization.	2
4713	Find Greatest Common Divisor of 24 and 56, using repeated division.	2
4714	Find Greatest Common Divisor of 44 and 88, using prime factorization.	2
4715	Find Greatest Common Divisor of 523 and 728, using prime factorization.	2
4716	Find Greatest Common Divisor of 11 and 2112, using prime factorization.	2
4717	Find Greatest Common Divisor of 8 and 7, using prime factorization.	2
4718	Find Greatest Common Divisor of 12 and 1, using prime factorization.	2
4719	Find Greatest Common Divisor of 113 and 2013, using Euclidean algorithm.	2
4720	Find Greatest Common Divisor of 2740 and 1760, using prime factorization.	2
4721	Find Greatest Common Divisor of 27 and 25, using repeated division.	2
4722	Find Greatest Common Divisor of 18 and 18, using prime factorization.	2
4723	Find Greatest Common Divisor of 735 and 294, using repeated division.	2
4724	Find Greatest Common Divisor of 1350, 6075, 3375 and 7425, using repeated division.	2
4725	Find Greatest Common Divisor of 24696, 5488, 8232 and 19208, using repeated division.	2
4726	Find Greatest Common Divisor of 621 and 333, using Euclidean algorithm.	2
4727	Find Greatest Common Divisor of 5700, 3192, 2128 and 3496, using repeated division.	2
4728	Find Greatest Common Divisor of 43 and 59, using prime factorization.	2
4729	Find Greatest Common Divisor of 66 and 90, using prime factorization.	2
4730	Find Greatest Common Divisor of 456 and 123, using Euclidean algorithm.	2
4731	Find Greatest Common Divisor of 199 and 98, using Euclidean algorithm.	2
4732	Find Greatest Common Divisor of 172 and 246, using prime factorization.	2
4733	Find Greatest Common Divisor of 24 and 55, using prime factorization.	2
4734	Find Greatest Common Divisor of 216 and 352, using repeated division.	2
4735	Find Greatest Common Divisor of 98 and 74, using prime factorization.	2
4736	Find Greatest Common Divisor of 64, 192 and 960, using prime factorization.	2
4737	Find Greatest Common Divisor of 425, 255 and 4131, using prime factorization.	2
4738	Find Greatest Common Divisor of 14580 and 57608, using Euclidean algorithm.	2
4739	Find Greatest Common Divisor of 180 and 162, using Euclidean algorithm.	2
4740	Find Greatest Common Divisor of 180 and 164, using Euclidean algorithm.	2
4741	Find Greatest Common Divisor of 172 and 22, using Euclidean algorithm.	2
4742	Find Greatest Common Divisor of 30 and 209, using Euclidean algorithm.	2
4743	Find Greatest Common Divisor of 100 and 96, using Euclidean algorithm.	2
4744	Find Greatest Common Divisor of 627 and 168, using Euclidean algorithm.	2
4745	Find Greatest Common Divisor of 154 and 168, using Euclidean algorithm.	2
4746	Find Greatest Common Divisor of 132 and 114, using Euclidean algorithm.	2
4747	Find Greatest Common Divisor of 240 and 204, using Euclidean algorithm.	2
4748	Find Greatest Common Divisor of 593 and 891, using prime factorization.	2
4749	Find Greatest Common Divisor of 615 and 1080, using prime factorization.	2
4750	Find Greatest Common Divisor of 615 and 1080, using Euclidean algorithm.	2