GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1651 | Find Greatest Common Divisor of 1, 2 and 24, using prime factorization. | 2 |
1652 | Find Greatest Common Divisor of 5140998993 and 97000000, using prime factorization. | 2 |
1653 | Find Greatest Common Divisor of 18, 2436, 54, 90 and 126, using prime factorization. | 2 |
1654 | Find Greatest Common Divisor of 3 and 448, using Euclidean algorithm. | 2 |
1655 | Find Greatest Common Divisor of 1 and 3, using Euclidean algorithm. | 2 |
1656 | Find Greatest Common Divisor of 819 and 72, using prime factorization. | 2 |
1657 | Find Greatest Common Divisor of 17 and 276, using prime factorization. | 2 |
1658 | Find Greatest Common Divisor of 25 and 12, using Euclidean algorithm. | 2 |
1659 | Find Greatest Common Divisor of 76 and 84, using Euclidean algorithm. | 2 |
1660 | Find Greatest Common Divisor of 180 and 80, using prime factorization. | 2 |
1661 | Find Greatest Common Divisor of 272 and 1479, by listing out the factors. | 2 |
1662 | Find Greatest Common Divisor of 74 and 383, using Euclidean algorithm. | 2 |
1663 | Find Greatest Common Divisor of 12, 15, 24 and 72, using repeated division. | 2 |
1664 | Find Greatest Common Divisor of 18 and 60, using Euclidean algorithm. | 2 |
1665 | Find Greatest Common Divisor of 42 and 41, using Euclidean algorithm. | 2 |
1666 | Find Greatest Common Divisor of 819 and 72, using repeated division. | 2 |
1667 | Find Greatest Common Divisor of 58 and 32, using prime factorization. | 2 |
1668 | Find Greatest Common Divisor of 3120 and 17, by listing out the factors. | 2 |
1669 | Find Greatest Common Divisor of 17 and 264, using Euclidean algorithm. | 2 |
1670 | Find Greatest Common Divisor of 48, 180 and 270, using Euclidean algorithm. | 2 |
1671 | Find Greatest Common Divisor of 225 and 625, using prime factorization. | 2 |
1672 | Find Greatest Common Divisor of 259 and 222, using repeated division. | 2 |
1673 | Find Greatest Common Divisor of 12 and 15, using Euclidean algorithm. | 2 |
1674 | Find Greatest Common Divisor of 3120 and 17, using Euclidean algorithm. | 2 |
1675 | Find Greatest Common Divisor of 159 and 53, using repeated division. | 2 |
1676 | Find Greatest Common Divisor of 108 and 156, using Euclidean algorithm. | 2 |
1677 | Find Greatest Common Divisor of 35. | 2 |
1678 | Find Greatest Common Divisor of 2771 and 206, using prime factorization. | 2 |
1679 | Find Greatest Common Divisor of 160 and 3, using prime factorization. | 2 |
1680 | Find Greatest Common Divisor of 521 and 2071, using Euclidean algorithm. | 2 |
1681 | Find Greatest Common Divisor of 296 and 481, using repeated division. | 2 |
1682 | Find Greatest Common Divisor of 4801 and 500, using Euclidean algorithm. | 2 |
1683 | Find Greatest Common Divisor of 429 and 468, using repeated division. | 2 |
1684 | Find Greatest Common Divisor of 285 and 741, using Euclidean algorithm. | 2 |
1685 | Find Greatest Common Divisor of 593 and 1957, using Euclidean algorithm. | 2 |
1686 | Find Greatest Common Divisor of 20. | 2 |
1687 | Find Greatest Common Divisor of 20 and 101, using prime factorization. | 2 |
1688 | Find Greatest Common Divisor of 341 and 88, using Euclidean algorithm. | 2 |
1689 | Find Greatest Common Divisor of 84 and 180, using Euclidean algorithm. | 2 |
1690 | Find Greatest Common Divisor of 16481, 16326, 16473, 16485, 16320, 16531, 16269 and 16773, using prime factorization. | 2 |
1691 | Find Greatest Common Divisor of 36, 72 and 108, using repeated division. | 2 |
1692 | Find Greatest Common Divisor of 2520 and 6300, using Euclidean algorithm. | 2 |
1693 | Find Greatest Common Divisor of 366 and 305, using repeated division. | 2 |
1694 | Find Greatest Common Divisor of 132 and 100, using prime factorization. | 2 |
1695 | Find Greatest Common Divisor of 22 and 45, using repeated division. | 2 |
1696 | Find Greatest Common Divisor of 61, 610, 1, 61, 671 and 1, using prime factorization. | 2 |
1697 | Find Greatest Common Divisor of 24. | 2 |
1698 | 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 |
1699 | Find Greatest Common Divisor of 123456 and 678, using Euclidean algorithm. | 2 |
1700 | Find Greatest Common Divisor of 35 and 192, by listing out the factors. | 2 |