GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3201	Find Greatest Common Divisor of 756, 324 and 540, using prime factorization.	2
3202	Find Greatest Common Divisor of 289 and 248, using prime factorization.	2
3203	Find Greatest Common Divisor of 65 and 50, using prime factorization.	2
3204	Find Greatest Common Divisor of 26 and 118, using Euclidean algorithm.	2
3205	Find Greatest Common Divisor of 1024 and 486, using Euclidean algorithm.	2
3206	Find Greatest Common Divisor of 486 and 18, using Euclidean algorithm.	2
3207	Find Greatest Common Divisor of 52 and 21, using Euclidean algorithm.	2
3208	Find Greatest Common Divisor of 50, 75 and 120, using prime factorization.	2
3209	Find Greatest Common Divisor of 4 and 39, using Euclidean algorithm.	2
3210	Find Greatest Common Divisor of 49 and 156, using Euclidean algorithm.	2
3211	Find Greatest Common Divisor of 35 and 81, using Euclidean algorithm.	2
3212	Find Greatest Common Divisor of 10032 and 873, using prime factorization.	2
3213	Find Greatest Common Divisor of 38603578125 and 86821875, using prime factorization.	2
3214	Find Greatest Common Divisor of 6699 and 8265, using repeated division.	2
3215	Find Greatest Common Divisor of 91 and 65, using prime factorization.	2
3216	Find Greatest Common Divisor of 66, 45 and 9, using prime factorization.	2
3217	Find Greatest Common Divisor of 50, 100 and 75, using prime factorization.	2
3218	Find Greatest Common Divisor of 5720 and 5460, using prime factorization.	2
3219	Find Greatest Common Divisor of 42 and 72, using prime factorization.	2
3220	Find Greatest Common Divisor of 123456 and 789, using repeated division.	2
3221	Find Greatest Common Divisor of 3 and 62, using prime factorization.	2
3222	Find Greatest Common Divisor of 135 and 105, using prime factorization.	2
3223	Find Greatest Common Divisor of 18, 40, 360 and 14, using prime factorization.	2
3224	Find Greatest Common Divisor of 10 and 21, using repeated division.	2
3225	Find Greatest Common Divisor of 2600 and 5500, using Euclidean algorithm.	2
3226	Find Greatest Common Divisor of 81.	2
3227	Find Greatest Common Divisor of 8130.	2
3228	Find Greatest Common Divisor of 1755 and 2475, using repeated division.	2
3229	Find Greatest Common Divisor of 6035 and 578, using Euclidean algorithm.	2
3230	Find Greatest Common Divisor of 52 and 18, using prime factorization.	2
3231	Find Greatest Common Divisor of 486 and 52, using prime factorization.	2
3232	Find Greatest Common Divisor of 1739 and 9923, using Euclidean algorithm.	2
3233	Find Greatest Common Divisor of 161 and 128, using prime factorization.	2
3234	Find Greatest Common Divisor of 21 and 92, using prime factorization.	2
3235	Find Greatest Common Divisor of 1372 and 5733, using Euclidean algorithm.	2
3236	Find Greatest Common Divisor of 445 and 556, using Euclidean algorithm.	2
3237	Find Greatest Common Divisor of 332 and 192, using Euclidean algorithm.	2
3238	Find Greatest Common Divisor of 45, 50 and 60, using prime factorization.	2
3239	Find Greatest Common Divisor of 441, 228 and 445, using prime factorization.	2
3240	Find Greatest Common Divisor of 228 and 441, using prime factorization.	2
3241	Find Greatest Common Divisor of 17.	2
3242	Find Greatest Common Divisor of 181 and 52, using prime factorization.	2
3243	Find Greatest Common Divisor of 230 and 45, using prime factorization.	2
3244	Find Greatest Common Divisor of 790 and 121, using prime factorization.	2
3245	Find Greatest Common Divisor of 48, 64 and 100, by listing out the factors.	2
3246	Find Greatest Common Divisor of 3158 and 1226, using Euclidean algorithm.	2
3247	Find Greatest Common Divisor of 11 and 39, using Euclidean algorithm.	2
3248	Find Greatest Common Divisor of 6144 and 20, using prime factorization.	2
3249	Find Greatest Common Divisor of 85672 and 242040, using Euclidean algorithm.	2
3250	Find Greatest Common Divisor of 5, 7 and 13, using prime factorization.	2