GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4051	Find Greatest Common Divisor of 34 and 52, using prime factorization.	2
4052	Find Greatest Common Divisor of 34 and 52, using Euclidean algorithm.	2
4053	Find Greatest Common Divisor of 1 and 3, using Euclidean algorithm.	2
4054	Find Greatest Common Divisor of 828 and 945, using Euclidean algorithm.	2
4055	Find Greatest Common Divisor of 8, 13, 39, 42 and 48, using prime factorization.	2
4056	Find Greatest Common Divisor of 8, 13, 39, 42, 48 and 11, by listing out the factors.	2
4057	Find Greatest Common Divisor of 8, 13, 39, 42, 48 and 11, using prime factorization.	2
4058	Find Greatest Common Divisor of 23 and 177, using prime factorization.	2
4059	Find Greatest Common Divisor of 144 and 105, using prime factorization.	2
4060	Find Greatest Common Divisor of 3 and 105, using prime factorization.	2
4061	Find Greatest Common Divisor of 484 and 561, using Euclidean algorithm.	2
4062	Find Greatest Common Divisor of 16128, 27216 and 25200, using prime factorization.	2
4063	Find Greatest Common Divisor of 9, 5 and 43, using prime factorization.	2
4064	Find Greatest Common Divisor of 1, 12, 9 and 14, using prime factorization.	2
4065	Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, using prime factorization.	2
4066	Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, by listing out the factors.	2
4067	Find Greatest Common Divisor of 233 and 5880420, using prime factorization.	2
4068	Find Greatest Common Divisor of 5 and 72, using prime factorization.	2
4069	Find Greatest Common Divisor of 16 and 209, using prime factorization.	2
4070	Find Greatest Common Divisor of 451 and 209, using prime factorization.	2
4071	Find Greatest Common Divisor of 1369 and 2597, using prime factorization.	2
4072	Find Greatest Common Divisor of 2689 and 1369, using Euclidean algorithm.	2
4073	Find Greatest Common Divisor of 272 and 1479, by listing out the factors.	2
4074	Find Greatest Common Divisor of 1 and 10, using Euclidean algorithm.	2
4075	Find Greatest Common Divisor of 24 and 30, using Euclidean algorithm.	2
4076	Find Greatest Common Divisor of 7, 12 and 14, using prime factorization.	2
4077	Find Greatest Common Divisor of 7, 12 and 14, using repeated division.	2
4078	Find Greatest Common Divisor of 203 and 833, using Euclidean algorithm.	2
4079	Find Greatest Common Divisor of 36, 87, 90 and 120, using prime factorization.	2
4080	Find Greatest Common Divisor of 900, 216, 36, 120, 144, 108, 49, 60, 150 and 25, using prime factorization.	2
4081	Find Greatest Common Divisor of 10 and 14, using Euclidean algorithm.	2
4082	Find Greatest Common Divisor of 34 and 23, using prime factorization.	2
4083	Find Greatest Common Divisor of 1126 and 884, using prime factorization.	2
4084	Find Greatest Common Divisor of 64 and 80, using prime factorization.	2
4085	Find Greatest Common Divisor of 110 and 88, using prime factorization.	2
4086	Find Greatest Common Divisor of 204 and 255, using prime factorization.	2
4087	Find Greatest Common Divisor of 0, 132 and 763, using prime factorization.	2
4088	Find Greatest Common Divisor of 10 and 18, using repeated division.	2
4089	Find Greatest Common Divisor of 40902 and 24140, using prime factorization.	2
4090	Find Greatest Common Divisor of 35 and 67, using Euclidean algorithm.	2
4091	Find Greatest Common Divisor of 5 and 11, using Euclidean algorithm.	2
4092	Find Greatest Common Divisor of 48, 72, 108, 120, 144, 180, 192, 216, 240 and 300, using prime factorization.	2
4093	Find Greatest Common Divisor of 120 and 84, using Euclidean algorithm.	2
4094	Find Greatest Common Divisor of 285 and 741, using Euclidean algorithm.	2
4095	Find Greatest Common Divisor of 21, 42 and 84, using repeated division.	2
4096	Find Greatest Common Divisor of 32 and 108, using prime factorization.	2
4097	Find Greatest Common Divisor of 93 and 55, using prime factorization.	2
4098	Find Greatest Common Divisor of 24 and 13, using prime factorization.	2
4099	Find Greatest Common Divisor of 2223 and 912, using Euclidean algorithm.	2
4100	Find Greatest Common Divisor of 49 and 33, using Euclidean algorithm.	2