GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7951 | Find Greatest Common Divisor of 735 and 294, using prime factorization. | 1 |
| 7952 | Find Greatest Common Divisor of 1512 and 3780, using repeated division. | 1 |
| 7953 | Find Greatest Common Divisor of 2808, 1620 and 3132, using repeated division. | 1 |
| 7954 | Find Greatest Common Divisor of 35 and 48, using prime factorization. | 1 |
| 7955 | Find Greatest Common Divisor of 12 and 3, using Euclidean algorithm. | 1 |
| 7956 | Find Greatest Common Divisor of 247 and 533, using Euclidean algorithm. | 1 |
| 7957 | Find Greatest Common Divisor of 237 and 533, using Euclidean algorithm. | 1 |
| 7958 | Find Greatest Common Divisor of 257 and 533, using Euclidean algorithm. | 1 |
| 7959 | Find Greatest Common Divisor of 26 and 79, using prime factorization. | 1 |
| 7960 | Find Greatest Common Divisor of 82 and 21, using prime factorization. | 1 |
| 7961 | Find Greatest Common Divisor of 76 and 23, using prime factorization. | 1 |
| 7962 | Find Greatest Common Divisor of 24 and 97, using prime factorization. | 1 |
| 7963 | Find Greatest Common Divisor of 31 and 63, using prime factorization. | 1 |
| 7964 | Find Greatest Common Divisor of 35 and 56, using prime factorization. | 1 |
| 7965 | Find Greatest Common Divisor of 30 and 22, using prime factorization. | 1 |
| 7966 | Find Greatest Common Divisor of 16 and 25, using prime factorization. | 1 |
| 7967 | Find Greatest Common Divisor of 89 and 54, using prime factorization. | 1 |
| 7968 | Find Greatest Common Divisor of 62 and 21, using prime factorization. | 1 |
| 7969 | Find Greatest Common Divisor of 48 and 89, using prime factorization. | 1 |
| 7970 | Find Greatest Common Divisor of 81 and 17, using prime factorization. | 1 |
| 7971 | Find Greatest Common Divisor of 84 and 53, using prime factorization. | 1 |
| 7972 | Find Greatest Common Divisor of 38 and 86, using prime factorization. | 1 |
| 7973 | Find Greatest Common Divisor of 62 and 54, using prime factorization. | 1 |
| 7974 | Find Greatest Common Divisor of 80 and 21, using prime factorization. | 1 |
| 7975 | Find Greatest Common Divisor of 60 and 97, using prime factorization. | 1 |
| 7976 | Find Greatest Common Divisor of 34 and 81, using prime factorization. | 1 |
| 7977 | Find Greatest Common Divisor of 74 and 96, using prime factorization. | 1 |
| 7978 | Find Greatest Common Divisor of 17 and 55, using prime factorization. | 1 |
| 7979 | Find Greatest Common Divisor of 44 and 66, using prime factorization. | 1 |
| 7980 | Find Greatest Common Divisor of 70 and 42, using prime factorization. | 1 |
| 7981 | Find Greatest Common Divisor of 37 and 67, using prime factorization. | 1 |
| 7982 | Find Greatest Common Divisor of 25, 20, 17, 19, 12 and 14, using repeated division. | 1 |
| 7983 | Find Greatest Common Divisor of 9989 and 2133, using Euclidean algorithm. | 1 |
| 7984 | Find Greatest Common Divisor of 120, 500 and 300, using prime factorization. | 1 |
| 7985 | Find Greatest Common Divisor of 120, 500 and 300, using repeated division. | 1 |
| 7986 | Find Greatest Common Divisor of 17 and 13, using prime factorization. | 1 |
| 7987 | Find Greatest Common Divisor of 199 and 98, using prime factorization. | 1 |
| 7988 | Find Greatest Common Divisor of 7, 6 and 10, using prime factorization. | 1 |
| 7989 | Find Greatest Common Divisor of 13 and 21, using prime factorization. | 1 |
| 7990 | Find Greatest Common Divisor of 40304. | 1 |
| 7991 | Find Greatest Common Divisor of 103 and 60, using prime factorization. | 1 |
| 7992 | Find Greatest Common Divisor of 180 and 327, using prime factorization. | 1 |
| 7993 | Find Greatest Common Divisor of 180 and 327, using Euclidean algorithm. | 1 |
| 7994 | Find Greatest Common Divisor of 34 and 13, using Euclidean algorithm. | 1 |
| 7995 | Find Greatest Common Divisor of 44 and 55, using prime factorization. | 1 |
| 7996 | Find Greatest Common Divisor of 6499 and 4288, using prime factorization. | 1 |
| 7997 | Find Greatest Common Divisor of 5 and 10, using Euclidean algorithm. | 1 |
| 7998 | Find Greatest Common Divisor of 2001 and 1984, using Euclidean algorithm. | 1 |
| 7999 | Find Greatest Common Divisor of 425, 255 and 4131, using repeated division. | 1 |
| 8000 | Find Greatest Common Divisor of 702, 153 and 405, using repeated division. | 1 |