GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3001	Find Greatest Common Divisor of 18290 and 13290, using Euclidean algorithm.	2
3002	Find Greatest Common Divisor of 18350 and 13350, using Euclidean algorithm.	2
3003	Find Greatest Common Divisor of 18410 and 13410, using Euclidean algorithm.	2
3004		2
3005	Find Greatest Common Divisor of 29 and 59, using Euclidean algorithm.	2
3006	Find Greatest Common Divisor of 8 and 30, using Euclidean algorithm.	2
3007	Find Greatest Common Divisor of 18 and 52, using Euclidean algorithm.	2
3008	Find Greatest Common Divisor of 16 and 40, using Euclidean algorithm.	2
3009	Find Greatest Common Divisor of 456318 and 3837523, using prime factorization.	2
3010	Find Greatest Common Divisor of 8, 18 and 32, using prime factorization.	2
3011	Find Greatest Common Divisor of 120 and 385, using prime factorization.	2
3012	Find Greatest Common Divisor of 987654321 and 123456789, using Euclidean algorithm.	2
3013	Find Greatest Common Divisor of 720 and 210, using Euclidean algorithm.	2
3014	Find Greatest Common Divisor of 96 and 54, using Euclidean algorithm.	2
3015	Find Greatest Common Divisor of 200025 and 2000025, using Euclidean algorithm.	2
3016	Find Greatest Common Divisor of 2432 and 266, using Euclidean algorithm.	2
3017	Find Greatest Common Divisor of 2432 and 893, using Euclidean algorithm.	2
3018	Find Greatest Common Divisor of 315 and 430, using repeated division.	2
3019	Find Greatest Common Divisor of 72345 and 43215, using prime factorization.	2
3020	Find Greatest Common Divisor of 72345 and 43215, using Euclidean algorithm.	2
3021	Find Greatest Common Divisor of 300 and 18, using prime factorization.	2
3022	Find Greatest Common Divisor of 300 and 18, using Euclidean algorithm.	2
3023	Find Greatest Common Divisor of 412 and 64, using prime factorization.	2
3024	Find Greatest Common Divisor of 6828 and 447, using Euclidean algorithm.	2
3025	Find Greatest Common Divisor of 6828 and 709, using Euclidean algorithm.	2
3026	Find Greatest Common Divisor of 20 and 40, using prime factorization.	2
3027	Find Greatest Common Divisor of 39 and 40, using prime factorization.	2
3028	Find Greatest Common Divisor of 3 and 40, using prime factorization.	2
3029	Find Greatest Common Divisor of 3 and 60, using prime factorization.	2
3030	Find Greatest Common Divisor of 125 and 20, using Euclidean algorithm.	2
3031	Find Greatest Common Divisor of 10041 and 107, using Euclidean algorithm.	2
3032	Find Greatest Common Divisor of 8441 and 137, using prime factorization.	2
3033	Find Greatest Common Divisor of 8441 and 137, using Euclidean algorithm.	2
3034	Find Greatest Common Divisor of 3512 and 888, using Euclidean algorithm.	2
3035	Find Greatest Common Divisor of 3564 and 926, using prime factorization.	2
3036	Find Greatest Common Divisor of 120 and 3533, using Euclidean algorithm.	2
3037	Find Greatest Common Divisor of 6515 and 7756, using Euclidean algorithm.	2
3038	Find Greatest Common Divisor of 3510 and 99, using Euclidean algorithm.	2
3039	Find Greatest Common Divisor of 3512 and 856, using Euclidean algorithm.	2
3040	Find Greatest Common Divisor of 239 and 3731, using Euclidean algorithm.	2
3041	Find Greatest Common Divisor of 412373 and 739817, using prime factorization.	2
3042	Find Greatest Common Divisor of 113 and 110, using Euclidean algorithm.	2
3043	Find Greatest Common Divisor of 72 and 982800, using Euclidean algorithm.	2
3044	Find Greatest Common Divisor of 383 and 74, using prime factorization.	2
3045	Find Greatest Common Divisor of 17570 and 12570, using Euclidean algorithm.	2
3046	Find Greatest Common Divisor of 234 and 531, using Euclidean algorithm.	2
3047	Find Greatest Common Divisor of 43242 and 120000, using Euclidean algorithm.	2
3048	Find Greatest Common Divisor of 20 and 2, using Euclidean algorithm.	2
3049	Find Greatest Common Divisor of 20 and 3, using Euclidean algorithm.	2
3050	Find Greatest Common Divisor of 810 and 222, using repeated division.	2