GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2401 | Find Greatest Common Divisor of 1 and 17, using prime factorization. | 3 |
| 2402 | Find Greatest Common Divisor of 3 and 53, using prime factorization. | 3 |
| 2403 | Find Greatest Common Divisor of 55, 35 and 50, using Euclidean algorithm. | 3 |
| 2404 | Find Greatest Common Divisor of 16534528044 and 8332745927, using prime factorization. | 3 |
| 2405 | Find Greatest Common Divisor of 49 and 168, using prime factorization. | 3 |
| 2406 | Find Greatest Common Divisor of 11520 and 5670, using prime factorization. | 3 |
| 2407 | Find Greatest Common Divisor of 1100 and 57330, using prime factorization. | 3 |
| 2408 | Find Greatest Common Divisor of 30 and 17, using Euclidean algorithm. | 3 |
| 2409 | Find Greatest Common Divisor of 1025 and 35, using prime factorization. | 3 |
| 2410 | Find Greatest Common Divisor of 6536 and 9503, using Euclidean algorithm. | 3 |
| 2411 | Find Greatest Common Divisor of 67890 and 12345, using prime factorization. | 3 |
| 2412 | Find Greatest Common Divisor of 32 and 936, using repeated division. | 3 |
| 2413 | Find Greatest Common Divisor of 10, 25 and 22, using prime factorization. | 3 |
| 2414 | Find Greatest Common Divisor of 9800, 420 and 2520, using repeated division. | 3 |
| 2415 | Find Greatest Common Divisor of 9800, 420 and 2520, using prime factorization. | 3 |
| 2416 | Find Greatest Common Divisor of 3, 24, 27, 33, 42 and 46, using repeated division. | 3 |
| 2417 | Find Greatest Common Divisor of 45 and 56, using prime factorization. | 3 |
| 2418 | Find Greatest Common Divisor of 20 and 10, using repeated division. | 3 |
| 2419 | Find Greatest Common Divisor of 20 and 7, using repeated division. | 3 |
| 2420 | Find Greatest Common Divisor of 160 and 9, using repeated division. | 3 |
| 2421 | Find Greatest Common Divisor of 75 and 253, using prime factorization. | 3 |
| 2422 | Find Greatest Common Divisor of 11391 and 5673, using Euclidean algorithm. | 3 |
| 2423 | Find Greatest Common Divisor of 232 and 562, using Euclidean algorithm. | 3 |
| 2424 | Find Greatest Common Divisor of 1432 and 156, using prime factorization. | 3 |
| 2425 | Find Greatest Common Divisor of 359 and 125, using Euclidean algorithm. | 3 |
| 2426 | Find Greatest Common Divisor of 388 and 189, using repeated division. | 3 |
| 2427 | Find Greatest Common Divisor of 388 and 189, using prime factorization. | 3 |
| 2428 | Find Greatest Common Divisor of 7250 and 2360, using Euclidean algorithm. | 3 |
| 2429 | Find Greatest Common Divisor of 420 and 200, using prime factorization. | 3 |
| 2430 | Find Greatest Common Divisor of 36303, 3836 and 3827, using prime factorization. | 3 |
| 2431 | Find Greatest Common Divisor of 14. | 3 |
| 2432 | Find Greatest Common Divisor of 3454 and 4666, using Euclidean algorithm. | 3 |
| 2433 | Find Greatest Common Divisor of 36 and 81, using prime factorization. | 3 |
| 2434 | Find Greatest Common Divisor of 14 and 42, using prime factorization. | 3 |
| 2435 | Find Greatest Common Divisor of 2, 8 and 6, using prime factorization. | 3 |
| 2436 | Find Greatest Common Divisor of 16593996 and 127, using prime factorization. | 3 |
| 2437 | Find Greatest Common Divisor of 60 and 45, using repeated division. | 3 |
| 2438 | Find Greatest Common Divisor of 180 and 225, by listing out the factors. | 3 |
| 2439 | Find Greatest Common Divisor of 15110 and 10110, using Euclidean algorithm. | 3 |
| 2440 | Find Greatest Common Divisor of 15330 and 10330, using Euclidean algorithm. | 3 |
| 2441 | Find Greatest Common Divisor of 15510 and 10510, using Euclidean algorithm. | 3 |
| 2442 | Find Greatest Common Divisor of 15550 and 10550, using Euclidean algorithm. | 3 |
| 2443 | Find Greatest Common Divisor of 15630 and 10630, using Euclidean algorithm. | 3 |
| 2444 | Find Greatest Common Divisor of 15650 and 10650, using Euclidean algorithm. | 3 |
| 2445 | Find Greatest Common Divisor of 15670 and 10670, using Euclidean algorithm. | 3 |
| 2446 | Find Greatest Common Divisor of 15690 and 10690, using Euclidean algorithm. | 3 |
| 2447 | Find Greatest Common Divisor of 15730 and 10730, using Euclidean algorithm. | 3 |
| 2448 | Find Greatest Common Divisor of 15770 and 10770, using Euclidean algorithm. | 3 |
| 2449 | Find Greatest Common Divisor of 15810 and 10810, using Euclidean algorithm. | 3 |
| 2450 | Find Greatest Common Divisor of 15850 and 10850, using Euclidean algorithm. | 3 |
