GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1801 | Find Greatest Common Divisor of 24 and 48, using prime factorization. | 2 |
1802 | Find Greatest Common Divisor of 6789, 1356 and 2460, using prime factorization. | 2 |
1803 | Find Greatest Common Divisor of 12 and 15, by listing out the factors. | 2 |
1804 | Find Greatest Common Divisor of 951, 744, 516, 487, 808, 808, 676, 328, 940 and 470, using prime factorization. | 2 |
1805 | Find Greatest Common Divisor of 765844 and 836, using Euclidean algorithm. | 2 |
1806 | Find Greatest Common Divisor of 64 and 70, using prime factorization. | 2 |
1807 | Find Greatest Common Divisor of 24552 and 4884, using Euclidean algorithm. | 2 |
1808 | Find Greatest Common Divisor of 1001 and 100001, using Euclidean algorithm. | 2 |
1809 | Find Greatest Common Divisor of 1759 and 550, using prime factorization. | 2 |
1810 | Find Greatest Common Divisor of 13 and 8, using Euclidean algorithm. | 2 |
1811 | Find Greatest Common Divisor of 585 and 169, using Euclidean algorithm. | 2 |
1812 | Find Greatest Common Divisor of 19, 29, 35, 36, 44 and 16, using prime factorization. | 2 |
1813 | Find Greatest Common Divisor of 20536. | 2 |
1814 | Find Greatest Common Divisor of 15, 69 and 25, using prime factorization. | 2 |
1815 | Find Greatest Common Divisor of 132 and 250, using prime factorization. | 2 |
1816 | Find Greatest Common Divisor of 55 and 33, using repeated division. | 2 |
1817 | Find Greatest Common Divisor of 28, 38, 52, 54, 68 and 8, using prime factorization. | 2 |
1818 | Find Greatest Common Divisor of 76587 and 836, using Euclidean algorithm. | 2 |
1819 | Find Greatest Common Divisor of 1 and 2, using prime factorization. | 2 |
1820 | Find Greatest Common Divisor of 18, 19 and 22, by listing out the factors. | 2 |
1821 | Find Greatest Common Divisor of 21, 28 and 49, by listing out the factors. | 2 |
1822 | Find Greatest Common Divisor of 44, 62 and 69, using prime factorization. | 2 |
1823 | Find Greatest Common Divisor of 2 and 47, using prime factorization. | 2 |
1824 | Find Greatest Common Divisor of 72. | 2 |
1825 | Find Greatest Common Divisor of 765844 and 8365, using Euclidean algorithm. | 2 |
1826 | Find Greatest Common Divisor of 1 and 9, using prime factorization. | 2 |
1827 | Find Greatest Common Divisor of 330 and 1140, using prime factorization. | 2 |
1828 | Find Greatest Common Divisor of 102, 170 and 255, using repeated division. | 2 |
1829 | Find Greatest Common Divisor of 765844 and 8362, using Euclidean algorithm. | 2 |
1830 | Find Greatest Common Divisor of 1 and 32, using prime factorization. | 2 |
1831 | Find Greatest Common Divisor of 13, 7 and 72, using prime factorization. | 2 |
1832 | Find Greatest Common Divisor of 1348119852 and 1340719926, using prime factorization. | 2 |
1833 | Find Greatest Common Divisor of 1 and 56, using prime factorization. | 2 |
1834 | Find Greatest Common Divisor of 20 and 2, using prime factorization. | 2 |
1835 | Find Greatest Common Divisor of 1 and 100, using Euclidean algorithm. | 2 |
1836 | Find Greatest Common Divisor of 16 and 35, using Euclidean algorithm. | 2 |
1837 | Find Greatest Common Divisor of 2456 and 73, using prime factorization. | 2 |
1838 | Find Greatest Common Divisor of 48 and 30, using Euclidean algorithm. | 2 |
1839 | Find Greatest Common Divisor of 62, 2 and 86, using prime factorization. | 2 |
1840 | Find Greatest Common Divisor of 36243 and 4866, using Euclidean algorithm. | 2 |
1841 | Find Greatest Common Divisor of 84 and 126, using Euclidean algorithm. | 2 |
1842 | Find Greatest Common Divisor of 512 and 186, using prime factorization. | 2 |
1843 | Find Greatest Common Divisor of 894 and 24, using prime factorization. | 2 |
1844 | Find Greatest Common Divisor of 102, 170 and 255, by listing out the factors. | 2 |
1845 | Find Greatest Common Divisor of 18 and 201, using Euclidean algorithm. | 2 |
1846 | Find Greatest Common Divisor of 18, 20 and 26, using prime factorization. | 2 |
1847 | Find Greatest Common Divisor of 28, 32 and 48, using prime factorization. | 2 |
1848 | Find Greatest Common Divisor of 19, 29, 35, 36, 44 and 16, by listing out the factors. | 2 |
1849 | Find Greatest Common Divisor of 57 and 78, using Euclidean algorithm. | 2 |
1850 | Find Greatest Common Divisor of 24 and 15, using Euclidean algorithm. | 2 |