GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
2951	Find Greatest Common Divisor of 860 and 240, using Euclidean algorithm.	2
2952	Find Greatest Common Divisor of 23 and 67, using prime factorization.	2
2953	Find Greatest Common Divisor of 180 and 192, using repeated division.	2
2954	Find Greatest Common Divisor of 180 and 192, using Euclidean algorithm.	2
2955	Find Greatest Common Divisor of 180 and 192, by listing out the factors.	2
2956	Find Greatest Common Divisor of 11 and 24, using Euclidean algorithm.	2
2957	Find Greatest Common Divisor of 9, 2, 2, 9, 2 and 2, using Euclidean algorithm.	2
2958	Find Greatest Common Divisor of 465 and 3861, using prime factorization.	2
2959	Find Greatest Common Divisor of 19950 and 14950, using Euclidean algorithm.	2
2960	Find Greatest Common Divisor of 15130 and 10130, using Euclidean algorithm.	2
2961	Find Greatest Common Divisor of 17590 and 12590, using Euclidean algorithm.	2
2962	Find Greatest Common Divisor of 17630 and 12630, using Euclidean algorithm.	2
2963	Find Greatest Common Divisor of 17650 and 12650, using Euclidean algorithm.	2
2964	Find Greatest Common Divisor of 17670 and 12670, using Euclidean algorithm.	2
2965	Find Greatest Common Divisor of 15530 and 10530, using Euclidean algorithm.	2
2966	Find Greatest Common Divisor of 15610 and 10610, using Euclidean algorithm.	2
2967	Find Greatest Common Divisor of 15710 and 10710, using Euclidean algorithm.	2
2968	Find Greatest Common Divisor of 15790 and 10790, using Euclidean algorithm.	2
2969	Find Greatest Common Divisor of 15830 and 10830, using Euclidean algorithm.	2
2970	Find Greatest Common Divisor of 15890 and 10890, using Euclidean algorithm.	2
2971	Find Greatest Common Divisor of 15970 and 10970, using Euclidean algorithm.	2
2972	Find Greatest Common Divisor of 16010 and 11010, using Euclidean algorithm.	2
2973	Find Greatest Common Divisor of 16110 and 11110, using Euclidean algorithm.	2
2974	Find Greatest Common Divisor of 16150 and 11150, using Euclidean algorithm.	2
2975	Find Greatest Common Divisor of 16210 and 11210, using Euclidean algorithm.	2
2976	Find Greatest Common Divisor of 17770 and 12770, using Euclidean algorithm.	2
2977	Find Greatest Common Divisor of 16310 and 11310, using Euclidean algorithm.	2
2978	Find Greatest Common Divisor of 16330 and 11330, using Euclidean algorithm.	2
2979	Find Greatest Common Divisor of 17870 and 12870, using Euclidean algorithm.	2
2980	Find Greatest Common Divisor of 17890 and 12890, using Euclidean algorithm.	2
2981	Find Greatest Common Divisor of 17910 and 12910, using Euclidean algorithm.	2
2982	Find Greatest Common Divisor of 17930 and 12930, using Euclidean algorithm.	2
2983	Find Greatest Common Divisor of 17950 and 12950, using Euclidean algorithm.	2
2984	Find Greatest Common Divisor of 16810 and 11810, using Euclidean algorithm.	2
2985	Find Greatest Common Divisor of 16830 and 11830, using Euclidean algorithm.	2
2986	Find Greatest Common Divisor of 16850 and 11850, using Euclidean algorithm.	2
2987	Find Greatest Common Divisor of 18010 and 13010, using Euclidean algorithm.	2
2988	Find Greatest Common Divisor of 16910 and 11910, using Euclidean algorithm.	2
2989	Find Greatest Common Divisor of 18030 and 13030, using Euclidean algorithm.	2
2990	Find Greatest Common Divisor of 17010 and 12010, using Euclidean algorithm.	2
2991	Find Greatest Common Divisor of 18090 and 13090, using Euclidean algorithm.	2
2992	Find Greatest Common Divisor of 17110 and 12110, using Euclidean algorithm.	2
2993	Find Greatest Common Divisor of 17230 and 12230, using Euclidean algorithm.	2
2994	Find Greatest Common Divisor of 18130 and 13130, using Euclidean algorithm.	2
2995	Find Greatest Common Divisor of 17330 and 12330, using Euclidean algorithm.	2
2996	Find Greatest Common Divisor of 18150 and 13150, using Euclidean algorithm.	2
2997	Find Greatest Common Divisor of 17370 and 12370, using Euclidean algorithm.	2
2998	Find Greatest Common Divisor of 17450 and 12450, using Euclidean algorithm.	2
2999	Find Greatest Common Divisor of 18190 and 13190, using Euclidean algorithm.	2
3000	Find Greatest Common Divisor of 17530 and 12530, using Euclidean algorithm.	2