GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1701 | Find Greatest Common Divisor of 475 and 100, using prime factorization. | 7 |
| 1702 | Find Greatest Common Divisor of 10 and 36, using prime factorization. | 7 |
| 1703 | Find Greatest Common Divisor of 10 and 28, using prime factorization. | 7 |
| 1704 | Find Greatest Common Divisor of 498 and 8, using prime factorization. | 7 |
| 1705 | Find Greatest Common Divisor of 36 and 46, using prime factorization. | 7 |
| 1706 | Find Greatest Common Divisor of 42 and 50, using prime factorization. | 7 |
| 1707 | Find Greatest Common Divisor of 5 and 500, using prime factorization. | 7 |
| 1708 | Find Greatest Common Divisor of 122 and 2, using prime factorization. | 7 |
| 1709 | Find Greatest Common Divisor of 6 and 54, using prime factorization. | 7 |
| 1710 | Find Greatest Common Divisor of 206 and 12, using prime factorization. | 7 |
| 1711 | Find Greatest Common Divisor of 88 and 6, using prime factorization. | 7 |
| 1712 | Find Greatest Common Divisor of 466 and 267, using prime factorization. | 7 |
| 1713 | Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, using prime factorization. | 7 |
| 1714 | Find Greatest Common Divisor of 32 and 24, using prime factorization. | 7 |
| 1715 | Find Greatest Common Divisor of 8 and 5, using prime factorization. | 7 |
| 1716 | Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm. | 6 |
| 1717 | Find Greatest Common Divisor of 2486625522 and 41582215163, using prime factorization. | 6 |
| 1718 | Find Greatest Common Divisor of 45 and 36, using Euclidean algorithm. | 6 |
| 1719 | Find Greatest Common Divisor of 7 and 9, using prime factorization. | 6 |
| 1720 | Find Greatest Common Divisor of 123456 and 789, using prime factorization. | 6 |
| 1721 | Find Greatest Common Divisor of 93149832 and 73482, using Euclidean algorithm. | 6 |
| 1722 | Find Greatest Common Divisor of 1424 and 3084, using Euclidean algorithm. | 6 |
| 1723 | Find Greatest Common Divisor of 252 and 198, using prime factorization. | 6 |
| 1724 | Find Greatest Common Divisor of 4788 and 31256, using Euclidean algorithm. | 6 |
| 1725 | Find Greatest Common Divisor of 12378 and 3054, using prime factorization. | 6 |
| 1726 | Find Greatest Common Divisor of 12378 and 3054, using Euclidean algorithm. | 6 |
| 1727 | Find Greatest Common Divisor of 17 and 33, using Euclidean algorithm. | 6 |
| 1728 | Find Greatest Common Divisor of 150, 360 and 900, using prime factorization. | 6 |
| 1729 | Find Greatest Common Divisor of 459 and 122, using prime factorization. | 6 |
| 1730 | Find Greatest Common Divisor of 58 and 72, using prime factorization. | 6 |
| 1731 | Find Greatest Common Divisor of 15, 18 and 56, using prime factorization. | 6 |
| 1732 | Find Greatest Common Divisor of 56 and 70, using prime factorization. | 6 |
| 1733 | Find Greatest Common Divisor of 21 and 10, using prime factorization. | 6 |
| 1734 | Find Greatest Common Divisor of 15210 and 10210, using Euclidean algorithm. | 6 |
| 1735 | Find Greatest Common Divisor of 15290 and 10290, using Euclidean algorithm. | 6 |
| 1736 | Find Greatest Common Divisor of 1297 and 26, by listing out the factors. | 6 |
| 1737 | Find Greatest Common Divisor of 108 and 10, using Euclidean algorithm. | 6 |
| 1738 | Find Greatest Common Divisor of 986 and 289, using Euclidean algorithm. | 6 |
| 1739 | Find Greatest Common Divisor of 11 and 72, using Euclidean algorithm. | 6 |
| 1740 | Find Greatest Common Divisor of 30 and 13, using prime factorization. | 6 |
| 1741 | Find Greatest Common Divisor of 8, 9 and 45, using prime factorization. | 6 |
| 1742 | Find Greatest Common Divisor of 29640 and 179, by listing out the factors. | 6 |
| 1743 | Find Greatest Common Divisor of 1607. | 6 |
| 1744 | Find Greatest Common Divisor of 595 and 1463, using prime factorization. | 6 |
| 1745 | Find Greatest Common Divisor of 9357 and 5864, using Euclidean algorithm. | 6 |
| 1746 | Find Greatest Common Divisor of 2025 and 1089, using Euclidean algorithm. | 6 |
| 1747 | Find Greatest Common Divisor of 36, 63 and 108, using repeated division. | 6 |
| 1748 | Find Greatest Common Divisor of 9973 and 6393, using Euclidean algorithm. | 6 |
| 1749 | Find Greatest Common Divisor of 79 and 61, using prime factorization. | 6 |
| 1750 | Find Greatest Common Divisor of 2 and 87, using Euclidean algorithm. | 6 |