GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2301 | Find Greatest Common Divisor of 252 and 378, using prime factorization. | 3 |
| 2302 | Find Greatest Common Divisor of 72 and 164, using Euclidean algorithm. | 3 |
| 2303 | Find Greatest Common Divisor of 3 and 8, using Euclidean algorithm. | 3 |
| 2304 | Find Greatest Common Divisor of 3 and 26, using prime factorization. | 3 |
| 2305 | Find Greatest Common Divisor of 1, 4, 1 and 2, using prime factorization. | 3 |
| 2306 | Find Greatest Common Divisor of 1, 4, 1 and 1, using prime factorization. | 3 |
| 2307 | Find Greatest Common Divisor of 351 and 527, using repeated division. | 3 |
| 2308 | Find Greatest Common Divisor of 55 and 7, using Euclidean algorithm. | 3 |
| 2309 | Find Greatest Common Divisor of 77, 105 and 143, using prime factorization. | 3 |
| 2310 | Find Greatest Common Divisor of 406 and 555, using Euclidean algorithm. | 3 |
| 2311 | Find Greatest Common Divisor of 98 and 21, using Euclidean algorithm. | 3 |
| 2312 | Find Greatest Common Divisor of 4 and 32, using Euclidean algorithm. | 3 |
| 2313 | Find Greatest Common Divisor of 441 and 567, using Euclidean algorithm. | 3 |
| 2314 | Find Greatest Common Divisor of 384 and 1296, using Euclidean algorithm. | 3 |
| 2315 | Find Greatest Common Divisor of 7 and 352, using prime factorization. | 3 |
| 2316 | Find Greatest Common Divisor of 1248. | 3 |
| 2317 | Find Greatest Common Divisor of 3026 and 258, using prime factorization. | 3 |
| 2318 | Find Greatest Common Divisor of 28 and 42, using prime factorization. | 3 |
| 2319 | Find Greatest Common Divisor of 1497 and 721, using prime factorization. | 3 |
| 2320 | Find Greatest Common Divisor of 2. | 3 |
| 2321 | Find Greatest Common Divisor of 165, 231 and 385, using prime factorization. | 3 |
| 2322 | Find Greatest Common Divisor of 250000000 and 500000000, using prime factorization. | 3 |
| 2323 | Find Greatest Common Divisor of 19, 31 and 1, using Euclidean algorithm. | 3 |
| 2324 | Find Greatest Common Divisor of 28 and 24, using prime factorization. | 3 |
| 2325 | Find Greatest Common Divisor of 42, 84 and 73080, using prime factorization. | 3 |
| 2326 | Find Greatest Common Divisor of 128 and 1001, using prime factorization. | 3 |
| 2327 | Find Greatest Common Divisor of 84 and 196, using prime factorization. | 3 |
| 2328 | Find Greatest Common Divisor of 3126 and 1386, using Euclidean algorithm. | 3 |
| 2329 | Find Greatest Common Divisor of 504 and 2940, using prime factorization. | 3 |
| 2330 | Find Greatest Common Divisor of 656 and 208, using Euclidean algorithm. | 3 |
| 2331 | Find Greatest Common Divisor of 33 and 12, by listing out the factors. | 3 |
| 2332 | Find Greatest Common Divisor of 2025 and 271, using Euclidean algorithm. | 3 |
| 2333 | Find Greatest Common Divisor of 25 and 50, using repeated division. | 3 |
| 2334 | Find Greatest Common Divisor of 225 and 90, using prime factorization. | 3 |
| 2335 | Find Greatest Common Divisor of 12870 and 2618, using Euclidean algorithm. | 2 |
| 2336 | Find Greatest Common Divisor of 91 and 287, using prime factorization. | 2 |
| 2337 | Find Greatest Common Divisor of 12, 21 and 28, using prime factorization. | 2 |
| 2338 | Find Greatest Common Divisor of 15, 18 and 16, using prime factorization. | 2 |
| 2339 | Find Greatest Common Divisor of 102 and 222, using Euclidean algorithm. | 2 |
| 2340 | Find Greatest Common Divisor of 2048 and 100124, using repeated division. | 2 |
| 2341 | Find Greatest Common Divisor of 72 and 54, using prime factorization. | 2 |
| 2342 | Find Greatest Common Divisor of 18, 45 and 60, using prime factorization. | 2 |
| 2343 | Find Greatest Common Divisor of 712. | 2 |
| 2344 | Find Greatest Common Divisor of 111 and 1986, using prime factorization. | 2 |
| 2345 | Find Greatest Common Divisor of 19 and 141, using prime factorization. | 2 |
| 2346 | Find Greatest Common Divisor of 390 and 720, using Euclidean algorithm. | 2 |
| 2347 | Find Greatest Common Divisor of 289 and 160, using prime factorization. | 2 |
| 2348 | Find Greatest Common Divisor of 31256 and 4788, using Euclidean algorithm. | 2 |
| 2349 | Find Greatest Common Divisor of 1, 2 and 3, using Euclidean algorithm. | 2 |
| 2350 | Find Greatest Common Divisor of 252 and 180, using prime factorization. | 2 |
