GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3201	Find Greatest Common Divisor of 589 and 817, using prime factorization.	2
3202	Find Greatest Common Divisor of 20 and 115, using prime factorization.	2
3203	Find Greatest Common Divisor of 1001 and 11, using Euclidean algorithm.	2
3204	Find Greatest Common Divisor of 663 and 5168, using Euclidean algorithm.	2
3205	Find Greatest Common Divisor of 733103 and 91637, using Euclidean algorithm.	2
3206	Find Greatest Common Divisor of 513 and 347, using Euclidean algorithm.	2
3207	Find Greatest Common Divisor of 3 and 14, using Euclidean algorithm.	2
3208	Find Greatest Common Divisor of 44289 and 38952, using Euclidean algorithm.	2
3209	Find Greatest Common Divisor of 40, 6, 43, 5, 42, 2, 6, 6, 12, 1, 1 and 1, using prime factorization.	2
3210	Find Greatest Common Divisor of 18, 2436, 54, 90 and 126, using prime factorization.	2
3211	Find Greatest Common Divisor of 48 and 5, using prime factorization.	2
3212	Find Greatest Common Divisor of 48 and 5, using Euclidean algorithm.	2
3213	Find Greatest Common Divisor of 400.	2
3214	Find Greatest Common Divisor of 400.	2
3215	Find Greatest Common Divisor of 862.	2
3216	Find Greatest Common Divisor of 8440.	2
3217	Find Greatest Common Divisor of 13 and 120, using prime factorization.	2
3218	Find Greatest Common Divisor of 2, 5, 2, 4, 3, 2, 3, 3, 2, 5, 2, 4, 2, 3, 2, 2, 4 and 4, using prime factorization.	2
3219	Find Greatest Common Divisor of 1, 5, 3 and 10, using prime factorization.	2
3220	Find Greatest Common Divisor of 1819 and 3587, using Euclidean algorithm.	2
3221	Find Greatest Common Divisor of 2447 and 3997, using prime factorization.	2
3222	Find Greatest Common Divisor of 1010 and 407, using Euclidean algorithm.	2
3223	Find Greatest Common Divisor of 44 and 91, using Euclidean algorithm.	2
3224	Find Greatest Common Divisor of 407 and 101, using prime factorization.	2
3225	Find Greatest Common Divisor of 407 and 101, using Euclidean algorithm.	2
3226	Find Greatest Common Divisor of 407 and 1010, using Euclidean algorithm.	2
3227	Find Greatest Common Divisor of 1000 and 400, using prime factorization.	2
3228	Find Greatest Common Divisor of 1000 and 400, using Euclidean algorithm.	2
3229	Find Greatest Common Divisor of 1000 and 400, by listing out the factors.	2
3230	Find Greatest Common Divisor of 301, 981, 449 and 573, using prime factorization.	2
3231	Find Greatest Common Divisor of 12 and 16, using repeated division.	2
3232	Find Greatest Common Divisor of 45 and 95, using prime factorization.	2
3233	Find Greatest Common Divisor of 125 and 728, using repeated division.	2
3234	Find Greatest Common Divisor of 125 and 728, using Euclidean algorithm.	2
3235	Find Greatest Common Divisor of 216 and 68, using Euclidean algorithm.	2
3236	Find Greatest Common Divisor of 390 and 1261, using prime factorization.	2
3237	Find Greatest Common Divisor of 1 and 64, using prime factorization.	2
3238	Find Greatest Common Divisor of 267, 445 and 712, using prime factorization.	2
3239	Find Greatest Common Divisor of 356 and 140, using prime factorization.	2
3240	Find Greatest Common Divisor of 280 and 117, using Euclidean algorithm.	2
3241	Find Greatest Common Divisor of 10 and 11, using Euclidean algorithm.	2
3242	Find Greatest Common Divisor of 5871420 and 299, using prime factorization.	2
3243	Find Greatest Common Divisor of 330 and 1140, using prime factorization.	2
3244	Find Greatest Common Divisor of 2701 and 2737, using Euclidean algorithm.	2
3245	Find Greatest Common Divisor of 64.	2
3246	Find Greatest Common Divisor of 56, 94 and 128, using prime factorization.	2
3247	Find Greatest Common Divisor of 56, 92 and 124, using repeated division.	2
3248	Find Greatest Common Divisor of 750 and 960, using repeated division.	2
3249	Find Greatest Common Divisor of 152 and 276, using prime factorization.	2
3250	Find Greatest Common Divisor of 332 and 128, using Euclidean algorithm.	2