GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3401	Find Greatest Common Divisor of 84 and 25, using Euclidean algorithm.	2
3402	Find Greatest Common Divisor of 840, 500, 310 and 1000, using Euclidean algorithm.	2
3403	Find Greatest Common Divisor of 13 and 369, by listing out the factors.	2
3404	Find Greatest Common Divisor of 68 and 9, by listing out the factors.	2
3405	Find Greatest Common Divisor of 36 and 84, using prime factorization.	2
3406	Find Greatest Common Divisor of 36 and 84, using repeated division.	2
3407	Find Greatest Common Divisor of 143 and 187, using repeated division.	2
3408	Find Greatest Common Divisor of 56 and 96, using repeated division.	2
3409	Find Greatest Common Divisor of 144, 1008 and 432, using repeated division.	2
3410	Find Greatest Common Divisor of 838 and 17, using prime factorization.	2
3411	Find Greatest Common Divisor of 831 and 172, using prime factorization.	2
3412	Find Greatest Common Divisor of 831 and 172, using Euclidean algorithm.	2
3413	Find Greatest Common Divisor of 831 and 171, using Euclidean algorithm.	2
3414	Find Greatest Common Divisor of 750 and 46, using Euclidean algorithm.	2
3415	Find Greatest Common Divisor of 42 and 84, using repeated division.	2
3416	Find Greatest Common Divisor of 183 and 45, using Euclidean algorithm.	2
3417	Find Greatest Common Divisor of 183 and 35, using Euclidean algorithm.	2
3418	Find Greatest Common Divisor of 183 and 37, using Euclidean algorithm.	2
3419	Find Greatest Common Divisor of 183 and 64, using Euclidean algorithm.	2
3420	Find Greatest Common Divisor of 183 and 63, using Euclidean algorithm.	2
3421	Find Greatest Common Divisor of 183 and 61, using Euclidean algorithm.	2
3422	Find Greatest Common Divisor of 183 and 92, using Euclidean algorithm.	2
3423	Find Greatest Common Divisor of 183 and 27, using Euclidean algorithm.	2
3424	Find Greatest Common Divisor of 298 and 32, using Euclidean algorithm.	2
3425	Find Greatest Common Divisor of 298 and 73, using Euclidean algorithm.	2
3426	Find Greatest Common Divisor of 119 and 35, using Euclidean algorithm.	2
3427	Find Greatest Common Divisor of 109 and 61, using Euclidean algorithm.	2
3428	Find Greatest Common Divisor of 109 and 65, using Euclidean algorithm.	2
3429	Find Greatest Common Divisor of 109 and 78, using Euclidean algorithm.	2
3430	Find Greatest Common Divisor of 213 and 75, using Euclidean algorithm.	2
3431	Find Greatest Common Divisor of 213 and 74, using Euclidean algorithm.	2
3432	Find Greatest Common Divisor of 215 and 18, using Euclidean algorithm.	2
3433	Find Greatest Common Divisor of 215 and 78, using Euclidean algorithm.	2
3434	Find Greatest Common Divisor of 215 and 79, using Euclidean algorithm.	2
3435	Find Greatest Common Divisor of 215 and 89, using Euclidean algorithm.	2
3436	Find Greatest Common Divisor of 215 and 93, using Euclidean algorithm.	2
3437	Find Greatest Common Divisor of 215 and 94, using Euclidean algorithm.	2
3438	Find Greatest Common Divisor of 143 and 1941, using prime factorization.	2
3439	Find Greatest Common Divisor of 96, 60 and 144, using prime factorization.	2
3440	Find Greatest Common Divisor of 12, 42 and 36, using prime factorization.	2
3441	Find Greatest Common Divisor of 30, 36 and 24, using prime factorization.	2
3442	Find Greatest Common Divisor of 11 and 18, using prime factorization.	2
3443	Find Greatest Common Divisor of 52 and 24, using Euclidean algorithm.	2
3444	Find Greatest Common Divisor of 18 and 12345, using Euclidean algorithm.	2
3445	Find Greatest Common Divisor of 180 and 9, using prime factorization.	2
3446	Find Greatest Common Divisor of 232 and 8, using prime factorization.	2
3447	Find Greatest Common Divisor of 535 and 65, using prime factorization.	2
3448	Find Greatest Common Divisor of 36 and 12, using prime factorization.	2
3449	Find Greatest Common Divisor of 22 and 22, using prime factorization.	2
3450	Find Greatest Common Divisor of 56, 68 and 128, using prime factorization.	2