GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1751 | Find Greatest Common Divisor of 54 and 21, using Euclidean algorithm. | 5 |
| 1752 | Find Greatest Common Divisor of 24 and 60, using prime factorization. | 5 |
| 1753 | Find Greatest Common Divisor of 84 and 126, using Euclidean algorithm. | 5 |
| 1754 | Find Greatest Common Divisor of 84 and 56, using prime factorization. | 5 |
| 1755 | Find Greatest Common Divisor of 54, 72 and 96, using repeated division. | 5 |
| 1756 | Find Greatest Common Divisor of 21 and 28, using prime factorization. | 5 |
| 1757 | Find Greatest Common Divisor of 12 and 18, by listing out the factors. | 5 |
| 1758 | Find Greatest Common Divisor of 1876 and 342, using prime factorization. | 5 |
| 1759 | Find Greatest Common Divisor of 15270 and 10270, using Euclidean algorithm. | 5 |
| 1760 | Find Greatest Common Divisor of 15310 and 10310, using Euclidean algorithm. | 5 |
| 1761 | Find Greatest Common Divisor of 15430 and 10430, using Euclidean algorithm. | 5 |
| 1762 | Find Greatest Common Divisor of 15450 and 10450, using Euclidean algorithm. | 5 |
| 1763 | Find Greatest Common Divisor of 15470 and 10470, using Euclidean algorithm. | 5 |
| 1764 | Find Greatest Common Divisor of 16250 and 11250, using Euclidean algorithm. | 5 |
| 1765 | Find Greatest Common Divisor of 16650 and 11650, using Euclidean algorithm. | 5 |
| 1766 | Find Greatest Common Divisor of 18050 and 13050, using Euclidean algorithm. | 5 |
| 1767 | Find Greatest Common Divisor of 1253 and 26, using prime factorization. | 5 |
| 1768 | Find Greatest Common Divisor of 890 and 26, using Euclidean algorithm. | 5 |
| 1769 | Find Greatest Common Divisor of 1297 and 26, using Euclidean algorithm. | 5 |
| 1770 | Find Greatest Common Divisor of 2701 and 29, using Euclidean algorithm. | 5 |
| 1771 | Find Greatest Common Divisor of 2592 and 29, using Euclidean algorithm. | 5 |
| 1772 | Find Greatest Common Divisor of 2592 and 2501, using Euclidean algorithm. | 5 |
| 1773 | Find Greatest Common Divisor of 2592 and 2567, using prime factorization. | 5 |
| 1774 | Find Greatest Common Divisor of 2592 and 2587, using Euclidean algorithm. | 5 |
| 1775 | Find Greatest Common Divisor of 2592 and 2591, using Euclidean algorithm. | 5 |
| 1776 | Find Greatest Common Divisor of 2592 and 69, using Euclidean algorithm. | 5 |
| 1777 | Find Greatest Common Divisor of 2592 and 2543, using Euclidean algorithm. | 5 |
| 1778 | Find Greatest Common Divisor of 2592 and 2569, using Euclidean algorithm. | 5 |
| 1779 | Find Greatest Common Divisor of 2406 and 654, using Euclidean algorithm. | 5 |
| 1780 | Find Greatest Common Divisor of 105, 315 and 462, using prime factorization. | 5 |
| 1781 | Find Greatest Common Divisor of 108 and 5, using prime factorization. | 5 |
| 1782 | Find Greatest Common Divisor of 112 and 48, using prime factorization. | 5 |
| 1783 | Find Greatest Common Divisor of 46 and 177, using prime factorization. | 5 |
| 1784 | Find Greatest Common Divisor of 55 and 16, using prime factorization. | 5 |
| 1785 | Find Greatest Common Divisor of 56 and 24, using repeated division. | 5 |
| 1786 | Find Greatest Common Divisor of 24 and 16, using repeated division. | 5 |
| 1787 | Find Greatest Common Divisor of 1164, 3445 and 4146, using prime factorization. | 5 |
| 1788 | Find Greatest Common Divisor of 9964, 7058 and 4427, using repeated division. | 5 |
| 1789 | Find Greatest Common Divisor of 60 and 146, using Euclidean algorithm. | 5 |
| 1790 | Find Greatest Common Divisor of 60 and 146, using prime factorization. | 5 |
| 1791 | Find Greatest Common Divisor of 2059 and 581, using Euclidean algorithm. | 5 |
| 1792 | Find Greatest Common Divisor of 232, 392 and 1989, using prime factorization. | 5 |
| 1793 | Find Greatest Common Divisor of 864162. | 5 |
| 1794 | Find Greatest Common Divisor of 7939 and 437325, using Euclidean algorithm. | 5 |
| 1795 | Find Greatest Common Divisor of 2304, 20736 and 576, using prime factorization. | 5 |
| 1796 | Find Greatest Common Divisor of 52, 9843 and 105, using prime factorization. | 5 |
| 1797 | Find Greatest Common Divisor of 120 and 180, using repeated division. | 5 |
| 1798 | Find Greatest Common Divisor of 1625 and 975, using Euclidean algorithm. | 5 |
| 1799 | Find Greatest Common Divisor of 7963409. | 5 |
| 1800 | Find Greatest Common Divisor of 54, 84 and 108, using Euclidean algorithm. | 5 |