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 504 and 980, using prime factorization.	2
4052	Find Greatest Common Divisor of 1, 2, 3 and 4, using prime factorization.	2
4053	Find Greatest Common Divisor of 437 and 219, by listing out the factors.	2
4054	Find Greatest Common Divisor of 2, 1 and 2, using prime factorization.	2
4055	Find Greatest Common Divisor of 3375 and 1000, using repeated division.	2
4056	Find Greatest Common Divisor of 2625 and 1000, using repeated division.	2
4057	Find Greatest Common Divisor of 36, 64 and 72, using repeated division.	2
4058	Find Greatest Common Divisor of 36, 64 and 72, using prime factorization.	2
4059	Find Greatest Common Divisor of 78 and 99, using prime factorization.	2
4060	Find Greatest Common Divisor of 341 and 271, using repeated division.	2
4061	Find Greatest Common Divisor of 88 and 187, using repeated division.	2
4062	Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using prime factorization.	2
4063	Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using repeated division.	2
4064	Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, by listing out the factors.	2
4065	Find Greatest Common Divisor of 197 and 144, using Euclidean algorithm.	2
4066	Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using repeated division.	2
4067	Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using Euclidean algorithm.	2
4068	Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using Euclidean algorithm.	2
4069	Find Greatest Common Divisor of 9801 and 1452891650, using Euclidean algorithm.	2
4070	Find Greatest Common Divisor of 35 and 192, by listing out the factors.	2
4071	Find Greatest Common Divisor of 605 and 210, using Euclidean algorithm.	2
4072	Find Greatest Common Divisor of 5 and 2772, using prime factorization.	2
4073	Find Greatest Common Divisor of 9 and 40, using prime factorization.	2
4074	Find Greatest Common Divisor of 928 and 612, using prime factorization.	2
4075	Find Greatest Common Divisor of 6437 and 2393, using prime factorization.	2
4076	Find Greatest Common Divisor of 28, 38, 52, 54, 68 and 8, using prime factorization.	2
4077	Find Greatest Common Divisor of 32, 48 and 80, using prime factorization.	2
4078	Find Greatest Common Divisor of 1152 and 1728, using prime factorization.	2
4079	Find Greatest Common Divisor of 28, 38, 52, 54 and 68, using prime factorization.	2
4080	Find Greatest Common Divisor of 2000 and 1713, using Euclidean algorithm.	2
4081	Find Greatest Common Divisor of 2000 and 1713, using prime factorization.	2
4082	Find Greatest Common Divisor of 2000 and 1713, using repeated division.	2
4083	Find Greatest Common Divisor of 588 and 90, using prime factorization.	2
4084	Find Greatest Common Divisor of 588 and 90, using repeated division.	2
4085	Find Greatest Common Divisor of 1 and 8, using prime factorization.	2
4086	Find Greatest Common Divisor of 115 and 184, using Euclidean algorithm.	2
4087	Find Greatest Common Divisor of 115 and 184, by listing out the factors.	2
4088	Find Greatest Common Divisor of 8, 56 and 64, using prime factorization.	2
4089	Find Greatest Common Divisor of 91, 64 and 87, using prime factorization.	2
4090	Find Greatest Common Divisor of 38 and 52, using repeated division.	2
4091	Find Greatest Common Divisor of 28 and 52, using repeated division.	2
4092	Find Greatest Common Divisor of 52 and 54, using prime factorization.	2
4093	Find Greatest Common Divisor of 52 and 54, by listing out the factors.	2
4094	Find Greatest Common Divisor of 17 and 34, using prime factorization.	2
4095	Find Greatest Common Divisor of 17, 34, 56, 60 and 61, by listing out the factors.	2
4096	Find Greatest Common Divisor of 17 and 61, using Euclidean algorithm.	2
4097	Find Greatest Common Divisor of 17 and 60, using Euclidean algorithm.	2
4098	Find Greatest Common Divisor of 378 and 140, using Euclidean algorithm.	2
4099	Find Greatest Common Divisor of 66 and 35, using Euclidean algorithm.	2
4100	Find Greatest Common Divisor of 2282 and 420, using repeated division.	2