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 45, 83 and 79, using Euclidean algorithm. | 3 |
| 1902 | Find Greatest Common Divisor of 29 and 63, using Euclidean algorithm. | 3 |
| 1903 | Find Greatest Common Divisor of 5. | 3 |
| 1904 | Find Greatest Common Divisor of 47 and 89, using Euclidean algorithm. | 3 |
| 1905 | Find Greatest Common Divisor of 75 and 42, using Euclidean algorithm. | 3 |
| 1906 | Find Greatest Common Divisor of 48 and 59, using Euclidean algorithm. | 3 |
| 1907 | Find Greatest Common Divisor of 44 and 90, by listing out the factors. | 3 |
| 1908 | Find Greatest Common Divisor of 52 and 39, using Euclidean algorithm. | 3 |
| 1909 | Find Greatest Common Divisor of 634 and 472, using Euclidean algorithm. | 3 |
| 1910 | Find Greatest Common Divisor of 25 and 68, using Euclidean algorithm. | 3 |
| 1911 | Find Greatest Common Divisor of 91 and 32, using Euclidean algorithm. | 3 |
| 1912 | Find Greatest Common Divisor of 97 and 29, using Euclidean algorithm. | 3 |
| 1913 | Find Greatest Common Divisor of 23 and 1, using Euclidean algorithm. | 3 |
| 1914 | Find Greatest Common Divisor of 22 and 77, using Euclidean algorithm. | 3 |
| 1915 | Find Greatest Common Divisor of 26 and 76, using Euclidean algorithm. | 3 |
| 1916 | Find Greatest Common Divisor of 85 and 28, using Euclidean algorithm. | 3 |
| 1917 | Find Greatest Common Divisor of 72 and 15, using Euclidean algorithm. | 3 |
| 1918 | Find Greatest Common Divisor of 320 and 240, using prime factorization. | 3 |
| 1919 | Find Greatest Common Divisor of 72 and 82, using Euclidean algorithm. | 3 |
| 1920 | Find Greatest Common Divisor of 1028 and 576, using Euclidean algorithm. | 3 |
| 1921 | Find Greatest Common Divisor of 48, 54 and 84, by listing out the factors. | 3 |
| 1922 | Find Greatest Common Divisor of 34 and 120, using prime factorization. | 3 |
| 1923 | Find Greatest Common Divisor of 36 and 120, using prime factorization. | 3 |
| 1924 | Find Greatest Common Divisor of 315 and 441, using repeated division. | 3 |
| 1925 | Find Greatest Common Divisor of 6666600000 and 6666666666, using Euclidean algorithm. | 3 |
| 1926 | Find Greatest Common Divisor of 1970 and 1066, using Euclidean algorithm. | 3 |
| 1927 | Find Greatest Common Divisor of 80 and 44, using Euclidean algorithm. | 3 |
| 1928 | Find Greatest Common Divisor of 1 and 5, using prime factorization. | 3 |
| 1929 | Find Greatest Common Divisor of 337 and 674, using prime factorization. | 3 |
| 1930 | Find Greatest Common Divisor of 108 and 144, using prime factorization. | 3 |
| 1931 | Find Greatest Common Divisor of 108 and 144, by listing out the factors. | 3 |
| 1932 | Find Greatest Common Divisor of 130 and 115, using Euclidean algorithm. | 3 |
| 1933 | Find Greatest Common Divisor of 123456789 and 987654321, using prime factorization. | 3 |
| 1934 | Find Greatest Common Divisor of 840 and 1080, using prime factorization. | 3 |
| 1935 | Find Greatest Common Divisor of 70, 120 and 217, using prime factorization. | 3 |
| 1936 | Find Greatest Common Divisor of 70 and 120, using Euclidean algorithm. | 3 |
| 1937 | Find Greatest Common Divisor of 113 and 143, using prime factorization. | 3 |
| 1938 | Find Greatest Common Divisor of 14 and 26, using prime factorization. | 3 |
| 1939 | Find Greatest Common Divisor of 83 and 19, using prime factorization. | 3 |
| 1940 | Find Greatest Common Divisor of 144 and 192, using prime factorization. | 3 |
| 1941 | Find Greatest Common Divisor of 841 and 160, using Euclidean algorithm. | 3 |
| 1942 | Find Greatest Common Divisor of 0 and 3, using prime factorization. | 3 |
| 1943 | Find Greatest Common Divisor of 1 and 17, using prime factorization. | 3 |
| 1944 | Find Greatest Common Divisor of 3 and 53, using prime factorization. | 3 |
| 1945 | Find Greatest Common Divisor of 55, 35 and 50, using Euclidean algorithm. | 3 |
| 1946 | Find Greatest Common Divisor of 49 and 168, using prime factorization. | 3 |
| 1947 | Find Greatest Common Divisor of 11520 and 5670, using prime factorization. | 3 |
| 1948 | Find Greatest Common Divisor of 1100 and 57330, using prime factorization. | 3 |
| 1949 | Find Greatest Common Divisor of 30 and 17, using Euclidean algorithm. | 3 |
| 1950 | Find Greatest Common Divisor of 1025 and 35, using prime factorization. | 3 |
