GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1951 | Find Greatest Common Divisor of 158 and 57, using Euclidean algorithm. | 1 |
1952 | Find Greatest Common Divisor of 13 and 226, using Euclidean algorithm. | 1 |
1953 | Find Greatest Common Divisor of 15400 and 735, using prime factorization. | 1 |
1954 | Find Greatest Common Divisor of 19. | 1 |
1955 | Find Greatest Common Divisor of 505 and 189, using prime factorization. | 1 |
1956 | Find Greatest Common Divisor of 8 and 5, using repeated division. | 1 |
1957 | Find Greatest Common Divisor of 35 and 47, using Euclidean algorithm. | 1 |
1958 | Find Greatest Common Divisor of 547 and 189, using Euclidean algorithm. | 1 |
1959 | Find Greatest Common Divisor of 3, 4, 4 and 15, using prime factorization. | 1 |
1960 | Find Greatest Common Divisor of 294 and 343, using Euclidean algorithm. | 1 |
1961 | Find Greatest Common Divisor of 125 and 100, using repeated division. | 1 |
1962 | Find Greatest Common Divisor of 10 and 4, using Euclidean algorithm. | 1 |
1963 | Find Greatest Common Divisor of 82 and 145, using Euclidean algorithm. | 1 |
1964 | Find Greatest Common Divisor of 37 and 160, using prime factorization. | 1 |
1965 | Find Greatest Common Divisor of 682 and 496, using Euclidean algorithm. | 1 |
1966 | Find Greatest Common Divisor of 196 and 245, using Euclidean algorithm. | 1 |
1967 | Find Greatest Common Divisor of 0, 132 and 763, by listing out the factors. | 1 |
1968 | Find Greatest Common Divisor of 72 and 44, using Euclidean algorithm. | 1 |
1969 | Find Greatest Common Divisor of 702 and 936, using Euclidean algorithm. | 1 |
1970 | Find Greatest Common Divisor of 682 and 496, using repeated division. | 1 |
1971 | Find Greatest Common Divisor of 2435 and 342, using Euclidean algorithm. | 1 |
1972 | Find Greatest Common Divisor of 262 and 851, using Euclidean algorithm. | 1 |
1973 | Find Greatest Common Divisor of 682 and 496, by listing out the factors. | 1 |
1974 | Find Greatest Common Divisor of 7684 and 4148, using prime factorization. | 1 |
1975 | Find Greatest Common Divisor of 1586 and 899, using Euclidean algorithm. | 1 |
1976 | Find Greatest Common Divisor of 1235 and 765, by listing out the factors. | 1 |
1977 | Find Greatest Common Divisor of 16 and 23, using Euclidean algorithm. | 1 |
1978 | Find Greatest Common Divisor of 999 and 19, using Euclidean algorithm. | 1 |
1979 | Find Greatest Common Divisor of 1110 and 0, using prime factorization. | 1 |
1980 | Find Greatest Common Divisor of 401 and 700, using prime factorization. | 1 |
1981 | Find Greatest Common Divisor of 7684 and 4148, using Euclidean algorithm. | 1 |
1982 | Find Greatest Common Divisor of 1000 and 539, using prime factorization. | 1 |
1983 | Find Greatest Common Divisor of 16, 72 and 80, using prime factorization. | 1 |
1984 | Find Greatest Common Divisor of 8 and 11, using Euclidean algorithm. | 1 |
1985 | Find Greatest Common Divisor of 270 and 192, using repeated division. | 1 |
1986 | Find Greatest Common Divisor of 2024. | 1 |
1987 | Find Greatest Common Divisor of 710 and 310, using Euclidean algorithm. | 1 |
1988 | Find Greatest Common Divisor of 972 and 1170, using Euclidean algorithm. | 1 |
1989 | Find Greatest Common Divisor of 57 and 0, using Euclidean algorithm. | 1 |
1990 | Find Greatest Common Divisor of 321 and 427, using prime factorization. | 1 |
1991 | Find Greatest Common Divisor of 388, 576 and 7164, using Euclidean algorithm. | 1 |
1992 | Find Greatest Common Divisor of 126 and 18, using prime factorization. | 1 |
1993 | Find Greatest Common Divisor of 8, 57 and 34, using prime factorization. | 1 |
1994 | Find Greatest Common Divisor of 84 and 36, using prime factorization. | 1 |
1995 | Find Greatest Common Divisor of 345 and 587, using Euclidean algorithm. | 1 |
1996 | Find Greatest Common Divisor of 5317 and 899, using prime factorization. | 1 |
1997 | Find Greatest Common Divisor of 1547 and 3536, using prime factorization. | 1 |
1998 | Find Greatest Common Divisor of 126 and 18, using Euclidean algorithm. | 1 |
1999 | Find Greatest Common Divisor of 68, 77 and 80, using prime factorization. | 1 |
2000 | Find Greatest Common Divisor of 36 and 24, using Euclidean algorithm. | 1 |