GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2251 | Find Greatest Common Divisor of 1, 4, 1 and 1, using prime factorization. | 3 |
| 2252 | Find Greatest Common Divisor of 351 and 527, using repeated division. | 3 |
| 2253 | Find Greatest Common Divisor of 55 and 7, using Euclidean algorithm. | 3 |
| 2254 | Find Greatest Common Divisor of 77, 105 and 143, using prime factorization. | 3 |
| 2255 | Find Greatest Common Divisor of 406 and 555, using Euclidean algorithm. | 3 |
| 2256 | Find Greatest Common Divisor of 98 and 21, using Euclidean algorithm. | 3 |
| 2257 | Find Greatest Common Divisor of 4 and 32, using Euclidean algorithm. | 3 |
| 2258 | Find Greatest Common Divisor of 441 and 567, using Euclidean algorithm. | 3 |
| 2259 | Find Greatest Common Divisor of 384 and 1296, using Euclidean algorithm. | 3 |
| 2260 | Find Greatest Common Divisor of 7 and 352, using prime factorization. | 3 |
| 2261 | Find Greatest Common Divisor of 1248. | 3 |
| 2262 | Find Greatest Common Divisor of 3026 and 258, using prime factorization. | 3 |
| 2263 | Find Greatest Common Divisor of 28 and 42, using prime factorization. | 3 |
| 2264 | Find Greatest Common Divisor of 1497 and 721, using prime factorization. | 3 |
| 2265 | Find Greatest Common Divisor of 2. | 3 |
| 2266 | Find Greatest Common Divisor of 165, 231 and 385, using prime factorization. | 3 |
| 2267 | Find Greatest Common Divisor of 250000000 and 500000000, using prime factorization. | 3 |
| 2268 | Find Greatest Common Divisor of 19, 31 and 1, using Euclidean algorithm. | 3 |
| 2269 | Find Greatest Common Divisor of 28 and 24, using prime factorization. | 3 |
| 2270 | Find Greatest Common Divisor of 42, 84 and 73080, using prime factorization. | 3 |
| 2271 | Find Greatest Common Divisor of 128 and 1001, using prime factorization. | 3 |
| 2272 | Find Greatest Common Divisor of 84 and 196, using prime factorization. | 3 |
| 2273 | Find Greatest Common Divisor of 3126 and 1386, using Euclidean algorithm. | 3 |
| 2274 | Find Greatest Common Divisor of 504 and 2940, using prime factorization. | 3 |
| 2275 | Find Greatest Common Divisor of 656 and 208, using Euclidean algorithm. | 3 |
| 2276 | Find Greatest Common Divisor of 33 and 12, by listing out the factors. | 3 |
| 2277 | Find Greatest Common Divisor of 2025 and 271, using Euclidean algorithm. | 3 |
| 2278 | Find Greatest Common Divisor of 25 and 50, using repeated division. | 3 |
| 2279 | Find Greatest Common Divisor of 225 and 90, using prime factorization. | 3 |
| 2280 | Find Greatest Common Divisor of 18, 60 and 75, using prime factorization. | 3 |
| 2281 | Find Greatest Common Divisor of 576, 1152, 1280, 136 and 200, using prime factorization. | 3 |
| 2282 | Find Greatest Common Divisor of 48 and 64, using prime factorization. | 3 |
| 2283 | Find Greatest Common Divisor of 2486625522 and 41582215163, using repeated division. | 3 |
| 2284 | Find Greatest Common Divisor of 12, 33 and 15, using prime factorization. | 3 |
| 2285 | Find Greatest Common Divisor of 16 and 64, using prime factorization. | 3 |
| 2286 | Find Greatest Common Divisor of 48 and 180, using prime factorization. | 3 |
| 2287 | Find Greatest Common Divisor of 299 and 256, using repeated division. | 3 |
| 2288 | Find Greatest Common Divisor of 257, 234 and 185, using prime factorization. | 3 |
| 2289 | Find Greatest Common Divisor of 54 and 72, by listing out the factors. | 3 |
| 2290 | Find Greatest Common Divisor of 12 and 8, by listing out the factors. | 3 |
| 2291 | Find Greatest Common Divisor of 35742 and 13566, using Euclidean algorithm. | 3 |
| 2292 | Find Greatest Common Divisor of 35742 and 13566, using prime factorization. | 3 |
| 2293 | Find Greatest Common Divisor of 24 and 32, using prime factorization. | 3 |
| 2294 | Find Greatest Common Divisor of 4357 and 3754, using prime factorization. | 3 |
| 2295 | Find Greatest Common Divisor of 1024 and 486, using prime factorization. | 3 |
| 2296 | Find Greatest Common Divisor of 486 and 18, using prime factorization. | 3 |
| 2297 | Find Greatest Common Divisor of 120 and 500, using prime factorization. | 3 |
| 2298 | Find Greatest Common Divisor of 28844 and 15712, using Euclidean algorithm. | 3 |
| 2299 | Find Greatest Common Divisor of 6, 11, 17, 22, 28, 33, 38, 44, 49 and 55, using prime factorization. | 3 |
| 2300 | Find Greatest Common Divisor of 1858 and 342, using prime factorization. | 3 |
