GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1901 | Find Greatest Common Divisor of 7 and 30, using Euclidean algorithm. | 5 |
| 1902 | Find Greatest Common Divisor of 192. | 5 |
| 1903 | Find Greatest Common Divisor of 20789 and 1189, using Euclidean algorithm. | 5 |
| 1904 | Find Greatest Common Divisor of 120000, 144000 and 150000, using prime factorization. | 4 |
| 1905 | Find Greatest Common Divisor of 56 and 98, using prime factorization. | 4 |
| 1906 | Find Greatest Common Divisor of 356 and 25824, using prime factorization. | 4 |
| 1907 | Find Greatest Common Divisor of 54. | 4 |
| 1908 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, using prime factorization. | 4 |
| 1909 | Find Greatest Common Divisor of 96 and 356, using Euclidean algorithm. | 4 |
| 1910 | Find Greatest Common Divisor of 45, 83 and 79, using prime factorization. | 4 |
| 1911 | Find Greatest Common Divisor of 20 and 67, using Euclidean algorithm. | 4 |
| 1912 | Find Greatest Common Divisor of 22 and 33, using Euclidean algorithm. | 4 |
| 1913 | Find Greatest Common Divisor of 5 and 75, using Euclidean algorithm. | 4 |
| 1914 | Find Greatest Common Divisor of 1204 and 2400, using prime factorization. | 4 |
| 1915 | Find Greatest Common Divisor of 72, 108 and 2100, using prime factorization. | 4 |
| 1916 | Find Greatest Common Divisor of 25 and 49, using prime factorization. | 4 |
| 1917 | Find Greatest Common Divisor of 83 and 47, using prime factorization. | 4 |
| 1918 | Find Greatest Common Divisor of 4, 3 and 49, using prime factorization. | 4 |
| 1919 | Find Greatest Common Divisor of 140 and 320, using prime factorization. | 4 |
| 1920 | Find Greatest Common Divisor of 200 and 300, using prime factorization. | 4 |
| 1921 | Find Greatest Common Divisor of 130 and 115, using prime factorization. | 4 |
| 1922 | Find Greatest Common Divisor of 90 and 126, using prime factorization. | 4 |
| 1923 | Find Greatest Common Divisor of 34 and 55, using Euclidean algorithm. | 4 |
| 1924 | Find Greatest Common Divisor of 3120 and 17, by listing out the factors. | 4 |
| 1925 | Find Greatest Common Divisor of 8976 and 345, using Euclidean algorithm. | 4 |
| 1926 | Find Greatest Common Divisor of 18, 45 and 6, using prime factorization. | 4 |
| 1927 | Find Greatest Common Divisor of 10 and 9, using prime factorization. | 4 |
| 1928 | Find Greatest Common Divisor of 48 and 18, using repeated division. | 4 |
| 1929 | Find Greatest Common Divisor of 1 and 19, using prime factorization. | 4 |
| 1930 | Find Greatest Common Divisor of 15 and 35, using prime factorization. | 4 |
| 1931 | Find Greatest Common Divisor of 33728 and 26880, using prime factorization. | 4 |
| 1932 | Find Greatest Common Divisor of 427 and 321, using prime factorization. | 4 |
| 1933 | Find Greatest Common Divisor of 18 and 38, using prime factorization. | 4 |
| 1934 | Find Greatest Common Divisor of 289 and 377, using prime factorization. | 4 |
| 1935 | Find Greatest Common Divisor of 54, 60 and 45, using Euclidean algorithm. | 4 |
| 1936 | Find Greatest Common Divisor of 1 and 1, using prime factorization. | 4 |
| 1937 | Find Greatest Common Divisor of 77 and 30, using Euclidean algorithm. | 4 |
| 1938 | Find Greatest Common Divisor of 66 and 150, using prime factorization. | 4 |
| 1939 | Find Greatest Common Divisor of 792 and 275, using Euclidean algorithm. | 4 |
| 1940 | Find Greatest Common Divisor of 8 and 12, using Euclidean algorithm. | 4 |
| 1941 | Find Greatest Common Divisor of 168 and 504, using Euclidean algorithm. | 4 |
| 1942 | Find Greatest Common Divisor of 244 and 292, using Euclidean algorithm. | 4 |
| 1943 | Find Greatest Common Divisor of 31415 and 14142, using repeated division. | 4 |
| 1944 | Find Greatest Common Divisor of 3 and 5, using Euclidean algorithm. | 4 |
| 1945 | Find Greatest Common Divisor of 4655 and 12075, using Euclidean algorithm. | 4 |
| 1946 | Find Greatest Common Divisor of 685, 192 and 189, using prime factorization. | 4 |
| 1947 | Find Greatest Common Divisor of 2533 and 466, using Euclidean algorithm. | 4 |
| 1948 | Find Greatest Common Divisor of 13 and 7, using prime factorization. | 4 |
| 1949 | Find Greatest Common Divisor of 10 and 3, using Euclidean algorithm. | 4 |
| 1950 | Find Greatest Common Divisor of 24 and 48, by listing out the factors. | 4 |
