GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1851 | Find Greatest Common Divisor of 2282 and 420, using repeated division. | 2 |
1852 | Find Greatest Common Divisor of 25, 16 and 10, using prime factorization. | 2 |
1853 | Find Greatest Common Divisor of 12378 and 3054, using prime factorization. | 2 |
1854 | Find Greatest Common Divisor of 3 and 53, using Euclidean algorithm. | 2 |
1855 | Find Greatest Common Divisor of 18, 20 and 16, using prime factorization. | 2 |
1856 | Find Greatest Common Divisor of 8, 12 and 30, using prime factorization. | 2 |
1857 | Find Greatest Common Divisor of 780 and 224, using repeated division. | 2 |
1858 | Find Greatest Common Divisor of 3 and 53, using repeated division. | 2 |
1859 | Find Greatest Common Divisor of 32, 48 and 44, using prime factorization. | 2 |
1860 | Find Greatest Common Divisor of 290184 and 351, using prime factorization. | 2 |
1861 | Find Greatest Common Divisor of 106 and 63, using prime factorization. | 2 |
1862 | Find Greatest Common Divisor of 19 and 99, using prime factorization. | 2 |
1863 | Find Greatest Common Divisor of 8, 13, 39, 42 and 48, using prime factorization. | 2 |
1864 | Find Greatest Common Divisor of 19 and 3, using Euclidean algorithm. | 2 |
1865 | Find Greatest Common Divisor of 123 and 7, using Euclidean algorithm. | 2 |
1866 | Find Greatest Common Divisor of 2672, 1 and 67, using prime factorization. | 2 |
1867 | Find Greatest Common Divisor of 14 and 9, using Euclidean algorithm. | 2 |
1868 | Find Greatest Common Divisor of 36, 72 and 102, by listing out the factors. | 2 |
1869 | Find Greatest Common Divisor of 12, 116, 56 and 764, using prime factorization. | 2 |
1870 | Find Greatest Common Divisor of 296, 703 and 814, using prime factorization. | 2 |
1871 | Find Greatest Common Divisor of 312 and 418, using Euclidean algorithm. | 2 |
1872 | Find Greatest Common Divisor of 3 and 53, by listing out the factors. | 2 |
1873 | Find Greatest Common Divisor of 503, 1101 and 2002, by listing out the factors. | 2 |
1874 | Find Greatest Common Divisor of 296, 703 and 814, by listing out the factors. | 2 |
1875 | Find Greatest Common Divisor of 1573 and 2145, using prime factorization. | 2 |
1876 | Find Greatest Common Divisor of 8, 13, 39, 42, 48 and 11, by listing out the factors. | 2 |
1877 | Find Greatest Common Divisor of 21, 42 and 84, using repeated division. | 2 |
1878 | Find Greatest Common Divisor of 13 and 93, using Euclidean algorithm. | 2 |
1879 | Find Greatest Common Divisor of 48 and 63, using prime factorization. | 2 |
1880 | Find Greatest Common Divisor of 2282 and 420, using Euclidean algorithm. | 2 |
1881 | Find Greatest Common Divisor of 8, 13, 39, 42, 48 and 11, using prime factorization. | 2 |
1882 | Find Greatest Common Divisor of 42, 432 and 240, using prime factorization. | 2 |
1883 | Find Greatest Common Divisor of 20111 and 20222, using prime factorization. | 2 |
1884 | Find Greatest Common Divisor of 49, 91 and 70, using repeated division. | 2 |
1885 | Find Greatest Common Divisor of 18, 24, 3 and 53, by listing out the factors. | 2 |
1886 | Find Greatest Common Divisor of 12 and 40, using prime factorization. | 2 |
1887 | Find Greatest Common Divisor of 66 and 11, using Euclidean algorithm. | 2 |
1888 | Find Greatest Common Divisor of 44 and 67, using Euclidean algorithm. | 2 |
1889 | Find Greatest Common Divisor of 42, 432 and 240, using repeated division. | 2 |
1890 | Find Greatest Common Divisor of 6666600000 and 6666666666, using prime factorization. | 2 |
1891 | Find Greatest Common Divisor of 24 and 36, using prime factorization. | 2 |
1892 | Find Greatest Common Divisor of 18, 24, 3 and 53, using repeated division. | 2 |
1893 | Find Greatest Common Divisor of 88, 37 and 21, using prime factorization. | 2 |
1894 | Find Greatest Common Divisor of 42, 432 and 240, using Euclidean algorithm. | 2 |
1895 | Find Greatest Common Divisor of 47 and 11, using Euclidean algorithm. | 2 |
1896 | Find Greatest Common Divisor of 11 and 8, using Euclidean algorithm. | 2 |
1897 | Find Greatest Common Divisor of 4284 and 8219, using prime factorization. | 2 |
1898 | Find Greatest Common Divisor of 23 and 88, using Euclidean algorithm. | 2 |
1899 | Find Greatest Common Divisor of 6666600000 and 6666666666, using repeated division. | 2 |
1900 | Find Greatest Common Divisor of 18, 24, 3 and 53, using prime factorization. | 2 |