GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2551 | Find Greatest Common Divisor of 315 and 441, using repeated division. | 3 |
| 2552 | Find Greatest Common Divisor of 6666600000 and 6666666666, using Euclidean algorithm. | 3 |
| 2553 | Find Greatest Common Divisor of 80 and 44, using Euclidean algorithm. | 3 |
| 2554 | Find Greatest Common Divisor of 7 and 120, using prime factorization. | 3 |
| 2555 | Find Greatest Common Divisor of 337 and 674, using prime factorization. | 3 |
| 2556 | Find Greatest Common Divisor of 108 and 144, by listing out the factors. | 3 |
| 2557 | Find Greatest Common Divisor of 130 and 115, using Euclidean algorithm. | 3 |
| 2558 | Find Greatest Common Divisor of 123456789 and 987654321, using prime factorization. | 3 |
| 2559 | Find Greatest Common Divisor of 840 and 1080, using prime factorization. | 3 |
| 2560 | Find Greatest Common Divisor of 70, 120 and 217, using prime factorization. | 3 |
| 2561 | Find Greatest Common Divisor of 70 and 120, using Euclidean algorithm. | 3 |
| 2562 | Find Greatest Common Divisor of 113 and 143, using prime factorization. | 3 |
| 2563 | Find Greatest Common Divisor of 14 and 26, using prime factorization. | 3 |
| 2564 | Find Greatest Common Divisor of 83 and 19, using prime factorization. | 3 |
| 2565 | Find Greatest Common Divisor of 144 and 192, using prime factorization. | 3 |
| 2566 | Find Greatest Common Divisor of 841 and 160, using Euclidean algorithm. | 3 |
| 2567 | Find Greatest Common Divisor of 0 and 3, using prime factorization. | 3 |
| 2568 | Find Greatest Common Divisor of 1 and 17, using prime factorization. | 3 |
| 2569 | Find Greatest Common Divisor of 3 and 53, using prime factorization. | 3 |
| 2570 | Find Greatest Common Divisor of 55, 35 and 50, using Euclidean algorithm. | 3 |
| 2571 | Find Greatest Common Divisor of 16534528044 and 8332745927, using prime factorization. | 3 |
| 2572 | Find Greatest Common Divisor of 49 and 168, using prime factorization. | 3 |
| 2573 | Find Greatest Common Divisor of 11520 and 5670, using prime factorization. | 3 |
| 2574 | Find Greatest Common Divisor of 1100 and 57330, using prime factorization. | 3 |
| 2575 | Find Greatest Common Divisor of 30 and 17, using Euclidean algorithm. | 3 |
| 2576 | Find Greatest Common Divisor of 1025 and 35, using prime factorization. | 3 |
| 2577 | Find Greatest Common Divisor of 6536 and 9503, using Euclidean algorithm. | 3 |
| 2578 | Find Greatest Common Divisor of 67890 and 12345, using prime factorization. | 3 |
| 2579 | Find Greatest Common Divisor of 32 and 936, using repeated division. | 3 |
| 2580 | Find Greatest Common Divisor of 10, 25 and 22, using prime factorization. | 3 |
| 2581 | Find Greatest Common Divisor of 9800, 420 and 2520, using repeated division. | 3 |
| 2582 | Find Greatest Common Divisor of 9800, 420 and 2520, using prime factorization. | 3 |
| 2583 | Find Greatest Common Divisor of 3, 24, 27, 33, 42 and 46, using repeated division. | 3 |
| 2584 | Find Greatest Common Divisor of 45 and 56, using prime factorization. | 3 |
| 2585 | Find Greatest Common Divisor of 20 and 10, using repeated division. | 3 |
| 2586 | Find Greatest Common Divisor of 20 and 7, using repeated division. | 3 |
| 2587 | Find Greatest Common Divisor of 160 and 9, using repeated division. | 3 |
| 2588 | Find Greatest Common Divisor of 75 and 253, using prime factorization. | 3 |
| 2589 | Find Greatest Common Divisor of 11391 and 5673, using Euclidean algorithm. | 3 |
| 2590 | Find Greatest Common Divisor of 232 and 562, using Euclidean algorithm. | 3 |
| 2591 | Find Greatest Common Divisor of 1432 and 156, using prime factorization. | 3 |
| 2592 | Find Greatest Common Divisor of 359 and 125, using Euclidean algorithm. | 3 |
| 2593 | Find Greatest Common Divisor of 388 and 189, using repeated division. | 3 |
| 2594 | Find Greatest Common Divisor of 388 and 189, using prime factorization. | 3 |
| 2595 | Find Greatest Common Divisor of 7250 and 2360, using Euclidean algorithm. | 3 |
| 2596 | Find Greatest Common Divisor of 420 and 200, using prime factorization. | 3 |
| 2597 | Find Greatest Common Divisor of 36303, 3836 and 3827, using prime factorization. | 3 |
| 2598 | Find Greatest Common Divisor of 14. | 3 |
| 2599 | Find Greatest Common Divisor of 3454 and 4666, using Euclidean algorithm. | 3 |
| 2600 | Find Greatest Common Divisor of 36 and 81, using prime factorization. | 3 |
