GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3351	Find Greatest Common Divisor of 93 and 66, using Euclidean algorithm.	2
3352	Find Greatest Common Divisor of 57 and 78, using Euclidean algorithm.	2
3353	Find Greatest Common Divisor of 19 and 3, using Euclidean algorithm.	2
3354	Find Greatest Common Divisor of 13 and 93, using Euclidean algorithm.	2
3355	Find Greatest Common Divisor of 44 and 67, using Euclidean algorithm.	2
3356	Find Greatest Common Divisor of 23 and 88, using Euclidean algorithm.	2
3357	Find Greatest Common Divisor of 47 and 81, using Euclidean algorithm.	2
3358	Find Greatest Common Divisor of 64 and 2, using Euclidean algorithm.	2
3359	Find Greatest Common Divisor of 31 and 31, using Euclidean algorithm.	2
3360	Find Greatest Common Divisor of 96 and 46, using Euclidean algorithm.	2
3361	Find Greatest Common Divisor of 88 and 60, using Euclidean algorithm.	2
3362	Find Greatest Common Divisor of 81 and 2, using Euclidean algorithm.	2
3363	Find Greatest Common Divisor of 2 and 62, using Euclidean algorithm.	2
3364	Find Greatest Common Divisor of 446492299 and 186378511, using prime factorization.	2
3365	Find Greatest Common Divisor of 33 and 45, using Euclidean algorithm.	2
3366	Find Greatest Common Divisor of 44 and 95, using Euclidean algorithm.	2
3367	Find Greatest Common Divisor of 44 and 70, using Euclidean algorithm.	2
3368	Find Greatest Common Divisor of 62 and 83, using Euclidean algorithm.	2
3369	Find Greatest Common Divisor of 16 and 64, using Euclidean algorithm.	2
3370	Find Greatest Common Divisor of 17 and 8, using Euclidean algorithm.	2
3371	Find Greatest Common Divisor of 83 and 99, using Euclidean algorithm.	2
3372	Find Greatest Common Divisor of 40 and 50, using Euclidean algorithm.	2
3373	Find Greatest Common Divisor of 99 and 59, using Euclidean algorithm.	2
3374	Find Greatest Common Divisor of 92 and 27, using Euclidean algorithm.	2
3375	Find Greatest Common Divisor of 59 and 66, using Euclidean algorithm.	2
3376	Find Greatest Common Divisor of 14 and 2, using Euclidean algorithm.	2
3377	Find Greatest Common Divisor of 87 and 94, using Euclidean algorithm.	2
3378	Find Greatest Common Divisor of 97 and 63, using Euclidean algorithm.	2
3379	Find Greatest Common Divisor of 27 and 79, using Euclidean algorithm.	2
3380	Find Greatest Common Divisor of 59 and 64, using Euclidean algorithm.	2
3381	Find Greatest Common Divisor of 63 and 16, using Euclidean algorithm.	2
3382	Find Greatest Common Divisor of 39 and 15, using Euclidean algorithm.	2
3383	Find Greatest Common Divisor of 7 and 91, using Euclidean algorithm.	2
3384	Find Greatest Common Divisor of 33 and 94, using Euclidean algorithm.	2
3385	Find Greatest Common Divisor of 16 and 24, using Euclidean algorithm.	2
3386	Find Greatest Common Divisor of 858 and 325, using prime factorization.	2
3387	Find Greatest Common Divisor of 117 and 65, using Euclidean algorithm.	2
3388	Find Greatest Common Divisor of 68 and 41, using Euclidean algorithm.	2
3389	Find Greatest Common Divisor of 8 and 46, using Euclidean algorithm.	2
3390	Find Greatest Common Divisor of 44 and 75, using Euclidean algorithm.	2
3391	Find Greatest Common Divisor of 32 and 29, using Euclidean algorithm.	2
3392	Find Greatest Common Divisor of 225 and 625, using prime factorization.	2
3393	Find Greatest Common Divisor of 42, 432 and 240, using prime factorization.	2
3394	Find Greatest Common Divisor of 42, 432 and 240, using repeated division.	2
3395	Find Greatest Common Divisor of 42, 432 and 240, using Euclidean algorithm.	2
3396	Find Greatest Common Divisor of 54 and 45, using prime factorization.	2
3397	Find Greatest Common Divisor of 54 and 45, using Euclidean algorithm.	2
3398	Find Greatest Common Divisor of 8 and 40, using prime factorization.	2
3399	Find Greatest Common Divisor of 476 and 82, using repeated division.	2
3400	Find Greatest Common Divisor of 476 and 82, using Euclidean algorithm.	2