GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 8051 | Find Greatest Common Divisor of 640 and 32, using prime factorization. | 1 |
| 8052 | Find Greatest Common Divisor of 2240 and 615, using prime factorization. | 1 |
| 8053 | Find Greatest Common Divisor of 1386, 924, 660, 495, 385, 308, 252 and 2310, using prime factorization. | 1 |
| 8054 | | 1 |
| 8055 | Find Greatest Common Divisor of 84 and 32, using Euclidean algorithm. | 1 |
| 8056 | Find Greatest Common Divisor of 187. | 1 |
| 8057 | Find Greatest Common Divisor of 956. | 1 |
| 8058 | Find Greatest Common Divisor of 132 and 28, using Euclidean algorithm. | 1 |
| 8059 | Find Greatest Common Divisor of 1183 and 63, using prime factorization. | 1 |
| 8060 | Find Greatest Common Divisor of 71 and 361, using prime factorization. | 1 |
| 8061 | | 1 |
| 8062 | Find Greatest Common Divisor of 24, 36 and 48, by listing out the factors. | 1 |
| 8063 | Find Greatest Common Divisor of 240, 480 and 620, by listing out the factors. | 1 |
| 8064 | Find Greatest Common Divisor of 200, 400, 600 and 800, by listing out the factors. | 1 |
| 8065 | Find Greatest Common Divisor of 4802 and 22932, using prime factorization. | 1 |
| 8066 | Find Greatest Common Divisor of 125 and 200, using prime factorization. | 1 |
| 8067 | Find Greatest Common Divisor of 125 and 200, using repeated division. | 1 |
| 8068 | Find Greatest Common Divisor of 125 and 200, by listing out the factors. | 1 |
| 8069 | Find Greatest Common Divisor of 34, 81, 1 and 2, using prime factorization. | 1 |
| 8070 | Find Greatest Common Divisor of 58812 and 1000, using prime factorization. | 1 |
| 8071 | Find Greatest Common Divisor of 490 and 16, using prime factorization. | 1 |
| 8072 | Find Greatest Common Divisor of 110 and 8, using prime factorization. | 1 |
| 8073 | Find Greatest Common Divisor of 610 and 1000, using prime factorization. | 1 |
| 8074 | Find Greatest Common Divisor of 8 and 60, using prime factorization. | 1 |
| 8075 | Find Greatest Common Divisor of 190 and 8, using prime factorization. | 1 |
| 8076 | Find Greatest Common Divisor of 135 and 6, using prime factorization. | 1 |
| 8077 | Find Greatest Common Divisor of 376 and 8, using prime factorization. | 1 |
| 8078 | Find Greatest Common Divisor of 86 and 6, using prime factorization. | 1 |
| 8079 | Find Greatest Common Divisor of 120 and 12, using prime factorization. | 1 |
| 8080 | Find Greatest Common Divisor of 2 and 162, using prime factorization. | 1 |
| 8081 | Find Greatest Common Divisor of 20 and 42, using prime factorization. | 1 |
| 8082 | Find Greatest Common Divisor of 7 and 70, using prime factorization. | 1 |
| 8083 | Find Greatest Common Divisor of 318 and 12, using prime factorization. | 1 |
| 8084 | Find Greatest Common Divisor of 54669191328000. | 1 |
| 8085 | Find Greatest Common Divisor of 6650 and 3740, using prime factorization. | 1 |
| 8086 | Find Greatest Common Divisor of 316258250 and 1160718174, using Euclidean algorithm. | 1 |
| 8087 | Find Greatest Common Divisor of 8 and 21, using prime factorization. | 1 |
| 8088 | | 1 |
| 8089 | Find Greatest Common Divisor of 7, 14 and 4, using repeated division. | 1 |
| 8090 | Find Greatest Common Divisor of 28 and 30, using repeated division. | 1 |
| 8091 | | 1 |
| 8092 | Find Greatest Common Divisor of 6371 and 1737, using prime factorization. | 1 |
| 8093 | Find Greatest Common Divisor of 17 and 999999999999999985, using prime factorization. | 1 |
