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 414 and 1035, using prime factorization. | 4 |
| 1952 | Find Greatest Common Divisor of 270 and 192, using prime factorization. | 4 |
| 1953 | Find Greatest Common Divisor of 941688 and 133980, by listing out the factors. | 4 |
| 1954 | Find Greatest Common Divisor of 36 and 24, using Euclidean algorithm. | 4 |
| 1955 | Find Greatest Common Divisor of 623 and 935, using prime factorization. | 4 |
| 1956 | Find Greatest Common Divisor of 77 and 110, using Euclidean algorithm. | 4 |
| 1957 | Find Greatest Common Divisor of 9 and 1680, using prime factorization. | 4 |
| 1958 | Find Greatest Common Divisor of 648 and 124, using Euclidean algorithm. | 4 |
| 1959 | Find Greatest Common Divisor of 4. | 4 |
| 1960 | Find Greatest Common Divisor of 316 and 180, using Euclidean algorithm. | 4 |
| 1961 | Find Greatest Common Divisor of 3532 and 3288, using Euclidean algorithm. | 4 |
| 1962 | Find Greatest Common Divisor of 18, 24 and 12, using prime factorization. | 4 |
| 1963 | Find Greatest Common Divisor of 504 and 385, using prime factorization. | 4 |
| 1964 | Find Greatest Common Divisor of 1001 and 1331, using prime factorization. | 4 |
| 1965 | Find Greatest Common Divisor of 9888 and 6060, using prime factorization. | 4 |
| 1966 | Find Greatest Common Divisor of 12 and 15, by listing out the factors. | 4 |
| 1967 | Find Greatest Common Divisor of 1769 and 2378, using Euclidean algorithm. | 4 |
| 1968 | Find Greatest Common Divisor of 91 and 287, using Euclidean algorithm. | 4 |
| 1969 | Find Greatest Common Divisor of 12 and 88, using Euclidean algorithm. | 4 |
| 1970 | Find Greatest Common Divisor of 15 and 88, using Euclidean algorithm. | 4 |
| 1971 | Find Greatest Common Divisor of 1529 and 14038, using Euclidean algorithm. | 4 |
| 1972 | Find Greatest Common Divisor of 11 and 72, using prime factorization. | 4 |
| 1973 | Find Greatest Common Divisor of 1022 and 400, using prime factorization. | 4 |
| 1974 | Find Greatest Common Divisor of 1 and 91, using prime factorization. | 4 |
| 1975 | Find Greatest Common Divisor of 48 and 88, using prime factorization. | 4 |
| 1976 | Find Greatest Common Divisor of 7, 62, 8 and 52, using prime factorization. | 4 |
| 1977 | Find Greatest Common Divisor of 2447 and 3997, using Euclidean algorithm. | 4 |
| 1978 | Find Greatest Common Divisor of 35 and 14, using Euclidean algorithm. | 4 |
| 1979 | Find Greatest Common Divisor of 483 and 360, using Euclidean algorithm. | 4 |
| 1980 | Find Greatest Common Divisor of 301981 and 449573, using prime factorization. | 4 |
| 1981 | Find Greatest Common Divisor of 7 and 8, using prime factorization. | 4 |
| 1982 | Find Greatest Common Divisor of 64. | 4 |
| 1983 | Find Greatest Common Divisor of 4 and 9, using prime factorization. | 4 |
| 1984 | Find Greatest Common Divisor of 63 and 77, using prime factorization. | 4 |
| 1985 | Find Greatest Common Divisor of 1000 and 750, using prime factorization. | 4 |
| 1986 | Find Greatest Common Divisor of 5. | 4 |
| 1987 | Find Greatest Common Divisor of 17 and 3120, by listing out the factors. | 4 |
| 1988 | Find Greatest Common Divisor of 17 and 34, using Euclidean algorithm. | 4 |
| 1989 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, by listing out the factors. | 4 |
| 1990 | Find Greatest Common Divisor of 0 and 8, using prime factorization. | 4 |
| 1991 | Find Greatest Common Divisor of 24, 45 and 5, using prime factorization. | 4 |
| 1992 | Find Greatest Common Divisor of 628 and 2260, using prime factorization. | 4 |
| 1993 | Find Greatest Common Divisor of 20240605010775. | 4 |
| 1994 | Find Greatest Common Divisor of 5, 70, 1 and 84, using repeated division. | 4 |
| 1995 | Find Greatest Common Divisor of 5, 70, 1 and 84, using Euclidean algorithm. | 4 |
| 1996 | Find Greatest Common Divisor of 11 and 20, using prime factorization. | 4 |
| 1997 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using prime factorization. | 4 |
| 1998 | Find Greatest Common Divisor of 24140 and 16762, using prime factorization. | 4 |
| 1999 | Find Greatest Common Divisor of 216, 900, 36, 120, 144, 108, 49, 60, 150 and 25, using prime factorization. | 4 |
| 2000 | Find Greatest Common Divisor of 6 and 10, using Euclidean algorithm. | 4 |
