GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1651 | Find Greatest Common Divisor of 84375 and 100000, using prime factorization. | 6 |
| 1652 | Find Greatest Common Divisor of 132 and 8, using prime factorization. | 6 |
| 1653 | Find Greatest Common Divisor of 698 and 8, using prime factorization. | 6 |
| 1654 | Find Greatest Common Divisor of 19 and 160, using prime factorization. | 6 |
| 1655 | Find Greatest Common Divisor of 42 and 14, using prime factorization. | 6 |
| 1656 | Find Greatest Common Divisor of 119 and 272, using Euclidean algorithm. | 6 |
| 1657 | Find Greatest Common Divisor of 32 and 640, using Euclidean algorithm. | 6 |
| 1658 | Find Greatest Common Divisor of 504 and 385, using Euclidean algorithm. | 6 |
| 1659 | Find Greatest Common Divisor of 48 and 60, using Euclidean algorithm. | 6 |
| 1660 | Find Greatest Common Divisor of 11111 and 111111, using Euclidean algorithm. | 6 |
| 1661 | Find Greatest Common Divisor of 3, 5 and 7, using prime factorization. | 6 |
| 1662 | Find Greatest Common Divisor of 504 and 270, using Euclidean algorithm. | 6 |
| 1663 | Find Greatest Common Divisor of 17 and 3120, using prime factorization. | 6 |
| 1664 | Find Greatest Common Divisor of 4131 and 2431, using Euclidean algorithm. | 6 |
| 1665 | Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm. | 6 |
| 1666 | Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm. | 6 |
| 1667 | Find Greatest Common Divisor of 35 and 192, using prime factorization. | 6 |
| 1668 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using prime factorization. | 6 |
| 1669 | Find Greatest Common Divisor of 272 and 1479, using Euclidean algorithm. | 6 |
| 1670 | Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm. | 6 |
| 1671 | Find Greatest Common Divisor of 1 and 6, using prime factorization. | 6 |
| 1672 | Find Greatest Common Divisor of 973 and 301, using prime factorization. | 6 |
| 1673 | Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization. | 6 |
| 1674 | Find Greatest Common Divisor of 96, 112 and 144, by listing out the factors. | 5 |
| 1675 | Find Greatest Common Divisor of 20 and 3, using prime factorization. | 5 |
| 1676 | Find Greatest Common Divisor of 45 and 33, using prime factorization. | 5 |
| 1677 | Find Greatest Common Divisor of 77 and 128, using prime factorization. | 5 |
| 1678 | Find Greatest Common Divisor of 7 and 20, using Euclidean algorithm. | 5 |
| 1679 | Find Greatest Common Divisor of 36 and 54, using Euclidean algorithm. | 5 |
| 1680 | Find Greatest Common Divisor of 12 and 1234, using Euclidean algorithm. | 5 |
| 1681 | Find Greatest Common Divisor of 315 and 825, using prime factorization. | 5 |
| 1682 | Find Greatest Common Divisor of 49 and 640, using Euclidean algorithm. | 5 |
| 1683 | Find Greatest Common Divisor of 12345 and 54321, using Euclidean algorithm. | 5 |
| 1684 | Find Greatest Common Divisor of 65 and 130, using prime factorization. | 5 |
| 1685 | Find Greatest Common Divisor of 3 and 8, using repeated division. | 5 |
| 1686 | Find Greatest Common Divisor of 49, 210 and 350, using Euclidean algorithm. | 5 |
| 1687 | Find Greatest Common Divisor of 93 and 42, using Euclidean algorithm. | 5 |
| 1688 | Find Greatest Common Divisor of 17 and 3120, using Euclidean algorithm. | 5 |
| 1689 | Find Greatest Common Divisor of 509 and 1177, using Euclidean algorithm. | 5 |
| 1690 | Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm. | 5 |
| 1691 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using prime factorization. | 5 |
| 1692 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using prime factorization. | 5 |
| 1693 | Find Greatest Common Divisor of 102, 170 and 255, using prime factorization. | 5 |
| 1694 | Find Greatest Common Divisor of 5 and 4, using prime factorization. | 5 |
| 1695 | Find Greatest Common Divisor of 2689 and 4001, using prime factorization. | 5 |
| 1696 | Find Greatest Common Divisor of 1369 and 2597, using Euclidean algorithm. | 5 |
| 1697 | Find Greatest Common Divisor of 3 and 7, using Euclidean algorithm. | 5 |
| 1698 | Find Greatest Common Divisor of 0 and 6, using prime factorization. | 5 |
| 1699 | Find Greatest Common Divisor of 74 and 383, using Euclidean algorithm. | 5 |
| 1700 | Find Greatest Common Divisor of 1, 24, 1 and 6, by listing out the factors. | 5 |