GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3801	Find Greatest Common Divisor of 1552303 and 233927, using repeated division.	2
3802	Find Greatest Common Divisor of 116 and 62, using Euclidean algorithm.	2
3803	Find Greatest Common Divisor of 258 and 150, using prime factorization.	2
3804	Find Greatest Common Divisor of 2452548 and 2943234, using prime factorization.	2
3805	Find Greatest Common Divisor of 2452548 and 2943234, using Euclidean algorithm.	2
3806	Find Greatest Common Divisor of 314 and 159, using prime factorization.	2
3807	Find Greatest Common Divisor of 32 and 144, using prime factorization.	2
3808	Find Greatest Common Divisor of 2565 and 99, using prime factorization.	2
3809	Find Greatest Common Divisor of 2565 and 99, using Euclidean algorithm.	2
3810	Find Greatest Common Divisor of 828 and 2332, using Euclidean algorithm.	2
3811	Find Greatest Common Divisor of 741 and 3551, using Euclidean algorithm.	2
3812	Find Greatest Common Divisor of 3572 and 288, using Euclidean algorithm.	2
3813	Find Greatest Common Divisor of 2904 and 206, using Euclidean algorithm.	2
3814	Find Greatest Common Divisor of 3584 and 368, using Euclidean algorithm.	2
3815	Find Greatest Common Divisor of 2316 and 243, using Euclidean algorithm.	2
3816	Find Greatest Common Divisor of 1098 and 977, using Euclidean algorithm.	2
3817	Find Greatest Common Divisor of 4924 and 203, using Euclidean algorithm.	2
3818	Find Greatest Common Divisor of 2 and 4, using Euclidean algorithm.	2
3819	Find Greatest Common Divisor of 2191 and 1351, using Euclidean algorithm.	2
3820	Find Greatest Common Divisor of 687 and 24, using prime factorization.	2
3821	Find Greatest Common Divisor of 55 and 24, using repeated division.	2
3822	Find Greatest Common Divisor of 26 and 741, using prime factorization.	2
3823	Find Greatest Common Divisor of 35 and 322, using prime factorization.	2
3824	Find Greatest Common Divisor of 25 and 818, using prime factorization.	2
3825	Find Greatest Common Divisor of 5007 and 5028, using prime factorization.	2
3826	Find Greatest Common Divisor of 575 and 9, using Euclidean algorithm.	2
3827	Find Greatest Common Divisor of 858 and 336, using Euclidean algorithm.	2
3828	Find Greatest Common Divisor of 123 and 328, using Euclidean algorithm.	2
3829	Find Greatest Common Divisor of 2059 and 581, using prime factorization.	2
3830	Find Greatest Common Divisor of 4056 and 674, using Euclidean algorithm.	2
3831	Find Greatest Common Divisor of 3 and 10, using repeated division.	2
3832	Find Greatest Common Divisor of 3 and 10, using Euclidean algorithm.	2
3833	Find Greatest Common Divisor of 4 and 12, using Euclidean algorithm.	2
3834	Find Greatest Common Divisor of 1476 and 588, using Euclidean algorithm.	2
3835	Find Greatest Common Divisor of 7939 and 437325, using prime factorization.	2
3836	Find Greatest Common Divisor of 110 and 13, using Euclidean algorithm.	2
3837	Find Greatest Common Divisor of 90, 75 and 120, using prime factorization.	2
3838	Find Greatest Common Divisor of 31250 and 26250, using Euclidean algorithm.	2
3839	Find Greatest Common Divisor of 9103 and 2365, using Euclidean algorithm.	2
3840	Find Greatest Common Divisor of 20, 60 and 80, using prime factorization.	2
3841	Find Greatest Common Divisor of 36, 48 and 96, using prime factorization.	2
3842	Find Greatest Common Divisor of 197, 33 and 78, using prime factorization.	2
3843	Find Greatest Common Divisor of 10 and 30, using prime factorization.	2
3844	Find Greatest Common Divisor of 846 and 835, using prime factorization.	2
3845	Find Greatest Common Divisor of 846, 360 and 835, using prime factorization.	2
3846	Find Greatest Common Divisor of 846 and 300600, using prime factorization.	2
3847	Find Greatest Common Divisor of 50, 180 and 168, using repeated division.	2
3848	Find Greatest Common Divisor of 272 and 192, using Euclidean algorithm.	2
3849	Find Greatest Common Divisor of 1638 and 2394, using Euclidean algorithm.	2
3850	Find Greatest Common Divisor of 2601 and 1836, using Euclidean algorithm.	2