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 5 and 6, using prime factorization. | 5 |
| 1652 | Find Greatest Common Divisor of 1970 and 1066, using Euclidean algorithm. | 5 |
| 1653 | Find Greatest Common Divisor of 58 and 32, using Euclidean algorithm. | 5 |
| 1654 | Find Greatest Common Divisor of 9 and 9, using prime factorization. | 5 |
| 1655 | Find Greatest Common Divisor of 1 and 5, using prime factorization. | 5 |
| 1656 | Find Greatest Common Divisor of 3587 and 1819, using prime factorization. | 5 |
| 1657 | Find Greatest Common Divisor of 54 and 21, using Euclidean algorithm. | 5 |
| 1658 | Find Greatest Common Divisor of 24 and 60, using prime factorization. | 5 |
| 1659 | Find Greatest Common Divisor of 21 and 72, using prime factorization. | 5 |
| 1660 | Find Greatest Common Divisor of 84 and 126, using Euclidean algorithm. | 5 |
| 1661 | Find Greatest Common Divisor of 84 and 56, using prime factorization. | 5 |
| 1662 | Find Greatest Common Divisor of 54, 72 and 96, using repeated division. | 5 |
| 1663 | Find Greatest Common Divisor of 21 and 28, using prime factorization. | 5 |
| 1664 | Find Greatest Common Divisor of 12 and 18, by listing out the factors. | 5 |
| 1665 | Find Greatest Common Divisor of 1876 and 342, using prime factorization. | 5 |
| 1666 | Find Greatest Common Divisor of 15270 and 10270, using Euclidean algorithm. | 5 |
| 1667 | Find Greatest Common Divisor of 15310 and 10310, using Euclidean algorithm. | 5 |
| 1668 | Find Greatest Common Divisor of 15430 and 10430, using Euclidean algorithm. | 5 |
| 1669 | Find Greatest Common Divisor of 15450 and 10450, using Euclidean algorithm. | 5 |
| 1670 | Find Greatest Common Divisor of 15470 and 10470, using Euclidean algorithm. | 5 |
| 1671 | Find Greatest Common Divisor of 16250 and 11250, using Euclidean algorithm. | 5 |
| 1672 | Find Greatest Common Divisor of 16650 and 11650, using Euclidean algorithm. | 5 |
| 1673 | Find Greatest Common Divisor of 18050 and 13050, using Euclidean algorithm. | 5 |
| 1674 | Find Greatest Common Divisor of 1253 and 26, using prime factorization. | 5 |
| 1675 | Find Greatest Common Divisor of 890 and 26, using Euclidean algorithm. | 5 |
| 1676 | Find Greatest Common Divisor of 1297 and 26, using Euclidean algorithm. | 5 |
| 1677 | Find Greatest Common Divisor of 2701 and 29, using Euclidean algorithm. | 5 |
| 1678 | Find Greatest Common Divisor of 2592 and 29, using Euclidean algorithm. | 5 |
| 1679 | Find Greatest Common Divisor of 2592 and 2501, using Euclidean algorithm. | 5 |
| 1680 | Find Greatest Common Divisor of 2592 and 2567, using prime factorization. | 5 |
| 1681 | Find Greatest Common Divisor of 2592 and 2587, using Euclidean algorithm. | 5 |
| 1682 | Find Greatest Common Divisor of 2592 and 2591, using Euclidean algorithm. | 5 |
| 1683 | Find Greatest Common Divisor of 2592 and 69, using Euclidean algorithm. | 5 |
| 1684 | Find Greatest Common Divisor of 2592 and 2543, using Euclidean algorithm. | 5 |
| 1685 | Find Greatest Common Divisor of 2592 and 2569, using Euclidean algorithm. | 5 |
| 1686 | Find Greatest Common Divisor of 2406 and 654, using Euclidean algorithm. | 5 |
| 1687 | Find Greatest Common Divisor of 105, 315 and 462, using prime factorization. | 5 |
| 1688 | Find Greatest Common Divisor of 108 and 5, using prime factorization. | 5 |
| 1689 | Find Greatest Common Divisor of 112 and 48, using prime factorization. | 5 |
| 1690 | Find Greatest Common Divisor of 46 and 177, using prime factorization. | 5 |
| 1691 | Find Greatest Common Divisor of 55 and 16, using prime factorization. | 5 |
| 1692 | Find Greatest Common Divisor of 56 and 24, using repeated division. | 5 |
| 1693 | Find Greatest Common Divisor of 24 and 16, using repeated division. | 5 |
| 1694 | Find Greatest Common Divisor of 1164, 3445 and 4146, using prime factorization. | 5 |
| 1695 | Find Greatest Common Divisor of 9964, 7058 and 4427, using repeated division. | 5 |
| 1696 | Find Greatest Common Divisor of 60 and 146, using Euclidean algorithm. | 5 |
| 1697 | Find Greatest Common Divisor of 60 and 146, using prime factorization. | 5 |
| 1698 | Find Greatest Common Divisor of 2059 and 581, using Euclidean algorithm. | 5 |
| 1699 | Find Greatest Common Divisor of 232, 392 and 1989, using prime factorization. | 5 |
| 1700 | Find Greatest Common Divisor of 864162. | 5 |