GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4001	Find Greatest Common Divisor of 180, 2 and 210, using prime factorization.	2
4002	Find Greatest Common Divisor of 3, 2, 2 and 2, using prime factorization.	2
4003	Find Greatest Common Divisor of 0 and 43, using prime factorization.	2
4004	Find Greatest Common Divisor of 34336550 and 120400, using Euclidean algorithm.	2
4005	Find Greatest Common Divisor of 44 and 85, using Euclidean algorithm.	2
4006	Find Greatest Common Divisor of 19 and 45, using Euclidean algorithm.	2
4007	Find Greatest Common Divisor of 43 and 41, using Euclidean algorithm.	2
4008	Find Greatest Common Divisor of 73 and 660, using Euclidean algorithm.	2
4009	Find Greatest Common Divisor of 30 and 107, using prime factorization.	2
4010	Find Greatest Common Divisor of 30 and 107, using repeated division.	2
4011	Find Greatest Common Divisor of 30 and 107, using Euclidean algorithm.	2
4012	Find Greatest Common Divisor of 3 and 448, using Euclidean algorithm.	2
4013	Find Greatest Common Divisor of 1573 and 2145, using prime factorization.	2
4014	Find Greatest Common Divisor of 65537 and 65539, using Euclidean algorithm.	2
4015	Find Greatest Common Divisor of 1188 and 385, using Euclidean algorithm.	2
4016	Find Greatest Common Divisor of 385 and 1188, using Euclidean algorithm.	2
4017	Find Greatest Common Divisor of 832 and 10933, using Euclidean algorithm.	2
4018	Find Greatest Common Divisor of 221 and 405, using prime factorization.	2
4019	Find Greatest Common Divisor of 500 and 189, using prime factorization.	2
4020	Find Greatest Common Divisor of 65537 and 296208, using prime factorization.	2
4021	Find Greatest Common Divisor of 1333 and 455, using prime factorization.	2
4022	Find Greatest Common Divisor of 9999 and 213, using prime factorization.	2
4023	Find Greatest Common Divisor of 11327 and 333, using prime factorization.	2
4024	Find Greatest Common Divisor of 200, 10, 120 and 11, using repeated division.	2
4025	Find Greatest Common Divisor of 221 and 45, using Euclidean algorithm.	2
4026	Find Greatest Common Divisor of 341 and 2, using Euclidean algorithm.	2
4027	Find Greatest Common Divisor of 197 and 7, using Euclidean algorithm.	2
4028	Find Greatest Common Divisor of 312 and 518, using Euclidean algorithm.	2
4029	Find Greatest Common Divisor of 312 and 528, using Euclidean algorithm.	2
4030	Find Greatest Common Divisor of 360 and 84, using Euclidean algorithm.	2
4031	Find Greatest Common Divisor of 982 and 224, using prime factorization.	2
4032	Find Greatest Common Divisor of 34 and 56, using Euclidean algorithm.	2
4033	Find Greatest Common Divisor of 56 and 60, using Euclidean algorithm.	2
4034	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, by listing out the factors.	2
4035	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using Euclidean algorithm.	2
4036	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using prime factorization.	2
4037	Find Greatest Common Divisor of 48 and 57, using prime factorization.	2
4038	Find Greatest Common Divisor of 48 and 57, using repeated division.	2
4039	Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using Euclidean algorithm.	2
4040	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using prime factorization.	2
4041	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, by listing out the factors.	2
4042	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using repeated division.	2
4043	Find Greatest Common Divisor of 9 and 30, using Euclidean algorithm.	2
4044	Find Greatest Common Divisor of 509, 1 and 177, using Euclidean algorithm.	2
4045	Find Greatest Common Divisor of 5 and 192, using repeated division.	2
4046	Find Greatest Common Divisor of 10 and 65, using prime factorization.	2
4047	Find Greatest Common Divisor of 78 and 66, using repeated division.	2
4048	Find Greatest Common Divisor of 78 and 66, by listing out the factors.	2
4049	Find Greatest Common Divisor of 78 and 66, using Euclidean algorithm.	2
4050	Find Greatest Common Divisor of 17 and 264, using Euclidean algorithm.	2