GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3551	Find Greatest Common Divisor of 67 and 37, using Euclidean algorithm.	1
3552	Find Greatest Common Divisor of 90, 52 and 1, by listing out the factors.	1
3553	Find Greatest Common Divisor of 28 and 54, using Euclidean algorithm.	1
3554	Find Greatest Common Divisor of 22 and 46, using Euclidean algorithm.	1
3555	Find Greatest Common Divisor of 32 and 74, using Euclidean algorithm.	1
3556	Find Greatest Common Divisor of 98 and 62, using Euclidean algorithm.	1
3557	Find Greatest Common Divisor of 82 and 60, using Euclidean algorithm.	1
3558	Find Greatest Common Divisor of 96 and 62, using Euclidean algorithm.	1
3559	Find Greatest Common Divisor of 35 and 47, using Euclidean algorithm.	1
3560	Find Greatest Common Divisor of 72 and 44, using Euclidean algorithm.	1
3561	Find Greatest Common Divisor of 16 and 23, using Euclidean algorithm.	1
3562	Find Greatest Common Divisor of 14 and 60, using Euclidean algorithm.	1
3563	Find Greatest Common Divisor of 14 and 83, using Euclidean algorithm.	1
3564	Find Greatest Common Divisor of 301981 and 449573, using repeated division.	1
3565	Find Greatest Common Divisor of 393 and 655, using prime factorization.	1
3566	Find Greatest Common Divisor of 91 and 89, using Euclidean algorithm.	1
3567	Find Greatest Common Divisor of 30 and 30, using Euclidean algorithm.	1
3568	Find Greatest Common Divisor of 95 and 43, using Euclidean algorithm.	1
3569	Find Greatest Common Divisor of 99 and 58, using Euclidean algorithm.	1
3570	Find Greatest Common Divisor of 15 and 18, using prime factorization.	1
3571	Find Greatest Common Divisor of 46 and 67, using Euclidean algorithm.	1
3572	Find Greatest Common Divisor of 85743 and 256767, using prime factorization.	1
3573	Find Greatest Common Divisor of 68 and 32, using Euclidean algorithm.	1
3574	Find Greatest Common Divisor of 39 and 81, using Euclidean algorithm.	1
3575	Find Greatest Common Divisor of 54 and 98, using Euclidean algorithm.	1
3576	Find Greatest Common Divisor of 81 and 80, using Euclidean algorithm.	1
3577	Find Greatest Common Divisor of 63 and 90, using Euclidean algorithm.	1
3578	Find Greatest Common Divisor of 3, 3 and 3, using prime factorization.	1
3579	Find Greatest Common Divisor of 297804 and 5, using Euclidean algorithm.	1
3580	Find Greatest Common Divisor of 125 and 52, using prime factorization.	1
3581	Find Greatest Common Divisor of 151 and 352, using Euclidean algorithm.	1
3582	Find Greatest Common Divisor of 7 and 352, using Euclidean algorithm.	1
3583	Find Greatest Common Divisor of 2364 and 78, using Euclidean algorithm.	1
3584	Find Greatest Common Divisor of 547 and 189, using Euclidean algorithm.	1
3585	Find Greatest Common Divisor of 999 and 19, using Euclidean algorithm.	1
3586	Find Greatest Common Divisor of 98 and 126, using Euclidean algorithm.	1
3587	Find Greatest Common Divisor of 15, 3, 10, 2, 15, 2, 2, 10 and 3, using prime factorization.	1
3588	Find Greatest Common Divisor of 1875 and 135, using prime factorization.	1
3589	Find Greatest Common Divisor of 1875 and 135, using Euclidean algorithm.	1
3590	Find Greatest Common Divisor of 14 and 77, using prime factorization.	1
3591	Find Greatest Common Divisor of 1147 and 851, using Euclidean algorithm.	1
3592	Find Greatest Common Divisor of 296 and 259, using Euclidean algorithm.	1
3593	Find Greatest Common Divisor of 512 and 10900, using prime factorization.	1
3594	Find Greatest Common Divisor of 780, 477 and 140, using prime factorization.	1
3595	Find Greatest Common Divisor of 57888 and 57899, using Euclidean algorithm.	1
3596	Find Greatest Common Divisor of 140.	1
3597	Find Greatest Common Divisor of 112 and 60, using prime factorization.	1
3598	Find Greatest Common Divisor of 280 and 60, using prime factorization.	1
3599	Find Greatest Common Divisor of 280 and 36, using prime factorization.	1
3600	Find Greatest Common Divisor of 432 and 343, using prime factorization.	1