GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
2851	Find Greatest Common Divisor of 35 and 81, using Euclidean algorithm.	2
2852	Find Greatest Common Divisor of 10032 and 873, using prime factorization.	2
2853	Find Greatest Common Divisor of 38603578125 and 86821875, using prime factorization.	2
2854	Find Greatest Common Divisor of 6699 and 8265, using repeated division.	2
2855	Find Greatest Common Divisor of 91 and 65, using prime factorization.	2
2856	Find Greatest Common Divisor of 66, 45 and 9, using prime factorization.	2
2857	Find Greatest Common Divisor of 50, 100 and 75, using prime factorization.	2
2858	Find Greatest Common Divisor of 5720 and 5460, using prime factorization.	2
2859	Find Greatest Common Divisor of 42 and 72, using prime factorization.	2
2860	Find Greatest Common Divisor of 123456 and 789, using repeated division.	2
2861	Find Greatest Common Divisor of 3 and 62, using prime factorization.	2
2862	Find Greatest Common Divisor of 135 and 105, using prime factorization.	2
2863	Find Greatest Common Divisor of 18, 40, 360 and 14, using prime factorization.	2
2864	Find Greatest Common Divisor of 10 and 21, using repeated division.	2
2865	Find Greatest Common Divisor of 2600 and 5500, using Euclidean algorithm.	2
2866	Find Greatest Common Divisor of 81.	2
2867	Find Greatest Common Divisor of 8130.	2
2868	Find Greatest Common Divisor of 1755 and 2475, using repeated division.	2
2869	Find Greatest Common Divisor of 6035 and 578, using Euclidean algorithm.	2
2870	Find Greatest Common Divisor of 52 and 18, using prime factorization.	2
2871	Find Greatest Common Divisor of 486 and 52, using prime factorization.	2
2872	Find Greatest Common Divisor of 1739 and 9923, using Euclidean algorithm.	2
2873	Find Greatest Common Divisor of 161 and 128, using prime factorization.	2
2874	Find Greatest Common Divisor of 21 and 92, using prime factorization.	2
2875	Find Greatest Common Divisor of 1372 and 5733, using Euclidean algorithm.	2
2876	Find Greatest Common Divisor of 445 and 556, using Euclidean algorithm.	2
2877	Find Greatest Common Divisor of 332 and 192, using Euclidean algorithm.	2
2878	Find Greatest Common Divisor of 45, 50 and 60, using prime factorization.	2
2879	Find Greatest Common Divisor of 441, 228 and 445, using prime factorization.	2
2880	Find Greatest Common Divisor of 228 and 441, using prime factorization.	2
2881	Find Greatest Common Divisor of 17.	2
2882	Find Greatest Common Divisor of 181 and 52, using prime factorization.	2
2883	Find Greatest Common Divisor of 230 and 45, using prime factorization.	2
2884	Find Greatest Common Divisor of 790 and 121, using prime factorization.	2
2885	Find Greatest Common Divisor of 48, 64 and 100, by listing out the factors.	2
2886	Find Greatest Common Divisor of 3158 and 1226, using Euclidean algorithm.	2
2887	Find Greatest Common Divisor of 11 and 39, using Euclidean algorithm.	2
2888	Find Greatest Common Divisor of 6144 and 20, using prime factorization.	2
2889	Find Greatest Common Divisor of 85672 and 242040, using Euclidean algorithm.	2
2890	Find Greatest Common Divisor of 5, 7 and 13, using prime factorization.	2
2891	Find Greatest Common Divisor of 1492 and 1066, using Euclidean algorithm.	2
2892	Find Greatest Common Divisor of 2437 and 875, using Euclidean algorithm.	2
2893	Find Greatest Common Divisor of 20 and 220, using Euclidean algorithm.	2
2894	Find Greatest Common Divisor of 10612 and 252, using prime factorization.	2
2895	Find Greatest Common Divisor of 240 and 180, using Euclidean algorithm.	2
2896	Find Greatest Common Divisor of 1170 and 100, using prime factorization.	2
2897	Find Greatest Common Divisor of 17 and 117, using prime factorization.	2
2898	Find Greatest Common Divisor of 99, 198, 288 and 512, using Euclidean algorithm.	2
2899	Find Greatest Common Divisor of 20, 40 and 80, using repeated division.	2
2900	Find Greatest Common Divisor of 7373 and 5548, using Euclidean algorithm.	2