GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1851 | Find Greatest Common Divisor of 54. | 4 |
| 1852 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, using prime factorization. | 4 |
| 1853 | Find Greatest Common Divisor of 96 and 356, using Euclidean algorithm. | 4 |
| 1854 | Find Greatest Common Divisor of 45, 83 and 79, using prime factorization. | 4 |
| 1855 | Find Greatest Common Divisor of 20 and 67, using Euclidean algorithm. | 4 |
| 1856 | Find Greatest Common Divisor of 22 and 33, using Euclidean algorithm. | 4 |
| 1857 | Find Greatest Common Divisor of 5 and 75, using Euclidean algorithm. | 4 |
| 1858 | Find Greatest Common Divisor of 1204 and 2400, using prime factorization. | 4 |
| 1859 | Find Greatest Common Divisor of 72, 108 and 2100, using prime factorization. | 4 |
| 1860 | Find Greatest Common Divisor of 25 and 49, using prime factorization. | 4 |
| 1861 | Find Greatest Common Divisor of 83 and 47, using prime factorization. | 4 |
| 1862 | Find Greatest Common Divisor of 4, 3 and 49, using prime factorization. | 4 |
| 1863 | Find Greatest Common Divisor of 140 and 320, using prime factorization. | 4 |
| 1864 | Find Greatest Common Divisor of 200 and 300, using prime factorization. | 4 |
| 1865 | Find Greatest Common Divisor of 130 and 115, using prime factorization. | 4 |
| 1866 | Find Greatest Common Divisor of 90 and 126, using prime factorization. | 4 |
| 1867 | Find Greatest Common Divisor of 34 and 55, using Euclidean algorithm. | 4 |
| 1868 | Find Greatest Common Divisor of 8976 and 345, using Euclidean algorithm. | 4 |
| 1869 | Find Greatest Common Divisor of 18, 45 and 6, using prime factorization. | 4 |
| 1870 | Find Greatest Common Divisor of 48 and 18, using repeated division. | 4 |
| 1871 | Find Greatest Common Divisor of 1 and 19, using prime factorization. | 4 |
| 1872 | Find Greatest Common Divisor of 414 and 662, by listing out the factors. | 4 |
| 1873 | Find Greatest Common Divisor of 33728 and 26880, using prime factorization. | 4 |
| 1874 | Find Greatest Common Divisor of 427 and 321, using prime factorization. | 4 |
| 1875 | Find Greatest Common Divisor of 54, 60 and 45, using Euclidean algorithm. | 4 |
| 1876 | Find Greatest Common Divisor of 1 and 1, using prime factorization. | 4 |
| 1877 | Find Greatest Common Divisor of 77 and 30, using Euclidean algorithm. | 4 |
| 1878 | Find Greatest Common Divisor of 66 and 150, using prime factorization. | 4 |
| 1879 | Find Greatest Common Divisor of 792 and 275, using Euclidean algorithm. | 4 |
| 1880 | Find Greatest Common Divisor of 8 and 12, using Euclidean algorithm. | 4 |
| 1881 | Find Greatest Common Divisor of 168 and 504, using Euclidean algorithm. | 4 |
| 1882 | Find Greatest Common Divisor of 244 and 292, using Euclidean algorithm. | 4 |
| 1883 | Find Greatest Common Divisor of 31415 and 14142, using repeated division. | 4 |
| 1884 | Find Greatest Common Divisor of 4655 and 12075, using Euclidean algorithm. | 4 |
| 1885 | Find Greatest Common Divisor of 685, 192 and 189, using prime factorization. | 4 |
| 1886 | Find Greatest Common Divisor of 2533 and 466, using Euclidean algorithm. | 4 |
| 1887 | Find Greatest Common Divisor of 13 and 7, using prime factorization. | 4 |
| 1888 | Find Greatest Common Divisor of 315, 5, 2 and 2, using repeated division. | 3 |
| 1889 | Find Greatest Common Divisor of 315, 5, 2 and 2, by listing out the factors. | 3 |
| 1890 | Find Greatest Common Divisor of 315, 5, 2 and 2, using Euclidean algorithm. | 3 |
| 1891 | Find Greatest Common Divisor of 54 and 42, using prime factorization. | 3 |
| 1892 | Find Greatest Common Divisor of 123 and 297, using Euclidean algorithm. | 3 |
| 1893 | Find Greatest Common Divisor of 114 and 324, using Euclidean algorithm. | 3 |
| 1894 | Find Greatest Common Divisor of 77, 33 and 22, using prime factorization. | 3 |
| 1895 | Find Greatest Common Divisor of 42823 and 6409, using Euclidean algorithm. | 3 |
| 1896 | Find Greatest Common Divisor of 1638 and 2036, using prime factorization. | 3 |
| 1897 | Find Greatest Common Divisor of 54796 and 605, using Euclidean algorithm. | 3 |
| 1898 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, by listing out the factors. | 3 |
| 1899 | Find Greatest Common Divisor of 26 and 7, using Euclidean algorithm. | 3 |
| 1900 | Find Greatest Common Divisor of 1. | 3 |
