GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
2251 | Find Greatest Common Divisor of 30 and 80, using prime factorization. | 1 |
2252 | Find Greatest Common Divisor of 2 and 143, using prime factorization. | 1 |
2253 | Find Greatest Common Divisor of 524 and 148, using prime factorization. | 1 |
2254 | Find Greatest Common Divisor of 1 and 143, using prime factorization. | 1 |
2255 | Find Greatest Common Divisor of 210 and 861, using Euclidean algorithm. | 1 |
2256 | Find Greatest Common Divisor of 8 and 693, using Euclidean algorithm. | 1 |
2257 | Find Greatest Common Divisor of 2, 50, 1, 2, 60 and 1, using prime factorization. | 1 |
2258 | Find Greatest Common Divisor of 95 and 43, using Euclidean algorithm. | 1 |
2259 | Find Greatest Common Divisor of 56, 112 and 224, using prime factorization. | 1 |
2260 | Find Greatest Common Divisor of 412 and 88, using prime factorization. | 1 |
2261 | Find Greatest Common Divisor of 16 and 72, using Euclidean algorithm. | 1 |
2262 | Find Greatest Common Divisor of 18021945. | 1 |
2263 | Find Greatest Common Divisor of 79 and 41, using Euclidean algorithm. | 1 |
2264 | Find Greatest Common Divisor of 2, 3, 5, 7, 11, 2, 4, 3, 9, 11, 17 and 14, using prime factorization. | 1 |
2265 | Find Greatest Common Divisor of 185 and 775, using prime factorization. | 1 |
2266 | Find Greatest Common Divisor of 18021945, 3440835, 1003650 and 2443387, using prime factorization. | 1 |
2267 | Find Greatest Common Divisor of 33 and 18, using prime factorization. | 1 |
2268 | Find Greatest Common Divisor of 910 and 285, using prime factorization. | 1 |
2269 | Find Greatest Common Divisor of 3762 and 1634, using Euclidean algorithm. | 1 |
2270 | Find Greatest Common Divisor of 14 and 77, using prime factorization. | 1 |
2271 | Find Greatest Common Divisor of 10 and 15, using Euclidean algorithm. | 1 |
2272 | Find Greatest Common Divisor of 1000 and 1, using Euclidean algorithm. | 1 |
2273 | Find Greatest Common Divisor of 60, 150 and 180, using prime factorization. | 1 |
2274 | Find Greatest Common Divisor of 123 and 65, using prime factorization. | 1 |
2275 | Find Greatest Common Divisor of 10497600 and 4840, using prime factorization. | 1 |
2276 | Find Greatest Common Divisor of 8 and 12, by listing out the factors. | 1 |
2277 | Find Greatest Common Divisor of 72 and 51, using Euclidean algorithm. | 1 |
2278 | Find Greatest Common Divisor of 114 and 143, using prime factorization. | 1 |
2279 | Find Greatest Common Divisor of 6952 and 7189, using prime factorization. | 1 |
2280 | Find Greatest Common Divisor of 110 and 143, using prime factorization. | 1 |
2281 | Find Greatest Common Divisor of 78 and 250, using prime factorization. | 1 |
2282 | Find Greatest Common Divisor of 133 and 38, using repeated division. | 1 |
2283 | Find Greatest Common Divisor of 221 and 143, using prime factorization. | 1 |
2284 | Find Greatest Common Divisor of 6952 and 7189, using Euclidean algorithm. | 1 |
2285 | Find Greatest Common Divisor of 5 and 12, using prime factorization. | 1 |
2286 | Find Greatest Common Divisor of 18, 24 and 30, using repeated division. | 1 |
2287 | Find Greatest Common Divisor of 222 and 159, using Euclidean algorithm. | 1 |
2288 | Find Greatest Common Divisor of 259 and 19, using Euclidean algorithm. | 1 |
2289 | Find Greatest Common Divisor of 1665, 4554, 1683 and 4050, using repeated division. | 1 |
2290 | Find Greatest Common Divisor of 106, 212 and 400, using prime factorization. | 1 |
2291 | Find Greatest Common Divisor of 221 and 143, using Euclidean algorithm. | 1 |
2292 | Find Greatest Common Divisor of 10, 0, 0 and 0, using repeated division. | 1 |
2293 | Find Greatest Common Divisor of 18, 24 and 30, using Euclidean algorithm. | 1 |
2294 | Find Greatest Common Divisor of 30 and 75, using Euclidean algorithm. | 1 |
2295 | Find Greatest Common Divisor of 15, 3, 10, 2, 15, 2, 2, 10 and 3, using prime factorization. | 1 |
2296 | Find Greatest Common Divisor of 133 and 28, using repeated division. | 1 |
2297 | Find Greatest Common Divisor of 240 and 360, using Euclidean algorithm. | 1 |
2298 | Find Greatest Common Divisor of 18, 24 and 30, by listing out the factors. | 1 |
2299 | Find Greatest Common Divisor of 35 and 41, using prime factorization. | 1 |
2300 | Find Greatest Common Divisor of 53 and 33, using Euclidean algorithm. | 1 |