GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3401 | Find Greatest Common Divisor of 18, 19 and 22, by listing out the factors. | 2 |
| 3402 | Find Greatest Common Divisor of 36, 72 and 102, by listing out the factors. | 2 |
| 3403 | Find Greatest Common Divisor of 503, 1101 and 2002, by listing out the factors. | 2 |
| 3404 | Find Greatest Common Divisor of 4736 and 8, using prime factorization. | 2 |
| 3405 | Find Greatest Common Divisor of 24 and 3, using repeated division. | 2 |
| 3406 | Find Greatest Common Divisor of 116 and 25, using prime factorization. | 2 |
| 3407 | Find Greatest Common Divisor of 56 and 72, using prime factorization. | 2 |
| 3408 | Find Greatest Common Divisor of 285. | 2 |
| 3409 | Find Greatest Common Divisor of 54 and 252, using prime factorization. | 2 |
| 3410 | Find Greatest Common Divisor of 1759 and 550, using prime factorization. | 2 |
| 3411 | Find Greatest Common Divisor of 14, 3 and 5, using prime factorization. | 2 |
| 3412 | Find Greatest Common Divisor of 816 and 3612, using Euclidean algorithm. | 2 |
| 3413 | Find Greatest Common Divisor of 220 and 400, using prime factorization. | 2 |
| 3414 | Find Greatest Common Divisor of 100 and 101, using prime factorization. | 2 |
| 3415 | Find Greatest Common Divisor of 11, 7 and 8, using Euclidean algorithm. | 2 |
| 3416 | Find Greatest Common Divisor of 12 and 77, using Euclidean algorithm. | 2 |
| 3417 | Find Greatest Common Divisor of 47 and 4, using Euclidean algorithm. | 2 |
| 3418 | Find Greatest Common Divisor of 23 and 5, using Euclidean algorithm. | 2 |
| 3419 | Find Greatest Common Divisor of 24 and 48, using prime factorization. | 2 |
| 3420 | Find Greatest Common Divisor of 11 and 8, using Euclidean algorithm. | 2 |
| 3421 | Find Greatest Common Divisor of 19 and 8, using Euclidean algorithm. | 2 |
| 3422 | Find Greatest Common Divisor of 6435 and 768, using prime factorization. | 2 |
| 3423 | Find Greatest Common Divisor of 2, 4 and 8, using prime factorization. | 2 |
| 3424 | Find Greatest Common Divisor of 420 and 352, using prime factorization. | 2 |
| 3425 | Find Greatest Common Divisor of 16 and 97, using prime factorization. | 2 |
| 3426 | Find Greatest Common Divisor of 180 and 80, using prime factorization. | 2 |
| 3427 | Find Greatest Common Divisor of 589 and 817, using prime factorization. | 2 |
| 3428 | Find Greatest Common Divisor of 20 and 115, using prime factorization. | 2 |
| 3429 | Find Greatest Common Divisor of 1001 and 11, using Euclidean algorithm. | 2 |
| 3430 | Find Greatest Common Divisor of 663 and 5168, using Euclidean algorithm. | 2 |
| 3431 | Find Greatest Common Divisor of 733103 and 91637, using Euclidean algorithm. | 2 |
| 3432 | Find Greatest Common Divisor of 513 and 347, using Euclidean algorithm. | 2 |
| 3433 | Find Greatest Common Divisor of 3 and 14, using Euclidean algorithm. | 2 |
| 3434 | Find Greatest Common Divisor of 44289 and 38952, using Euclidean algorithm. | 2 |
| 3435 | Find Greatest Common Divisor of 40, 6, 43, 5, 42, 2, 6, 6, 12, 1, 1 and 1, using prime factorization. | 2 |
| 3436 | Find Greatest Common Divisor of 18, 2436, 54, 90 and 126, using prime factorization. | 2 |
| 3437 | Find Greatest Common Divisor of 48 and 5, using prime factorization. | 2 |
| 3438 | Find Greatest Common Divisor of 48 and 5, using Euclidean algorithm. | 2 |
| 3439 | Find Greatest Common Divisor of 400. | 2 |
| 3440 | Find Greatest Common Divisor of 400. | 2 |
| 3441 | Find Greatest Common Divisor of 862. | 2 |
| 3442 | Find Greatest Common Divisor of 8440. | 2 |
| 3443 | Find Greatest Common Divisor of 13 and 120, using prime factorization. | 2 |
| 3444 | 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 |
| 3445 | Find Greatest Common Divisor of 1, 5, 3 and 10, using prime factorization. | 2 |
| 3446 | Find Greatest Common Divisor of 1819 and 3587, using Euclidean algorithm. | 2 |
| 3447 | Find Greatest Common Divisor of 2447 and 3997, using prime factorization. | 2 |
| 3448 | Find Greatest Common Divisor of 1010 and 407, using Euclidean algorithm. | 2 |
| 3449 | Find Greatest Common Divisor of 44 and 91, using Euclidean algorithm. | 2 |
| 3450 | Find Greatest Common Divisor of 407 and 101, using prime factorization. | 2 |