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 9 and 512, using prime factorization. | 2 |
| 2552 | Find Greatest Common Divisor of 169 and 6, using Euclidean algorithm. | 2 |
| 2553 | Find Greatest Common Divisor of 223 and 11, using Euclidean algorithm. | 2 |
| 2554 | Find Greatest Common Divisor of 52 and 30, using Euclidean algorithm. | 2 |
| 2555 | Find Greatest Common Divisor of 1625 and 975, using repeated division. | 2 |
| 2556 | Find Greatest Common Divisor of 1625 and 975, using prime factorization. | 2 |
| 2557 | Find Greatest Common Divisor of 3 and 40, using Euclidean algorithm. | 2 |
| 2558 | Find Greatest Common Divisor of 74, 89 and 96, using prime factorization. | 2 |
| 2559 | Find Greatest Common Divisor of 21 and 7, using Euclidean algorithm. | 2 |
| 2560 | Find Greatest Common Divisor of 299 and 3, using prime factorization. | 2 |
| 2561 | Find Greatest Common Divisor of 3 and 99, using prime factorization. | 2 |
| 2562 | Find Greatest Common Divisor of 16 and 112, using repeated division. | 2 |
| 2563 | Find Greatest Common Divisor of 25, 30 and 35, using repeated division. | 2 |
| 2564 | Find Greatest Common Divisor of 16, 20 and 28, using repeated division. | 2 |
| 2565 | Find Greatest Common Divisor of 20, 30, 36 and 45, using repeated division. | 2 |
| 2566 | Find Greatest Common Divisor of 24 and 138, using prime factorization. | 2 |
| 2567 | Find Greatest Common Divisor of 902 and 412, using Euclidean algorithm. | 2 |
| 2568 | Find Greatest Common Divisor of 405 and 1372, using prime factorization. | 2 |
| 2569 | Find Greatest Common Divisor of 2 and 26, using prime factorization. | 2 |
| 2570 | Find Greatest Common Divisor of 1251096 and 29249, using Euclidean algorithm. | 2 |
| 2571 | Find Greatest Common Divisor of 1920 and 108, using prime factorization. | 2 |
| 2572 | Find Greatest Common Divisor of 4284 and 3480, using prime factorization. | 2 |
| 2573 | Find Greatest Common Divisor of 1000 and 19680, using prime factorization. | 2 |
| 2574 | Find Greatest Common Divisor of 2 and 27, using prime factorization. | 2 |
| 2575 | Find Greatest Common Divisor of 1, 4, 2 and 2, using prime factorization. | 2 |
| 2576 | Find Greatest Common Divisor of 351 and 527, using prime factorization. | 2 |
| 2577 | Find Greatest Common Divisor of 63862 and 45598, using prime factorization. | 2 |
| 2578 | Find Greatest Common Divisor of 106, 5 and 31, using prime factorization. | 2 |
| 2579 | Find Greatest Common Divisor of 123123 and 1000000, using prime factorization. | 2 |
| 2580 | Find Greatest Common Divisor of 514596726 and 1176, using prime factorization. | 2 |
| 2581 | Find Greatest Common Divisor of 63 and 315, using prime factorization. | 2 |
| 2582 | Find Greatest Common Divisor of 18 and 126, using prime factorization. | 2 |
| 2583 | Find Greatest Common Divisor of 3000 and 1215000000, using prime factorization. | 2 |
| 2584 | Find Greatest Common Divisor of 75 and 360, using prime factorization. | 2 |
| 2585 | Find Greatest Common Divisor of 20 and 50, using prime factorization. | 2 |
| 2586 | Find Greatest Common Divisor of 48 and 24, using prime factorization. | 2 |
| 2587 | Find Greatest Common Divisor of 13, 3, 3, 2, 2 and 1, using prime factorization. | 2 |
| 2588 | Find Greatest Common Divisor of 48 and 4, using prime factorization. | 2 |
| 2589 | Find Greatest Common Divisor of 45. | 2 |
| 2590 | Find Greatest Common Divisor of 255 and 633, using Euclidean algorithm. | 2 |
| 2591 | Find Greatest Common Divisor of 144. | 2 |
| 2592 | Find Greatest Common Divisor of 91 and 143, using Euclidean algorithm. | 2 |
| 2593 | Find Greatest Common Divisor of 2310 and 2311, using Euclidean algorithm. | 2 |
| 2594 | Find Greatest Common Divisor of 77, 105 and 143, using Euclidean algorithm. | 2 |
| 2595 | Find Greatest Common Divisor of 30, 42 and 70, using prime factorization. | 2 |
| 2596 | Find Greatest Common Divisor of 1860 and 484, using Euclidean algorithm. | 2 |
| 2597 | Find Greatest Common Divisor of 112 and 30, using Euclidean algorithm. | 2 |
| 2598 | Find Greatest Common Divisor of 32 and 640, using prime factorization. | 2 |
| 2599 | Find Greatest Common Divisor of 316 and 8051, using Euclidean algorithm. | 2 |
| 2600 | Find Greatest Common Divisor of 316 and 8051, using prime factorization. | 2 |