GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3401	Find Greatest Common Divisor of 70 and 120, using repeated division.	2
3402	Find Greatest Common Divisor of 168 and 504, using repeated division.	2
3403	Find Greatest Common Divisor of 180 and 600, using Euclidean algorithm.	2
3404	Find Greatest Common Divisor of 60 and 84, using Euclidean algorithm.	2
3405	Find Greatest Common Divisor of 234 and 470, using Euclidean algorithm.	2
3406	Find Greatest Common Divisor of 84 and 180, using Euclidean algorithm.	2
3407	Find Greatest Common Divisor of 64 and 160, using Euclidean algorithm.	2
3408	Find Greatest Common Divisor of 308 and 504, using Euclidean algorithm.	2
3409	Find Greatest Common Divisor of 1890 and 45, using Euclidean algorithm.	2
3410	Find Greatest Common Divisor of 1890 and 450, using Euclidean algorithm.	2
3411	Find Greatest Common Divisor of 696 and 432, using Euclidean algorithm.	2
3412	Find Greatest Common Divisor of 105 and 231, using Euclidean algorithm.	2
3413	Find Greatest Common Divisor of 273 and 595, using Euclidean algorithm.	2
3414	Find Greatest Common Divisor of 18 and 50, using prime factorization.	2
3415	Find Greatest Common Divisor of 93 and 22, using prime factorization.	2
3416	Find Greatest Common Divisor of 39 and 22, using prime factorization.	2
3417	Find Greatest Common Divisor of 99 and 40, using prime factorization.	2
3418	Find Greatest Common Divisor of 14400 and 5040, using prime factorization.	2
3419	Find Greatest Common Divisor of 54321 and 12345, using prime factorization.	2
3420	Find Greatest Common Divisor of 54321 and 12345, using Euclidean algorithm.	2
3421	Find Greatest Common Divisor of 5, 6 and 92, using prime factorization.	2
3422	Find Greatest Common Divisor of 398 and 294, using prime factorization.	2
3423	Find Greatest Common Divisor of 398 and 294, using Euclidean algorithm.	2
3424	Find Greatest Common Divisor of 976 and 174, using prime factorization.	2
3425	Find Greatest Common Divisor of 4655 and 12075, using prime factorization.	2
3426	Find Greatest Common Divisor of 4655 and 12075, using repeated division.	2
3427	Find Greatest Common Divisor of 4, 21 and 60, using prime factorization.	2
3428	Find Greatest Common Divisor of 15 and 22, using prime factorization.	2
3429	Find Greatest Common Divisor of 20, 15 and 5, using prime factorization.	2
3430	Find Greatest Common Divisor of 3, 6 and 7, using prime factorization.	2
3431	Find Greatest Common Divisor of 345 and 369, using prime factorization.	2
3432	Find Greatest Common Divisor of 369 and 345, using repeated division.	2
3433	Find Greatest Common Divisor of 369 and 345, using Euclidean algorithm.	2
3434	Find Greatest Common Divisor of 1 and 100, using Euclidean algorithm.	2
3435	Find Greatest Common Divisor of 48 and 100, using prime factorization.	2
3436	Find Greatest Common Divisor of 9, 15 and 12, using prime factorization.	2
3437	Find Greatest Common Divisor of 8217949832 and 8181353375, using prime factorization.	2
3438	Find Greatest Common Divisor of 290184 and 351, using prime factorization.	2
3439	Find Greatest Common Divisor of 1111 and 11, using Euclidean algorithm.	2
3440	Find Greatest Common Divisor of 12, 116, 56 and 764, using prime factorization.	2
3441	Find Greatest Common Divisor of 13, 7 and 72, using prime factorization.	2
3442	Find Greatest Common Divisor of 1340 and 1340, using prime factorization.	2
3443	Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm.	2
3444	Find Greatest Common Divisor of 84 and 96, using prime factorization.	2
3445	Find Greatest Common Divisor of 165, 45 and 5, using prime factorization.	2
3446	Find Greatest Common Divisor of 5 and 288, using prime factorization.	2
3447	Find Greatest Common Divisor of 250 and 134, using prime factorization.	2
3448	Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using Euclidean algorithm.	2
3449	Find Greatest Common Divisor of 889 and 246, using Euclidean algorithm.	2
3450	Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm.	2