GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3051	Find Greatest Common Divisor of 48 and 5, using Euclidean algorithm.	2
3052	Find Greatest Common Divisor of 400.	2
3053	Find Greatest Common Divisor of 400.	2
3054	Find Greatest Common Divisor of 862.	2
3055	Find Greatest Common Divisor of 8440.	2
3056	Find Greatest Common Divisor of 13 and 120, using prime factorization.	2
3057	Find Greatest Common Divisor of 2, 5, 2, 4, 3, 2, 3, 3, 2, 5, 2, 4, 2, 3, 2, 2, 4 and 4, using prime factorization.	2
3058	Find Greatest Common Divisor of 1, 5, 3 and 10, using prime factorization.	2
3059	Find Greatest Common Divisor of 1819 and 3587, using Euclidean algorithm.	2
3060	Find Greatest Common Divisor of 2447 and 3997, using prime factorization.	2
3061	Find Greatest Common Divisor of 1010 and 407, using Euclidean algorithm.	2
3062	Find Greatest Common Divisor of 44 and 91, using Euclidean algorithm.	2
3063	Find Greatest Common Divisor of 407 and 101, using prime factorization.	2
3064	Find Greatest Common Divisor of 407 and 101, using Euclidean algorithm.	2
3065	Find Greatest Common Divisor of 407 and 1010, using Euclidean algorithm.	2
3066	Find Greatest Common Divisor of 1000 and 400, using prime factorization.	2
3067	Find Greatest Common Divisor of 1000 and 400, using Euclidean algorithm.	2
3068	Find Greatest Common Divisor of 1000 and 400, by listing out the factors.	2
3069	Find Greatest Common Divisor of 301, 981, 449 and 573, using prime factorization.	2
3070	Find Greatest Common Divisor of 12 and 16, using repeated division.	2
3071	Find Greatest Common Divisor of 45 and 95, using prime factorization.	2
3072	Find Greatest Common Divisor of 125 and 728, using repeated division.	2
3073	Find Greatest Common Divisor of 125 and 728, using Euclidean algorithm.	2
3074	Find Greatest Common Divisor of 216 and 68, using Euclidean algorithm.	2
3075	Find Greatest Common Divisor of 390 and 1261, using prime factorization.	2
3076	Find Greatest Common Divisor of 1 and 64, using prime factorization.	2
3077	Find Greatest Common Divisor of 267, 445 and 712, using prime factorization.	2
3078	Find Greatest Common Divisor of 356 and 140, using prime factorization.	2
3079	Find Greatest Common Divisor of 280 and 117, using Euclidean algorithm.	2
3080	Find Greatest Common Divisor of 10 and 11, using Euclidean algorithm.	2
3081	Find Greatest Common Divisor of 5871420 and 299, using prime factorization.	2
3082	Find Greatest Common Divisor of 330 and 1140, using prime factorization.	2
3083	Find Greatest Common Divisor of 2701 and 2737, using Euclidean algorithm.	2
3084	Find Greatest Common Divisor of 64.	2
3085	Find Greatest Common Divisor of 56, 94 and 128, using prime factorization.	2
3086	Find Greatest Common Divisor of 56, 92 and 124, using repeated division.	2
3087	Find Greatest Common Divisor of 750 and 960, using repeated division.	2
3088	Find Greatest Common Divisor of 152 and 276, using prime factorization.	2
3089	Find Greatest Common Divisor of 332 and 128, using Euclidean algorithm.	2
3090	Find Greatest Common Divisor of 49, 210 and 350, using prime factorization.	2
3091	Find Greatest Common Divisor of 24, 138, 24 and 138, using prime factorization.	2
3092	Find Greatest Common Divisor of 512 and 186, using prime factorization.	2
3093	Find Greatest Common Divisor of 296, 703 and 814, using prime factorization.	2
3094	Find Greatest Common Divisor of 296, 703 and 814, by listing out the factors.	2
3095	Find Greatest Common Divisor of 231 and 7757, using prime factorization.	2
3096	Find Greatest Common Divisor of 5880420 and 229, using Euclidean algorithm.	2
3097	Find Greatest Common Divisor of 103 and 91, using Euclidean algorithm.	2
3098	Find Greatest Common Divisor of 4 and 9, using prime factorization.	2
3099	Find Greatest Common Divisor of 800 and 1025, using prime factorization.	2
3100	Find Greatest Common Divisor of 106 and 63, using prime factorization.	2