GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1601 | Find Greatest Common Divisor of 81 and 36, using repeated division. | 5 |
| 1602 | Find Greatest Common Divisor of 81 and 36, by listing out the factors. | 5 |
| 1603 | Find Greatest Common Divisor of 2133132421. | 5 |
| 1604 | Find Greatest Common Divisor of 2133132421. | 5 |
| 1605 | Find Greatest Common Divisor of 24 and 46, using Euclidean algorithm. | 5 |
| 1606 | Find Greatest Common Divisor of 102 and 60, using prime factorization. | 5 |
| 1607 | Find Greatest Common Divisor of 10092 and 1654, using Euclidean algorithm. | 5 |
| 1608 | Find Greatest Common Divisor of 1999 and 299, using Euclidean algorithm. | 5 |
| 1609 | Find Greatest Common Divisor of 22800 and 15200, using prime factorization. | 5 |
| 1610 | Find Greatest Common Divisor of 24 and 120, using prime factorization. | 5 |
| 1611 | Find Greatest Common Divisor of 7 and 91, using prime factorization. | 5 |
| 1612 | Find Greatest Common Divisor of 91 and 14, using prime factorization. | 5 |
| 1613 | Find Greatest Common Divisor of 80 and 15, using prime factorization. | 5 |
| 1614 | Find Greatest Common Divisor of 70 and 5, using prime factorization. | 5 |
| 1615 | Find Greatest Common Divisor of 50 and 2, using prime factorization. | 5 |
| 1616 | Find Greatest Common Divisor of 21 and 98, using prime factorization. | 5 |
| 1617 | Find Greatest Common Divisor of 72 and 144, using prime factorization. | 5 |
| 1618 | Find Greatest Common Divisor of 836 and 10, using prime factorization. | 5 |
| 1619 | Find Greatest Common Divisor of 318 and 8, using prime factorization. | 5 |
| 1620 | Find Greatest Common Divisor of 6048 and 95040, using prime factorization. | 5 |
| 1621 | Find Greatest Common Divisor of 555 and 24, using prime factorization. | 5 |
| 1622 | Find Greatest Common Divisor of 96 and 1320, using prime factorization. | 5 |
| 1623 | Find Greatest Common Divisor of 18 and 100, using prime factorization. | 5 |
| 1624 | Find Greatest Common Divisor of 625 and 100000, using prime factorization. | 5 |
| 1625 | Find Greatest Common Divisor of 172 and 4, using prime factorization. | 5 |
| 1626 | Find Greatest Common Divisor of 51 and 18, using prime factorization. | 5 |
| 1627 | Find Greatest Common Divisor of 78 and 22, using prime factorization. | 5 |
| 1628 | Find Greatest Common Divisor of 60 and 18, using prime factorization. | 5 |
| 1629 | Find Greatest Common Divisor of 124 and 12, using prime factorization. | 5 |
| 1630 | Find Greatest Common Divisor of 622 and 42, using prime factorization. | 5 |
| 1631 | Find Greatest Common Divisor of 51 and 30, using prime factorization. | 5 |
| 1632 | Find Greatest Common Divisor of 129 and 3, using prime factorization. | 5 |
| 1633 | Find Greatest Common Divisor of 58 and 76, using prime factorization. | 5 |
| 1634 | Find Greatest Common Divisor of 64 and 94, using prime factorization. | 5 |
| 1635 | Find Greatest Common Divisor of 324 and 414, using prime factorization. | 5 |
| 1636 | Find Greatest Common Divisor of 20 and 80, using prime factorization. | 5 |
| 1637 | Find Greatest Common Divisor of 205 and 1000, using prime factorization. | 5 |
| 1638 | Find Greatest Common Divisor of 84375 and 100000, using prime factorization. | 5 |
| 1639 | Find Greatest Common Divisor of 6 and 57, using prime factorization. | 5 |
| 1640 | Find Greatest Common Divisor of 15 and 360, using prime factorization. | 5 |
| 1641 | Find Greatest Common Divisor of 20 and 24, using prime factorization. | 5 |
| 1642 | Find Greatest Common Divisor of 52 and 12, using prime factorization. | 5 |
| 1643 | Find Greatest Common Divisor of 101 and 126, using Euclidean algorithm. | 5 |
| 1644 | Find Greatest Common Divisor of 35 and 25, using Euclidean algorithm. | 5 |
| 1645 | Find Greatest Common Divisor of 111 and 11, using Euclidean algorithm. | 5 |
| 1646 | Find Greatest Common Divisor of 527 and 765, using Euclidean algorithm. | 5 |
| 1647 | Find Greatest Common Divisor of 15 and 35, using Euclidean algorithm. | 5 |
| 1648 | Find Greatest Common Divisor of 8. | 5 |
| 1649 | Find Greatest Common Divisor of 26 and 3, using prime factorization. | 5 |
| 1650 | Find Greatest Common Divisor of 816 and 1071, using Euclidean algorithm. | 5 |