GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6001 | Find Greatest Common Divisor of 74 and 96, using prime factorization. | 1 |
| 6002 | Find Greatest Common Divisor of 17 and 55, using prime factorization. | 1 |
| 6003 | Find Greatest Common Divisor of 44 and 66, using prime factorization. | 1 |
| 6004 | Find Greatest Common Divisor of 70 and 42, using prime factorization. | 1 |
| 6005 | Find Greatest Common Divisor of 37 and 67, using prime factorization. | 1 |
| 6006 | Find Greatest Common Divisor of 25, 20, 17, 19, 12 and 14, using repeated division. | 1 |
| 6007 | Find Greatest Common Divisor of 9989 and 2133, using Euclidean algorithm. | 1 |
| 6008 | Find Greatest Common Divisor of 120, 500 and 300, using prime factorization. | 1 |
| 6009 | Find Greatest Common Divisor of 120, 500 and 300, using repeated division. | 1 |
| 6010 | Find Greatest Common Divisor of 17 and 13, using prime factorization. | 1 |
| 6011 | Find Greatest Common Divisor of 199 and 98, using prime factorization. | 1 |
| 6012 | Find Greatest Common Divisor of 7, 6 and 10, using prime factorization. | 1 |
| 6013 | Find Greatest Common Divisor of 13 and 21, using prime factorization. | 1 |
| 6014 | Find Greatest Common Divisor of 40304. | 1 |
| 6015 | Find Greatest Common Divisor of 103 and 60, using prime factorization. | 1 |
| 6016 | Find Greatest Common Divisor of 180 and 327, using prime factorization. | 1 |
| 6017 | Find Greatest Common Divisor of 180 and 327, using Euclidean algorithm. | 1 |
| 6018 | Find Greatest Common Divisor of 34 and 13, using Euclidean algorithm. | 1 |
| 6019 | Find Greatest Common Divisor of 44 and 55, using prime factorization. | 1 |
| 6020 | Find Greatest Common Divisor of 6499 and 4288, using prime factorization. | 1 |
| 6021 | Find Greatest Common Divisor of 5 and 10, using Euclidean algorithm. | 1 |
| 6022 | Find Greatest Common Divisor of 2001 and 1984, using Euclidean algorithm. | 1 |
| 6023 | Find Greatest Common Divisor of 425, 255 and 4131, using repeated division. | 1 |
| 6024 | Find Greatest Common Divisor of 702, 153 and 405, using repeated division. | 1 |
| 6025 | | 1 |
| 6026 | | 1 |
| 6027 | Find Greatest Common Divisor of 232 and 562, using prime factorization. | 1 |
| 6028 | Find Greatest Common Divisor of 189 and 186, using Euclidean algorithm. | 1 |
| 6029 | Find Greatest Common Divisor of 220 and 209, using Euclidean algorithm. | 1 |
| 6030 | Find Greatest Common Divisor of 116585 and 116586, using Euclidean algorithm. | 1 |
| 6031 | Find Greatest Common Divisor of 195 and 165, using Euclidean algorithm. | 1 |
| 6032 | Find Greatest Common Divisor of 146 and 96, using Euclidean algorithm. | 1 |
| 6033 | Find Greatest Common Divisor of 2220 and 96, using Euclidean algorithm. | 1 |
| 6034 | Find Greatest Common Divisor of 359 and 96, using Euclidean algorithm. | 1 |
| 6035 | Find Greatest Common Divisor of 0 and 3355262, using Euclidean algorithm. | 1 |
| 6036 | Find Greatest Common Divisor of 3960 and 168, using Euclidean algorithm. | 1 |
| 6037 | Find Greatest Common Divisor of 80 and 76, using Euclidean algorithm. | 1 |
| 6038 | Find Greatest Common Divisor of 288 and 56, using Euclidean algorithm. | 1 |
| 6039 | Find Greatest Common Divisor of 615 and 1080, using repeated division. | 1 |
| 6040 | Find Greatest Common Divisor of 373 and 419, using Euclidean algorithm. | 1 |
| 6041 | Find Greatest Common Divisor of 376 and 46, using Euclidean algorithm. | 1 |
| 6042 | Find Greatest Common Divisor of 28224. | 1 |
| 6043 | Find Greatest Common Divisor of 28224. | 1 |
| 6044 | Find Greatest Common Divisor of 28224. | 1 |
| 6045 | Find Greatest Common Divisor of 100 and 104, using prime factorization. | 1 |
| 6046 | Find Greatest Common Divisor of 112 and 464, using prime factorization. | 1 |
| 6047 | Find Greatest Common Divisor of 1236 and 61, by listing out the factors. | 1 |
| 6048 | Find Greatest Common Divisor of 421319712 and 271566, using Euclidean algorithm. | 1 |
| 6049 | Find Greatest Common Divisor of 54 and 81, using prime factorization. | 1 |
| 6050 | Find Greatest Common Divisor of 3 and 15, using Euclidean algorithm. | 1 |
