GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1601 | Find Greatest Common Divisor of 45 and 60, using prime factorization. | 2 |
1602 | Find Greatest Common Divisor of 10 and 70, using Euclidean algorithm. | 2 |
1603 | Find Greatest Common Divisor of 1, 0 and 5, using prime factorization. | 2 |
1604 | Find Greatest Common Divisor of 12 and 24, using prime factorization. | 2 |
1605 | Find Greatest Common Divisor of 1 and 6, using prime factorization. | 2 |
1606 | Find Greatest Common Divisor of 12 and 150, using prime factorization. | 2 |
1607 | Find Greatest Common Divisor of 65 and 165, using prime factorization. | 2 |
1608 | Find Greatest Common Divisor of 37 and 120, using prime factorization. | 2 |
1609 | Find Greatest Common Divisor of 0, 1 and 7, using Euclidean algorithm. | 2 |
1610 | Find Greatest Common Divisor of 259 and 621, using Euclidean algorithm. | 2 |
1611 | Find Greatest Common Divisor of 1007 and 97000000, using prime factorization. | 2 |
1612 | Find Greatest Common Divisor of 12 and 77, using Euclidean algorithm. | 2 |
1613 | Find Greatest Common Divisor of 61730. | 2 |
1614 | Find Greatest Common Divisor of 12 and 24, using Euclidean algorithm. | 2 |
1615 | Find Greatest Common Divisor of 960 and 4500, using prime factorization. | 2 |
1616 | Find Greatest Common Divisor of 96 and 356, using repeated division. | 2 |
1617 | Find Greatest Common Divisor of 57 and 77, using Euclidean algorithm. | 2 |
1618 | Find Greatest Common Divisor of 38 and 120, using prime factorization. | 2 |
1619 | Find Greatest Common Divisor of 0, 1 and 7, using prime factorization. | 2 |
1620 | Find Greatest Common Divisor of 3600 and 2016, using prime factorization. | 2 |
1621 | Find Greatest Common Divisor of 32 and 69, using Euclidean algorithm. | 2 |
1622 | Find Greatest Common Divisor of 32 and 29, using Euclidean algorithm. | 2 |
1623 | Find Greatest Common Divisor of 39 and 120, using prime factorization. | 2 |
1624 | Find Greatest Common Divisor of 441, 567 and 693, using repeated division. | 2 |
1625 | Find Greatest Common Divisor of 22, 54 and 198, using prime factorization. | 2 |
1626 | Find Greatest Common Divisor of 1 and 7, using Euclidean algorithm. | 2 |
1627 | Find Greatest Common Divisor of 125 and 11, using Euclidean algorithm. | 2 |
1628 | Find Greatest Common Divisor of 1400 and 630, using prime factorization. | 2 |
1629 | Find Greatest Common Divisor of 77 and 25, using Euclidean algorithm. | 2 |
1630 | Find Greatest Common Divisor of 513, 783 and 1107, using prime factorization. | 2 |
1631 | Find Greatest Common Divisor of 34 and 102, using prime factorization. | 2 |
1632 | Find Greatest Common Divisor of 234 and 470, using Euclidean algorithm. | 2 |
1633 | Find Greatest Common Divisor of 147 and 630, using repeated division. | 2 |
1634 | Find Greatest Common Divisor of 1759. | 2 |
1635 | Find Greatest Common Divisor of 69 and 19, using Euclidean algorithm. | 2 |
1636 | Find Greatest Common Divisor of 116, 60, 98 and 109, using repeated division. | 2 |
1637 | Find Greatest Common Divisor of 384 and 2750, using prime factorization. | 2 |
1638 | Find Greatest Common Divisor of 15, 50 and 46, using prime factorization. | 2 |
1639 | Find Greatest Common Divisor of 18 and 2, using prime factorization. | 2 |
1640 | Find Greatest Common Divisor of 37 and 18, using Euclidean algorithm. | 2 |
1641 | Find Greatest Common Divisor of 1485 and 4356, using prime factorization. | 2 |
1642 | Find Greatest Common Divisor of 1 and 0, using prime factorization. | 2 |
1643 | Find Greatest Common Divisor of 1819 and 3587, using Euclidean algorithm. | 2 |
1644 | Find Greatest Common Divisor of 800 and 1025, using prime factorization. | 2 |
1645 | Find Greatest Common Divisor of 0 and 43, using prime factorization. | 2 |
1646 | Find Greatest Common Divisor of 2947 and 3997, using Euclidean algorithm. | 2 |
1647 | Find Greatest Common Divisor of 12327 and 2409, using Euclidean algorithm. | 2 |
1648 | Find Greatest Common Divisor of 972 and 783, using Euclidean algorithm. | 2 |
1649 | Find Greatest Common Divisor of 10 and 25, using Euclidean algorithm. | 2 |
1650 | Find Greatest Common Divisor of 81 and 51, using Euclidean algorithm. | 2 |