GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1951 | Find Greatest Common Divisor of 24 and 69, using Euclidean algorithm. | 3 |
| 1952 | Find Greatest Common Divisor of 160 and 3, using prime factorization. | 3 |
| 1953 | Find Greatest Common Divisor of 3, 2 and 2, using prime factorization. | 3 |
| 1954 | Find Greatest Common Divisor of 2024 and 1058, using Euclidean algorithm. | 3 |
| 1955 | Find Greatest Common Divisor of 3 and 20, using prime factorization. | 3 |
| 1956 | Find Greatest Common Divisor of 17 and 3120, using repeated division. | 3 |
| 1957 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using Euclidean algorithm. | 3 |
| 1958 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using repeated division. | 3 |
| 1959 | Find Greatest Common Divisor of 17 and 34, using repeated division. | 3 |
| 1960 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using repeated division. | 3 |
| 1961 | Find Greatest Common Divisor of 6468 and 14300, using prime factorization. | 3 |
| 1962 | Find Greatest Common Divisor of 160 and 7, using repeated division. | 3 |
| 1963 | Find Greatest Common Divisor of 2 and 1, using prime factorization. | 3 |
| 1964 | Find Greatest Common Divisor of 7 and 40, using prime factorization. | 3 |
| 1965 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using prime factorization. | 3 |
| 1966 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, by listing out the factors. | 3 |
| 1967 | Find Greatest Common Divisor of 192, 256 and 304, using prime factorization. | 3 |
| 1968 | Find Greatest Common Divisor of 27, 80, 108, 20 and 75, using prime factorization. | 3 |
| 1969 | Find Greatest Common Divisor of 21 and 2511, using Euclidean algorithm. | 3 |
| 1970 | Find Greatest Common Divisor of 110 and 2511, using Euclidean algorithm. | 3 |
| 1971 | Find Greatest Common Divisor of 105 and 120, using prime factorization. | 3 |
| 1972 | Find Greatest Common Divisor of 112 and 144, using prime factorization. | 3 |
| 1973 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, using prime factorization. | 3 |
| 1974 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, by listing out the factors. | 3 |
| 1975 | Find Greatest Common Divisor of 115 and 184, using prime factorization. | 3 |
| 1976 | Find Greatest Common Divisor of 28 and 52, using Euclidean algorithm. | 3 |
| 1977 | Find Greatest Common Divisor of 52 and 54, using repeated division. | 3 |
| 1978 | Find Greatest Common Divisor of 3. | 3 |
| 1979 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, by listing out the factors. | 3 |
| 1980 | Find Greatest Common Divisor of 291 and 252, using repeated division. | 3 |
| 1981 | Find Greatest Common Divisor of 3219 and 74, using Euclidean algorithm. | 3 |
| 1982 | Find Greatest Common Divisor of 2024 and 748, using Euclidean algorithm. | 3 |
| 1983 | Find Greatest Common Divisor of 16 and 31, using Euclidean algorithm. | 3 |
| 1984 | Find Greatest Common Divisor of 16 and 31, using repeated division. | 3 |
| 1985 | Find Greatest Common Divisor of 20240605010777. | 3 |
| 1986 | Find Greatest Common Divisor of 20240605010778. | 3 |
| 1987 | Find Greatest Common Divisor of 419 and 105, using Euclidean algorithm. | 3 |
| 1988 | Find Greatest Common Divisor of 645 and 363, using Euclidean algorithm. | 3 |
| 1989 | Find Greatest Common Divisor of 49152 and 81000, using prime factorization. | 3 |
| 1990 | Find Greatest Common Divisor of 512 and 18, using Euclidean algorithm. | 3 |
| 1991 | Find Greatest Common Divisor of 1160718174. | 3 |
| 1992 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using repeated division. | 3 |
| 1993 | Find Greatest Common Divisor of 21 and 91, using prime factorization. | 3 |
| 1994 | Find Greatest Common Divisor of 89 and 98, using Euclidean algorithm. | 3 |
| 1995 | Find Greatest Common Divisor of 8, 13, 39, 42 and 48, by listing out the factors. | 3 |
| 1996 | Find Greatest Common Divisor of 44 and 17, using Euclidean algorithm. | 3 |
| 1997 | Find Greatest Common Divisor of 403, 465 and 651, using prime factorization. | 3 |
| 1998 | Find Greatest Common Divisor of 143 and 277, using Euclidean algorithm. | 3 |
| 1999 | Find Greatest Common Divisor of 18, 24 and 30, using prime factorization. | 3 |
| 2000 | Find Greatest Common Divisor of 10 and 14, using repeated division. | 3 |
