GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7651 | Find Greatest Common Divisor of 35, 88, 16, 260, 92, 140, 100, 80, 80 and 344, using prime factorization. | 1 |
| 7652 | Find Greatest Common Divisor of 314 and 159, using Euclidean algorithm. | 1 |
| 7653 | Find Greatest Common Divisor of 504 and 295, using Euclidean algorithm. | 1 |
| 7654 | Find Greatest Common Divisor of 3 and 11, using Euclidean algorithm. | 1 |
| 7655 | Find Greatest Common Divisor of 97 and 7000, by listing out the factors. | 1 |
| 7656 | Find Greatest Common Divisor of 37, 13 and 11, using prime factorization. | 1 |
| 7657 | Find Greatest Common Divisor of 56 and 128, using prime factorization. | 1 |
| 7658 | Find Greatest Common Divisor of 123 and 321, using prime factorization. | 1 |
| 7659 | Find Greatest Common Divisor of 406 and 945, by listing out the factors. | 1 |
| 7660 | Find Greatest Common Divisor of 170 and 122, using Euclidean algorithm. | 1 |
| 7661 | Find Greatest Common Divisor of 170 and 122, using prime factorization. | 1 |
| 7662 | Find Greatest Common Divisor of 12378 and 467, using prime factorization. | 1 |
| 7663 | Find Greatest Common Divisor of 1110 and 0, using prime factorization. | 1 |
| 7664 | Find Greatest Common Divisor of 57 and 0, using Euclidean algorithm. | 1 |
| 7665 | Find Greatest Common Divisor of 36542 and 22022, using prime factorization. | 1 |
| 7666 | Find Greatest Common Divisor of 147 and 70, using prime factorization. | 1 |
| 7667 | Find Greatest Common Divisor of 10 and 409, using prime factorization. | 1 |
| 7668 | Find Greatest Common Divisor of 10234 and 578, using Euclidean algorithm. | 1 |
| 7669 | Find Greatest Common Divisor of 389 and 1570, using prime factorization. | 1 |
| 7670 | Find Greatest Common Divisor of 294 and 398, using Euclidean algorithm. | 1 |
| 7671 | Find Greatest Common Divisor of 845 and 745, using Euclidean algorithm. | 1 |
| 7672 | Find Greatest Common Divisor of 20, 32 and 24, using prime factorization. | 1 |
| 7673 | Find Greatest Common Divisor of 58 and 1, using repeated division. | 1 |
| 7674 | Find Greatest Common Divisor of 109 and 2, using repeated division. | 1 |
| 7675 | Find Greatest Common Divisor of 359 and 125, using repeated division. | 1 |
| 7676 | Find Greatest Common Divisor of 1320 and 1065, using Euclidean algorithm. | 1 |
| 7677 | Find Greatest Common Divisor of 1320 and 1065, by listing out the factors. | 1 |
| 7678 | Find Greatest Common Divisor of 238 and 1105, using Euclidean algorithm. | 1 |
| 7679 | Find Greatest Common Divisor of 240 and 360, using Euclidean algorithm. | 1 |
| 7680 | Find Greatest Common Divisor of 177 and 346, using prime factorization. | 1 |
| 7681 | Find Greatest Common Divisor of 12345 and 67890, using prime factorization. | 1 |
| 7682 | Find Greatest Common Divisor of 234 and 564, using Euclidean algorithm. | 1 |
| 7683 | Find Greatest Common Divisor of 34 and 567, using prime factorization. | 1 |
| 7684 | Find Greatest Common Divisor of 6120 and 2040, using prime factorization. | 1 |
| 7685 | Find Greatest Common Divisor of 6120 and 2040, using repeated division. | 1 |
| 7686 | Find Greatest Common Divisor of 6120 and 2040, by listing out the factors. | 1 |
| 7687 | Find Greatest Common Divisor of 6120 and 2040, using Euclidean algorithm. | 1 |
| 7688 | Find Greatest Common Divisor of 725 and 236, using prime factorization. | 1 |
| 7689 | Find Greatest Common Divisor of 34 and 1649, using Euclidean algorithm. | 1 |
| 7690 | Find Greatest Common Divisor of 91 and 1649, using Euclidean algorithm. | 1 |
| 7691 | Find Greatest Common Divisor of 97 and 1649, using Euclidean algorithm. | 1 |
| 7692 | Find Greatest Common Divisor of 3578 and 9512, using Euclidean algorithm. | 1 |
| 7693 | Find Greatest Common Divisor of 9873, 543 and 21, using Euclidean algorithm. | 1 |
| 7694 | Find Greatest Common Divisor of 375 and 588, using prime factorization. | 1 |
| 7695 | Find Greatest Common Divisor of 251, 33 and 257, using prime factorization. | 1 |
| 7696 | Find Greatest Common Divisor of 221 and 143, using prime factorization. | 1 |
| 7697 | Find Greatest Common Divisor of 221 and 143, using Euclidean algorithm. | 1 |
| 7698 | Find Greatest Common Divisor of 140 and 9, using prime factorization. | 1 |
| 7699 | Find Greatest Common Divisor of 77 and 60, using prime factorization. | 1 |
| 7700 | Find Greatest Common Divisor of 16261 and 11270, using prime factorization. | 1 |
