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 2 and 80, using prime factorization. | 4 |
| 1952 | Find Greatest Common Divisor of 15, 20 and 30, using prime factorization. | 4 |
| 1953 | Find Greatest Common Divisor of 11, 8, 10 and 5, using prime factorization. | 4 |
| 1954 | Find Greatest Common Divisor of 186 and 20, using prime factorization. | 4 |
| 1955 | Find Greatest Common Divisor of 4 and 1000, using prime factorization. | 4 |
| 1956 | Find Greatest Common Divisor of 1, 2, 3 and 7, by listing out the factors. | 4 |
| 1957 | Find Greatest Common Divisor of 206 and 12, using prime factorization. | 4 |
| 1958 | Find Greatest Common Divisor of 88 and 6, using prime factorization. | 4 |
| 1959 | Find Greatest Common Divisor of 5 and 360, using prime factorization. | 4 |
| 1960 | Find Greatest Common Divisor of 120000, 144000 and 150000, using prime factorization. | 4 |
| 1961 | Find Greatest Common Divisor of 8991 and 12345, using Euclidean algorithm. | 4 |
| 1962 | Find Greatest Common Divisor of 5, 35 and 40, using prime factorization. | 4 |
| 1963 | Find Greatest Common Divisor of 13, 52 and 78, using prime factorization. | 4 |
| 1964 | Find Greatest Common Divisor of 15, 16 and 18, using prime factorization. | 4 |
| 1965 | Find Greatest Common Divisor of 142 and 84, using Euclidean algorithm. | 4 |
| 1966 | Find Greatest Common Divisor of 8, 12 and 18, using repeated division. | 4 |
| 1967 | Find Greatest Common Divisor of 637 and 588, using prime factorization. | 4 |
| 1968 | Find Greatest Common Divisor of 289 and 300, using prime factorization. | 4 |
| 1969 | Find Greatest Common Divisor of 18, 25 and 8, using prime factorization. | 4 |
| 1970 | Find Greatest Common Divisor of 31426 and 100000, using prime factorization. | 4 |
| 1971 | Find Greatest Common Divisor of 2. | 4 |
| 1972 | Find Greatest Common Divisor of 180 and 225, using repeated division. | 4 |
| 1973 | Find Greatest Common Divisor of 18, 36 and 60, using prime factorization. | 4 |
| 1974 | Find Greatest Common Divisor of 1876 and 342, using Euclidean algorithm. | 4 |
| 1975 | Find Greatest Common Divisor of 1045 and 1265, using prime factorization. | 4 |
| 1976 | Find Greatest Common Divisor of 15090 and 10090, using Euclidean algorithm. | 4 |
| 1977 | Find Greatest Common Divisor of 15150 and 10150, using Euclidean algorithm. | 4 |
| 1978 | Find Greatest Common Divisor of 15170 and 10170, using Euclidean algorithm. | 4 |
| 1979 | Find Greatest Common Divisor of 15190 and 10190, using Euclidean algorithm. | 4 |
| 1980 | Find Greatest Common Divisor of 15230 and 10230, using Euclidean algorithm. | 4 |
| 1981 | Find Greatest Common Divisor of 15250 and 10250, using Euclidean algorithm. | 4 |
| 1982 | Find Greatest Common Divisor of 15350 and 10350, using Euclidean algorithm. | 4 |
| 1983 | Find Greatest Common Divisor of 15370 and 10370, using Euclidean algorithm. | 4 |
| 1984 | Find Greatest Common Divisor of 15390 and 10390, using Euclidean algorithm. | 4 |
| 1985 | Find Greatest Common Divisor of 15410 and 10410, using Euclidean algorithm. | 4 |
| 1986 | Find Greatest Common Divisor of 15490 and 10490, using Euclidean algorithm. | 4 |
| 1987 | Find Greatest Common Divisor of 15570 and 10570, using Euclidean algorithm. | 4 |
| 1988 | Find Greatest Common Divisor of 15590 and 10590, using Euclidean algorithm. | 4 |
| 1989 | Find Greatest Common Divisor of 15750 and 10750, using Euclidean algorithm. | 4 |
| 1990 | Find Greatest Common Divisor of 16050 and 11050, using Euclidean algorithm. | 4 |
| 1991 | Find Greatest Common Divisor of 16070 and 11070, using Euclidean algorithm. | 4 |
| 1992 | Find Greatest Common Divisor of 16170 and 11170, using Euclidean algorithm. | 4 |
| 1993 | Find Greatest Common Divisor of 16470 and 11470, using Euclidean algorithm. | 4 |
| 1994 | Find Greatest Common Divisor of 16490 and 11490, using Euclidean algorithm. | 4 |
| 1995 | Find Greatest Common Divisor of 16510 and 11510, using Euclidean algorithm. | 4 |
| 1996 | Find Greatest Common Divisor of 16530 and 11530, using Euclidean algorithm. | 4 |
| 1997 | Find Greatest Common Divisor of 16590 and 11590, using Euclidean algorithm. | 4 |
| 1998 | Find Greatest Common Divisor of 16610 and 11610, using Euclidean algorithm. | 4 |
| 1999 | Find Greatest Common Divisor of 16630 and 11630, using Euclidean algorithm. | 4 |
| 2000 | Find Greatest Common Divisor of 16670 and 11670, using Euclidean algorithm. | 4 |
