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 12075 and 4655, using Euclidean algorithm. | 3 |
| 2302 | Find Greatest Common Divisor of 270 and 192, using repeated division. | 3 |
| 2303 | Find Greatest Common Divisor of 175, 225 and 350, using repeated division. | 3 |
| 2304 | Find Greatest Common Divisor of 11 and 25, using Euclidean algorithm. | 3 |
| 2305 | Find Greatest Common Divisor of 98 and 24, using Euclidean algorithm. | 3 |
| 2306 | Find Greatest Common Divisor of 72 and 52, using Euclidean algorithm. | 3 |
| 2307 | Find Greatest Common Divisor of 150 and 890, using prime factorization. | 3 |
| 2308 | Find Greatest Common Divisor of 77 and 28, using prime factorization. | 3 |
| 2309 | Find Greatest Common Divisor of 114 and 312, using repeated division. | 3 |
| 2310 | Find Greatest Common Divisor of 3 and 3016, using prime factorization. | 3 |
| 2311 | Find Greatest Common Divisor of 257 and 532, using Euclidean algorithm. | 3 |
| 2312 | Find Greatest Common Divisor of 153 and 119, using prime factorization. | 3 |
| 2313 | Find Greatest Common Divisor of 311 and 28, using prime factorization. | 3 |
| 2314 | Find Greatest Common Divisor of 311 and 28, using Euclidean algorithm. | 3 |
| 2315 | Find Greatest Common Divisor of 12 and 1234, using prime factorization. | 3 |
| 2316 | Find Greatest Common Divisor of 2517 and 2370, using Euclidean algorithm. | 3 |
| 2317 | Find Greatest Common Divisor of 1024 and 2256, using Euclidean algorithm. | 3 |
| 2318 | Find Greatest Common Divisor of 663 and 39, using prime factorization. | 3 |
| 2319 | Find Greatest Common Divisor of 316 and 180, using prime factorization. | 3 |
| 2320 | Find Greatest Common Divisor of 93 and 119, using prime factorization. | 3 |
| 2321 | Find Greatest Common Divisor of 78 and 741, using prime factorization. | 3 |
| 2322 | Find Greatest Common Divisor of 36 and 90, using prime factorization. | 3 |
| 2323 | Find Greatest Common Divisor of 97 and 1045, using Euclidean algorithm. | 3 |
| 2324 | Find Greatest Common Divisor of 12345 and 54321, using prime factorization. | 3 |
| 2325 | Find Greatest Common Divisor of 816 and 2260, using Euclidean algorithm. | 3 |
| 2326 | Find Greatest Common Divisor of 211 and 575, using prime factorization. | 3 |
| 2327 | Find Greatest Common Divisor of 2024 and 112, using Euclidean algorithm. | 3 |
| 2328 | Find Greatest Common Divisor of 1160718174 and 316258250, using prime factorization. | 3 |
| 2329 | Find Greatest Common Divisor of 16 and 38, using prime factorization. | 3 |
| 2330 | Find Greatest Common Divisor of 12 and 15, using Euclidean algorithm. | 3 |
| 2331 | Find Greatest Common Divisor of 3 and 1, using Euclidean algorithm. | 3 |
| 2332 | Find Greatest Common Divisor of 11607 and 3162, using Euclidean algorithm. | 3 |
| 2333 | Find Greatest Common Divisor of 2468 and 1357, using Euclidean algorithm. | 3 |
| 2334 | Find Greatest Common Divisor of 15 and 13, using Euclidean algorithm. | 3 |
| 2335 | Find Greatest Common Divisor of 1716 and 1260, using Euclidean algorithm. | 3 |
| 2336 | Find Greatest Common Divisor of 1056 and 228, using Euclidean algorithm. | 3 |
| 2337 | Find Greatest Common Divisor of 377 and 2303, using prime factorization. | 3 |
| 2338 | Find Greatest Common Divisor of 4001 and 2689, using Euclidean algorithm. | 3 |
| 2339 | Find Greatest Common Divisor of 33 and 145, using prime factorization. | 3 |
| 2340 | Find Greatest Common Divisor of 76 and 62, using Euclidean algorithm. | 3 |
| 2341 | Find Greatest Common Divisor of 1010 and 407, using prime factorization. | 3 |
| 2342 | Find Greatest Common Divisor of 12 and 8, using repeated division. | 3 |
| 2343 | Find Greatest Common Divisor of 12728 and 20000, using Euclidean algorithm. | 3 |
| 2344 | Find Greatest Common Divisor of 1020 and 1170, using prime factorization. | 3 |
| 2345 | Find Greatest Common Divisor of 1020 and 1170, using repeated division. | 3 |
| 2346 | Find Greatest Common Divisor of 13 and 8, using Euclidean algorithm. | 3 |
| 2347 | Find Greatest Common Divisor of 310 and 62, using prime factorization. | 3 |
| 2348 | Find Greatest Common Divisor of 296, 703 and 814, using repeated division. | 3 |
| 2349 | Find Greatest Common Divisor of 45. | 3 |
| 2350 | Find Greatest Common Divisor of 123456 and 789, using Euclidean algorithm. | 3 |
