GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2351 | Find Greatest Common Divisor of 114 and 324, using Euclidean algorithm. | 3 |
| 2352 | Find Greatest Common Divisor of 77, 33 and 22, using prime factorization. | 3 |
| 2353 | Find Greatest Common Divisor of 42823 and 6409, using Euclidean algorithm. | 3 |
| 2354 | Find Greatest Common Divisor of 1638 and 2036, using prime factorization. | 3 |
| 2355 | Find Greatest Common Divisor of 54796 and 605, using Euclidean algorithm. | 3 |
| 2356 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, by listing out the factors. | 3 |
| 2357 | Find Greatest Common Divisor of 26 and 7, using Euclidean algorithm. | 3 |
| 2358 | Find Greatest Common Divisor of 1. | 3 |
| 2359 | Find Greatest Common Divisor of 45, 83 and 79, using Euclidean algorithm. | 3 |
| 2360 | Find Greatest Common Divisor of 29 and 63, using Euclidean algorithm. | 3 |
| 2361 | Find Greatest Common Divisor of 5. | 3 |
| 2362 | Find Greatest Common Divisor of 47 and 89, using Euclidean algorithm. | 3 |
| 2363 | Find Greatest Common Divisor of 75 and 42, using Euclidean algorithm. | 3 |
| 2364 | Find Greatest Common Divisor of 48 and 59, using Euclidean algorithm. | 3 |
| 2365 | Find Greatest Common Divisor of 44 and 90, by listing out the factors. | 3 |
| 2366 | Find Greatest Common Divisor of 52 and 39, using Euclidean algorithm. | 3 |
| 2367 | Find Greatest Common Divisor of 634 and 472, using Euclidean algorithm. | 3 |
| 2368 | Find Greatest Common Divisor of 25 and 68, using Euclidean algorithm. | 3 |
| 2369 | Find Greatest Common Divisor of 91 and 32, using Euclidean algorithm. | 3 |
| 2370 | Find Greatest Common Divisor of 97 and 29, using Euclidean algorithm. | 3 |
| 2371 | Find Greatest Common Divisor of 23 and 1, using Euclidean algorithm. | 3 |
| 2372 | Find Greatest Common Divisor of 22 and 77, using Euclidean algorithm. | 3 |
| 2373 | Find Greatest Common Divisor of 26 and 76, using Euclidean algorithm. | 3 |
| 2374 | Find Greatest Common Divisor of 85 and 28, using Euclidean algorithm. | 3 |
| 2375 | Find Greatest Common Divisor of 72 and 15, using Euclidean algorithm. | 3 |
| 2376 | Find Greatest Common Divisor of 320 and 240, using prime factorization. | 3 |
| 2377 | Find Greatest Common Divisor of 72 and 82, using Euclidean algorithm. | 3 |
| 2378 | Find Greatest Common Divisor of 1028 and 576, using Euclidean algorithm. | 3 |
| 2379 | Find Greatest Common Divisor of 12 and 32, using prime factorization. | 3 |
| 2380 | Find Greatest Common Divisor of 48, 54 and 84, by listing out the factors. | 3 |
| 2381 | Find Greatest Common Divisor of 10 and 3, using prime factorization. | 3 |
| 2382 | Find Greatest Common Divisor of 34 and 120, using prime factorization. | 3 |
| 2383 | Find Greatest Common Divisor of 36 and 120, using prime factorization. | 3 |
| 2384 | Find Greatest Common Divisor of 315 and 441, using repeated division. | 3 |
| 2385 | Find Greatest Common Divisor of 6666600000 and 6666666666, using Euclidean algorithm. | 3 |
| 2386 | Find Greatest Common Divisor of 80 and 44, using Euclidean algorithm. | 3 |
| 2387 | Find Greatest Common Divisor of 7 and 120, using prime factorization. | 3 |
| 2388 | Find Greatest Common Divisor of 337 and 674, using prime factorization. | 3 |
| 2389 | Find Greatest Common Divisor of 108 and 144, by listing out the factors. | 3 |
| 2390 | Find Greatest Common Divisor of 130 and 115, using Euclidean algorithm. | 3 |
| 2391 | Find Greatest Common Divisor of 123456789 and 987654321, using prime factorization. | 3 |
| 2392 | Find Greatest Common Divisor of 840 and 1080, using prime factorization. | 3 |
| 2393 | Find Greatest Common Divisor of 70, 120 and 217, using prime factorization. | 3 |
| 2394 | Find Greatest Common Divisor of 70 and 120, using Euclidean algorithm. | 3 |
| 2395 | Find Greatest Common Divisor of 113 and 143, using prime factorization. | 3 |
| 2396 | Find Greatest Common Divisor of 14 and 26, using prime factorization. | 3 |
| 2397 | Find Greatest Common Divisor of 83 and 19, using prime factorization. | 3 |
| 2398 | Find Greatest Common Divisor of 144 and 192, using prime factorization. | 3 |
| 2399 | Find Greatest Common Divisor of 841 and 160, using Euclidean algorithm. | 3 |
| 2400 | Find Greatest Common Divisor of 0 and 3, using prime factorization. | 3 |
