GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7401 | Find Greatest Common Divisor of 5344 and 14, using Euclidean algorithm. | 1 |
| 7402 | Find Greatest Common Divisor of 54 and 16, using Euclidean algorithm. | 1 |
| 7403 | Find Greatest Common Divisor of 46 and 35, using Euclidean algorithm. | 1 |
| 7404 | Find Greatest Common Divisor of 97 and 56, using Euclidean algorithm. | 1 |
| 7405 | Find Greatest Common Divisor of 13 and 51, using Euclidean algorithm. | 1 |
| 7406 | Find Greatest Common Divisor of 53 and 31, using Euclidean algorithm. | 1 |
| 7407 | Find Greatest Common Divisor of 51 and 40, using Euclidean algorithm. | 1 |
| 7408 | Find Greatest Common Divisor of 31 and 51, using Euclidean algorithm. | 1 |
| 7409 | Find Greatest Common Divisor of 83 and 39, using Euclidean algorithm. | 1 |
| 7410 | Find Greatest Common Divisor of 67 and 37, using Euclidean algorithm. | 1 |
| 7411 | Find Greatest Common Divisor of 90, 52 and 1, by listing out the factors. | 1 |
| 7412 | Find Greatest Common Divisor of 28 and 54, using Euclidean algorithm. | 1 |
| 7413 | Find Greatest Common Divisor of 22 and 46, using Euclidean algorithm. | 1 |
| 7414 | Find Greatest Common Divisor of 32 and 74, using Euclidean algorithm. | 1 |
| 7415 | Find Greatest Common Divisor of 98 and 62, using Euclidean algorithm. | 1 |
| 7416 | Find Greatest Common Divisor of 82 and 60, using Euclidean algorithm. | 1 |
| 7417 | Find Greatest Common Divisor of 96 and 62, using Euclidean algorithm. | 1 |
| 7418 | Find Greatest Common Divisor of 35 and 47, using Euclidean algorithm. | 1 |
| 7419 | Find Greatest Common Divisor of 72 and 44, using Euclidean algorithm. | 1 |
| 7420 | Find Greatest Common Divisor of 16 and 23, using Euclidean algorithm. | 1 |
| 7421 | Find Greatest Common Divisor of 14 and 60, using Euclidean algorithm. | 1 |
| 7422 | Find Greatest Common Divisor of 14 and 83, using Euclidean algorithm. | 1 |
| 7423 | Find Greatest Common Divisor of 301981 and 449573, using repeated division. | 1 |
| 7424 | Find Greatest Common Divisor of 393 and 655, using prime factorization. | 1 |
| 7425 | Find Greatest Common Divisor of 91 and 89, using Euclidean algorithm. | 1 |
| 7426 | Find Greatest Common Divisor of 30 and 30, using Euclidean algorithm. | 1 |
| 7427 | Find Greatest Common Divisor of 95 and 43, using Euclidean algorithm. | 1 |
| 7428 | Find Greatest Common Divisor of 99 and 58, using Euclidean algorithm. | 1 |
| 7429 | Find Greatest Common Divisor of 15 and 18, using prime factorization. | 1 |
| 7430 | Find Greatest Common Divisor of 46 and 67, using Euclidean algorithm. | 1 |
| 7431 | Find Greatest Common Divisor of 85743 and 256767, using prime factorization. | 1 |
| 7432 | Find Greatest Common Divisor of 68 and 32, using Euclidean algorithm. | 1 |
| 7433 | Find Greatest Common Divisor of 39 and 81, using Euclidean algorithm. | 1 |
| 7434 | Find Greatest Common Divisor of 54 and 98, using Euclidean algorithm. | 1 |
| 7435 | Find Greatest Common Divisor of 81 and 80, using Euclidean algorithm. | 1 |
| 7436 | Find Greatest Common Divisor of 63 and 90, using Euclidean algorithm. | 1 |
| 7437 | Find Greatest Common Divisor of 3, 3 and 3, using prime factorization. | 1 |
| 7438 | Find Greatest Common Divisor of 297804 and 5, using Euclidean algorithm. | 1 |
| 7439 | Find Greatest Common Divisor of 125 and 52, using prime factorization. | 1 |
| 7440 | Find Greatest Common Divisor of 151 and 352, using Euclidean algorithm. | 1 |
| 7441 | Find Greatest Common Divisor of 7 and 352, using Euclidean algorithm. | 1 |
| 7442 | Find Greatest Common Divisor of 2364 and 78, using Euclidean algorithm. | 1 |
| 7443 | Find Greatest Common Divisor of 547 and 189, using Euclidean algorithm. | 1 |
| 7444 | Find Greatest Common Divisor of 999 and 19, using Euclidean algorithm. | 1 |
| 7445 | Find Greatest Common Divisor of 98 and 126, using Euclidean algorithm. | 1 |
| 7446 | Find Greatest Common Divisor of 15, 3, 10, 2, 15, 2, 2, 10 and 3, using prime factorization. | 1 |
| 7447 | Find Greatest Common Divisor of 1875 and 135, using prime factorization. | 1 |
| 7448 | Find Greatest Common Divisor of 1875 and 135, using Euclidean algorithm. | 1 |
| 7449 | Find Greatest Common Divisor of 14 and 77, using prime factorization. | 1 |
| 7450 | Find Greatest Common Divisor of 1147 and 851, using Euclidean algorithm. | 1 |