GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1901 | Find Greatest Common Divisor of 19 and 8, using Euclidean algorithm. | 2 |
1902 | Find Greatest Common Divisor of 125 and 728, using repeated division. | 2 |
1903 | Find Greatest Common Divisor of 72, 60 and 56, using prime factorization. | 2 |
1904 | Find Greatest Common Divisor of 44 and 92, using Euclidean algorithm. | 2 |
1905 | Find Greatest Common Divisor of 1176. | 2 |
1906 | Find Greatest Common Divisor of 56, 42 and 98, using prime factorization. | 2 |
1907 | Find Greatest Common Divisor of 1176. | 2 |
1908 | Find Greatest Common Divisor of 18, 24 and 247, using prime factorization. | 2 |
1909 | Find Greatest Common Divisor of 125 and 728, using Euclidean algorithm. | 2 |
1910 | Find Greatest Common Divisor of 65537 and 65539, using Euclidean algorithm. | 2 |
1911 | Find Greatest Common Divisor of 2486625522 and 41582215163, by listing out the factors. | 2 |
1912 | Find Greatest Common Divisor of 60 and 36, using Euclidean algorithm. | 2 |
1913 | Find Greatest Common Divisor of 47 and 81, using Euclidean algorithm. | 2 |
1914 | Find Greatest Common Divisor of 18, 24 and 241, using prime factorization. | 2 |
1915 | Find Greatest Common Divisor of 2 and 0, using repeated division. | 2 |
1916 | Find Greatest Common Divisor of 1, 9, 2, 4, 4 and 30, using prime factorization. | 2 |
1917 | Find Greatest Common Divisor of 60 and 36, by listing out the factors. | 2 |
1918 | Find Greatest Common Divisor of 159 and 45, using prime factorization. | 2 |
1919 | Find Greatest Common Divisor of 25, 10 and 92, using prime factorization. | 2 |
1920 | Find Greatest Common Divisor of 18, 24, 10 and 43, using prime factorization. | 2 |
1921 | Find Greatest Common Divisor of 145 and 15, using Euclidean algorithm. | 2 |
1922 | Find Greatest Common Divisor of 36 and 104, using Euclidean algorithm. | 2 |
1923 | Find Greatest Common Divisor of 10 and 43, using prime factorization. | 2 |
1924 | Find Greatest Common Divisor of 940 and 56, using prime factorization. | 2 |
1925 | Find Greatest Common Divisor of 36 and 233, using Euclidean algorithm. | 2 |
1926 | Find Greatest Common Divisor of 2517 and 2370, using prime factorization. | 2 |
1927 | Find Greatest Common Divisor of 221 and 405, using prime factorization. | 2 |
1928 | Find Greatest Common Divisor of 91 and 35, using Euclidean algorithm. | 2 |
1929 | Find Greatest Common Divisor of 950 and 600, using prime factorization. | 2 |
1930 | Find Greatest Common Divisor of 63018702 and 11388300, using Euclidean algorithm. | 2 |
1931 | Find Greatest Common Divisor of 940 and 56, using Euclidean algorithm. | 2 |
1932 | Find Greatest Common Divisor of 77 and 43, using prime factorization. | 2 |
1933 | Find Greatest Common Divisor of 218, 908, 36, 124, 144, 180, 49, 60, 150 and 4, using prime factorization. | 2 |
1934 | Find Greatest Common Divisor of 145, 15 and 5, using Euclidean algorithm. | 2 |
1935 | Find Greatest Common Divisor of 589432167. | 2 |
1936 | Find Greatest Common Divisor of 321685687669321 and 64570081, using prime factorization. | 2 |
1937 | Find Greatest Common Divisor of 56, 91 and 3, using prime factorization. | 2 |
1938 | Find Greatest Common Divisor of 2835 and 8960, using prime factorization. | 2 |
1939 | Find Greatest Common Divisor of 4. | 2 |
1940 | Find Greatest Common Divisor of 77 and 43, using repeated division. | 2 |
1941 | Find Greatest Common Divisor of 86 and 47, using Euclidean algorithm. | 2 |
1942 | Find Greatest Common Divisor of 64 and 2, using Euclidean algorithm. | 2 |
1943 | Find Greatest Common Divisor of 39, 65 and 91, using prime factorization. | 2 |
1944 | Find Greatest Common Divisor of 54 and 21, using Euclidean algorithm. | 2 |
1945 | Find Greatest Common Divisor of 28 and 294, using prime factorization. | 2 |
1946 | Find Greatest Common Divisor of 4. | 2 |
1947 | Find Greatest Common Divisor of 1235 and 765, using Euclidean algorithm. | 2 |
1948 | Find Greatest Common Divisor of 19, 35 and 34, using prime factorization. | 2 |
1949 | Find Greatest Common Divisor of 124 and 360, using Euclidean algorithm. | 2 |
1950 | Find Greatest Common Divisor of 4, 34, 7, 19 and 6, using Euclidean algorithm. | 2 |