GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3101	Find Greatest Common Divisor of 11 and 15, using prime factorization.	2
3102	Find Greatest Common Divisor of 14300 and 5915, using prime factorization.	2
3103	Find Greatest Common Divisor of 264 and 90, using prime factorization.	2
3104	Find Greatest Common Divisor of 25 and 150, using Euclidean algorithm.	2
3105	Find Greatest Common Divisor of 720 and 17, using prime factorization.	2
3106	Find Greatest Common Divisor of 720 and 17, using repeated division.	2
3107	Find Greatest Common Divisor of 13, 650 and 100, using prime factorization.	2
3108	Find Greatest Common Divisor of 3712 and 1472, using prime factorization.	2
3109	Find Greatest Common Divisor of 2 and 5, by listing out the factors.	2
3110	Find Greatest Common Divisor of 15 and 4, using Euclidean algorithm.	2
3111	Find Greatest Common Divisor of 98 and 49, using prime factorization.	2
3112	Find Greatest Common Divisor of 60 and 48, using prime factorization.	2
3113	Find Greatest Common Divisor of 3, 6 and 2, using prime factorization.	2
3114	Find Greatest Common Divisor of 270 and 450, using repeated division.	2
3115	Find Greatest Common Divisor of 850 and 35, using repeated division.	2
3116	Find Greatest Common Divisor of 17 and 60, by listing out the factors.	2
3117	Find Greatest Common Divisor of 168 and 378, using prime factorization.	2
3118	Find Greatest Common Divisor of 105 and 14, by listing out the factors.	2
3119	Find Greatest Common Divisor of 3962 and 1589, using Euclidean algorithm.	2
3120	Find Greatest Common Divisor of 3962 and 1859, using Euclidean algorithm.	2
3121	Find Greatest Common Divisor of 1 and 2, using repeated division.	2
3122	Find Greatest Common Divisor of 60 and 120, using repeated division.	2
3123	Find Greatest Common Divisor of 45, 80, 60, 35 and 20, using prime factorization.	2
3124	Find Greatest Common Divisor of 1071 and 482, using Euclidean algorithm.	2
3125	Find Greatest Common Divisor of 5445 and 2550, using Euclidean algorithm.	2
3126	Find Greatest Common Divisor of 3911 and 2999, using Euclidean algorithm.	2
3127	Find Greatest Common Divisor of 10256 and 5420, using Euclidean algorithm.	2
3128	Find Greatest Common Divisor of 1021 and 993121, using prime factorization.	2
3129	Find Greatest Common Divisor of 40 and 18, using prime factorization.	2
3130	Find Greatest Common Divisor of 9 and 49, using prime factorization.	2
3131	Find Greatest Common Divisor of 1236 and 30, by listing out the factors.	2
3132	Find Greatest Common Divisor of 40, 20 and 30, using repeated division.	2
3133	Find Greatest Common Divisor of 33 and 185, using prime factorization.	2
3134	Find Greatest Common Divisor of 825, 1245 and 0, using prime factorization.	2
3135		2
3136	Find Greatest Common Divisor of 1190 and 1445, using prime factorization.	2
3137	Find Greatest Common Divisor of 78 and 117, using repeated division.	2
3138	Find Greatest Common Divisor of 225 and 90, using Euclidean algorithm.	2
3139	Find Greatest Common Divisor of 1340 and 1340, using prime factorization.	2
3140	Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm.	2
3141	Find Greatest Common Divisor of 84 and 96, using prime factorization.	2
3142	Find Greatest Common Divisor of 165, 45 and 5, using prime factorization.	2
3143	Find Greatest Common Divisor of 5 and 288, using prime factorization.	2
3144	Find Greatest Common Divisor of 250 and 134, using prime factorization.	2
3145	Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using Euclidean algorithm.	2
3146	Find Greatest Common Divisor of 889 and 246, using Euclidean algorithm.	2
3147	Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm.	2
3148	Find Greatest Common Divisor of 357 and 476, using prime factorization.	2
3149	Find Greatest Common Divisor of 585 and 169, using Euclidean algorithm.	2
3150	Find Greatest Common Divisor of 12 and 24, using Euclidean algorithm.	2