GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
2901	Find Greatest Common Divisor of 258 and 150, using prime factorization.	2
2902	Find Greatest Common Divisor of 2452548 and 2943234, using prime factorization.	2
2903	Find Greatest Common Divisor of 2452548 and 2943234, using Euclidean algorithm.	2
2904	Find Greatest Common Divisor of 314 and 159, using prime factorization.	2
2905	Find Greatest Common Divisor of 32 and 144, using prime factorization.	2
2906	Find Greatest Common Divisor of 2565 and 99, using prime factorization.	2
2907	Find Greatest Common Divisor of 2565 and 99, using Euclidean algorithm.	2
2908	Find Greatest Common Divisor of 828 and 2332, using Euclidean algorithm.	2
2909	Find Greatest Common Divisor of 741 and 3551, using Euclidean algorithm.	2
2910	Find Greatest Common Divisor of 3572 and 288, using Euclidean algorithm.	2
2911	Find Greatest Common Divisor of 2904 and 206, using Euclidean algorithm.	2
2912	Find Greatest Common Divisor of 3584 and 368, using Euclidean algorithm.	2
2913	Find Greatest Common Divisor of 2316 and 243, using Euclidean algorithm.	2
2914	Find Greatest Common Divisor of 1098 and 977, using Euclidean algorithm.	2
2915	Find Greatest Common Divisor of 4924 and 203, using Euclidean algorithm.	2
2916	Find Greatest Common Divisor of 2 and 4, using Euclidean algorithm.	2
2917	Find Greatest Common Divisor of 2191 and 1351, using Euclidean algorithm.	2
2918	Find Greatest Common Divisor of 687 and 24, using prime factorization.	2
2919	Find Greatest Common Divisor of 55 and 24, using repeated division.	2
2920	Find Greatest Common Divisor of 26 and 741, using prime factorization.	2
2921	Find Greatest Common Divisor of 35 and 322, using prime factorization.	2
2922	Find Greatest Common Divisor of 25 and 818, using prime factorization.	2
2923	Find Greatest Common Divisor of 5007 and 5028, using prime factorization.	2
2924	Find Greatest Common Divisor of 575 and 9, using Euclidean algorithm.	2
2925	Find Greatest Common Divisor of 858 and 336, using Euclidean algorithm.	2
2926	Find Greatest Common Divisor of 123 and 328, using Euclidean algorithm.	2
2927	Find Greatest Common Divisor of 2059 and 581, using prime factorization.	2
2928	Find Greatest Common Divisor of 4056 and 674, using Euclidean algorithm.	2
2929	Find Greatest Common Divisor of 3 and 10, using repeated division.	2
2930	Find Greatest Common Divisor of 3 and 10, using Euclidean algorithm.	2
2931	Find Greatest Common Divisor of 4 and 12, using Euclidean algorithm.	2
2932	Find Greatest Common Divisor of 1476 and 588, using Euclidean algorithm.	2
2933	Find Greatest Common Divisor of 7939 and 437325, using prime factorization.	2
2934	Find Greatest Common Divisor of 110 and 13, using Euclidean algorithm.	2
2935	Find Greatest Common Divisor of 90, 75 and 120, using prime factorization.	2
2936	Find Greatest Common Divisor of 31250 and 26250, using Euclidean algorithm.	2
2937	Find Greatest Common Divisor of 9103 and 2365, using Euclidean algorithm.	2
2938	Find Greatest Common Divisor of 20, 60 and 80, using prime factorization.	2
2939	Find Greatest Common Divisor of 36, 48 and 96, using prime factorization.	2
2940	Find Greatest Common Divisor of 197, 33 and 78, using prime factorization.	2
2941	Find Greatest Common Divisor of 10 and 30, using prime factorization.	2
2942	Find Greatest Common Divisor of 846 and 835, using prime factorization.	2
2943	Find Greatest Common Divisor of 846, 360 and 835, using prime factorization.	2
2944	Find Greatest Common Divisor of 846 and 300600, using prime factorization.	2
2945	Find Greatest Common Divisor of 50, 180 and 168, using repeated division.	2
2946	Find Greatest Common Divisor of 272 and 192, using Euclidean algorithm.	2
2947	Find Greatest Common Divisor of 1638 and 2394, using Euclidean algorithm.	2
2948	Find Greatest Common Divisor of 2601 and 1836, using Euclidean algorithm.	2
2949	Find Greatest Common Divisor of 1728 and 3072, using Euclidean algorithm.	2
2950	Find Greatest Common Divisor of 8, 332 and 1004, using repeated division.	2