GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5951 | Find Greatest Common Divisor of 2, 6, 4962, 113, 98, 122, 113, 113, 4962, 4962, 49, 48, 113, 106, 113, 112, 113, 8834 and 8834, using prime factorization. | 1 |
| 5952 | Find Greatest Common Divisor of 2, 6 and 8172, using prime factorization. | 1 |
| 5953 | Find Greatest Common Divisor of 2, 6 and 7035, using prime factorization. | 1 |
| 5954 | Find Greatest Common Divisor of 2, 6 and 6019, using prime factorization. | 1 |
| 5955 | Find Greatest Common Divisor of 2, 6 and 5905, using prime factorization. | 1 |
| 5956 | Find Greatest Common Divisor of 2, 6 and 6685, using prime factorization. | 1 |
| 5957 | Find Greatest Common Divisor of 2, 6 and 2440, using prime factorization. | 1 |
| 5958 | Find Greatest Common Divisor of 2, 6 and 1614, using prime factorization. | 1 |
| 5959 | Find Greatest Common Divisor of 2, 6 and 2518, using prime factorization. | 1 |
| 5960 | Find Greatest Common Divisor of 340 and 800, using repeated division. | 1 |
| 5961 | Find Greatest Common Divisor of 226, 5, 1008 and 40, using prime factorization. | 1 |
| 5962 | Find Greatest Common Divisor of 187 and 19, using prime factorization. | 1 |
| 5963 | Find Greatest Common Divisor of 187 and 19, using Euclidean algorithm. | 1 |
| 5964 | Find Greatest Common Divisor of 25, 55 and 555, using Euclidean algorithm. | 1 |
| 5965 | Find Greatest Common Divisor of 25, 55 and 5, using Euclidean algorithm. | 1 |
| 5966 | Find Greatest Common Divisor of 5315135135 and 566666666, using Euclidean algorithm. | 1 |
| 5967 | Find Greatest Common Divisor of 25 and 5, using Euclidean algorithm. | 1 |
| 5968 | Find Greatest Common Divisor of 5 and 25, using Euclidean algorithm. | 1 |
| 5969 | Find Greatest Common Divisor of 66 and 7, using Euclidean algorithm. | 1 |
| 5970 | Find Greatest Common Divisor of 7 and 7, using Euclidean algorithm. | 1 |
| 5971 | Find Greatest Common Divisor of 27 and 86, using Euclidean algorithm. | 1 |
| 5972 | Find Greatest Common Divisor of 5655 and 12075, using Euclidean algorithm. | 1 |
| 5973 | Find Greatest Common Divisor of 36, 42 and 54, using prime factorization. | 1 |
| 5974 | Find Greatest Common Divisor of 7000000000000000 and 10487275715782582, using repeated division. | 1 |
| 5975 | Find Greatest Common Divisor of 56 and 42, using prime factorization. | 1 |
| 5976 | Find Greatest Common Divisor of 56 and 42, using Euclidean algorithm. | 1 |
| 5977 | Find Greatest Common Divisor of 1234 and 123, using Euclidean algorithm. | 1 |
| 5978 | Find Greatest Common Divisor of 27 and 21, using Euclidean algorithm. | 1 |
| 5979 | Find Greatest Common Divisor of 876 and 135, using Euclidean algorithm. | 1 |
| 5980 | Find Greatest Common Divisor of 41 and 68, using prime factorization. | 1 |
| 5981 | Find Greatest Common Divisor of 301 and 344, using Euclidean algorithm. | 1 |
| 5982 | Find Greatest Common Divisor of 187 and 160, using prime factorization. | 1 |
| 5983 | Find Greatest Common Divisor of 65025 and 16, using repeated division. | 1 |
| 5984 | Find Greatest Common Divisor of 96 and 182, using prime factorization. | 1 |
| 5985 | Find Greatest Common Divisor of 96 and 182, by listing out the factors. | 1 |
| 5986 | Find Greatest Common Divisor of 14 and 23, using prime factorization. | 1 |
| 5987 | Find Greatest Common Divisor of 3149 and 2598, using Euclidean algorithm. | 1 |
| 5988 | Find Greatest Common Divisor of 31145 and 11442, using Euclidean algorithm. | 1 |
| 5989 | Find Greatest Common Divisor of 11743 and 1226, using Euclidean algorithm. | 1 |
| 5990 | Find Greatest Common Divisor of 32842 and 5928, using Euclidean algorithm. | 1 |
| 5991 | Find Greatest Common Divisor of 22773 and 202851, using Euclidean algorithm. | 1 |
| 5992 | Find Greatest Common Divisor of 856641 and 587877, using Euclidean algorithm. | 1 |
| 5993 | Find Greatest Common Divisor of 925127 and 856641, using Euclidean algorithm. | 1 |
| 5994 | Find Greatest Common Divisor of 7513 and 6259, using Euclidean algorithm. | 1 |
| 5995 | Find Greatest Common Divisor of 45, 1215 and 2187, using prime factorization. | 1 |
| 5996 | Find Greatest Common Divisor of 0 and 2, using Euclidean algorithm. | 1 |
| 5997 | Find Greatest Common Divisor of 4 and 7, using Euclidean algorithm. | 1 |
| 5998 | Find Greatest Common Divisor of 88 and 91, by listing out the factors. | 1 |
| 5999 | Find Greatest Common Divisor of 126 and 147, using prime factorization. | 1 |
| 6000 | Find Greatest Common Divisor of 2312 and 19520, using Euclidean algorithm. | 1 |
