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 13 and 131302, using Euclidean algorithm.	1
3552	Find Greatest Common Divisor of 5742 and 5, using Euclidean algorithm.	1
3553	Find Greatest Common Divisor of 623.	1
3554	Find Greatest Common Divisor of 612 and 129, using prime factorization.	1
3555	Find Greatest Common Divisor of 19 and 160, using repeated division.	1
3556	Find Greatest Common Divisor of 73 and 24, using prime factorization.	1
3557	Find Greatest Common Divisor of 56, 112 and 224, using prime factorization.	1
3558	Find Greatest Common Divisor of 106, 212 and 400, using prime factorization.	1
3559	Find Greatest Common Divisor of 102 and 202, using prime factorization.	1
3560	Find Greatest Common Divisor of 84 and 1200, using prime factorization.	1
3561	Find Greatest Common Divisor of 2, 3, 5, 7, 11, 2, 4, 3, 9, 11, 17 and 14, using prime factorization.	1
3562	Find Greatest Common Divisor of 160 and 19, using Euclidean algorithm.	1
3563	Find Greatest Common Divisor of 195 and 65, using Euclidean algorithm.	1
3564	Find Greatest Common Divisor of 1111968 and 2963520, using prime factorization.	1
3565	Find Greatest Common Divisor of 8448 and 13, using Euclidean algorithm.	1
3566	Find Greatest Common Divisor of 2 and 1680, using prime factorization.	1
3567	Find Greatest Common Divisor of 3 and 1680, using prime factorization.	1
3568	Find Greatest Common Divisor of 5 and 1680, using prime factorization.	1
3569	Find Greatest Common Divisor of 13 and 1680, using prime factorization.	1
3570	Find Greatest Common Divisor of 5 and 3016, using prime factorization.	1
3571	Find Greatest Common Divisor of 129 and 236, using Euclidean algorithm.	1
3572	Find Greatest Common Divisor of 512, 518 and 1064, using Euclidean algorithm.	1
3573	Find Greatest Common Divisor of 85 and 425, by listing out the factors.	1
3574	Find Greatest Common Divisor of 947 and 85, using prime factorization.	1
3575	Find Greatest Common Divisor of 947 and 85, using Euclidean algorithm.	1
3576	Find Greatest Common Divisor of 175.	1
3577	Find Greatest Common Divisor of 3094 and 819, using Euclidean algorithm.	1
3578	Find Greatest Common Divisor of 37 and 160, using prime factorization.	1
3579	Find Greatest Common Divisor of 2, 510, 2 and 207, using Euclidean algorithm.	1
3580	Find Greatest Common Divisor of 8, 7 and 8, using prime factorization.	1
3581	Find Greatest Common Divisor of 48 and 18, using prime factorization.	1
3582	Find Greatest Common Divisor of 7 and 20, using Euclidean algorithm.	1
3583	Find Greatest Common Divisor of 36, 54 and 90, using repeated division.	1
3584	Find Greatest Common Divisor of 36 and 54, using repeated division.	1
3585	Find Greatest Common Divisor of 145, 15 and 5, using prime factorization.	1
3586	Find Greatest Common Divisor of 145, 15 and 5, using repeated division.	1
3587	Find Greatest Common Divisor of 7 and 1, using Euclidean algorithm.	1
3588	Find Greatest Common Divisor of 101 and 100, using Euclidean algorithm.	1
3589	Find Greatest Common Divisor of 43 and 33, using prime factorization.	1
3590	Find Greatest Common Divisor of 13113 and 1410, using Euclidean algorithm.	1
3591	Find Greatest Common Divisor of 115, 230 and 345, using Euclidean algorithm.	1
3592	Find Greatest Common Divisor of 1949 and 2436, using Euclidean algorithm.	1
3593	Find Greatest Common Divisor of 24 and 576, using prime factorization.	1
3594	Find Greatest Common Divisor of 380 and 171, by listing out the factors.	1
3595	Find Greatest Common Divisor of 155 and 52, using Euclidean algorithm.	1
3596	Find Greatest Common Divisor of 39 and 56, using repeated division.	1
3597	Find Greatest Common Divisor of 39 and 56, using prime factorization.	1
3598	Find Greatest Common Divisor of 7255 and 2000, using Euclidean algorithm.	1
3599	Find Greatest Common Divisor of 130 and 221, using Euclidean algorithm.	1
3600	Find Greatest Common Divisor of 1461 and 117, using Euclidean algorithm.	1