GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2601 | Find Greatest Common Divisor of 14 and 42, using prime factorization. | 3 |
| 2602 | Find Greatest Common Divisor of 2, 8 and 6, using prime factorization. | 3 |
| 2603 | Find Greatest Common Divisor of 2 and 0, using Euclidean algorithm. | 3 |
| 2604 | Find Greatest Common Divisor of 2 and 0, using prime factorization. | 3 |
| 2605 | Find Greatest Common Divisor of 5 and 12, using Euclidean algorithm. | 3 |
| 2606 | Find Greatest Common Divisor of 79 and 41, using prime factorization. | 3 |
| 2607 | Find Greatest Common Divisor of 46, 69 and 92, by listing out the factors. | 3 |
| 2608 | Find Greatest Common Divisor of 2, 5 and 7, using prime factorization. | 3 |
| 2609 | Find Greatest Common Divisor of 807 and 481, using Euclidean algorithm. | 3 |
| 2610 | Find Greatest Common Divisor of 24 and 48, using repeated division. | 3 |
| 2611 | Find Greatest Common Divisor of 12075 and 4655, using prime factorization. | 3 |
| 2612 | Find Greatest Common Divisor of 12075 and 4655, using Euclidean algorithm. | 3 |
| 2613 | Find Greatest Common Divisor of 270 and 192, using repeated division. | 3 |
| 2614 | Find Greatest Common Divisor of 175, 225 and 350, using repeated division. | 3 |
| 2615 | Find Greatest Common Divisor of 11 and 25, using Euclidean algorithm. | 3 |
| 2616 | Find Greatest Common Divisor of 98 and 24, using Euclidean algorithm. | 3 |
| 2617 | Find Greatest Common Divisor of 72 and 52, using Euclidean algorithm. | 3 |
| 2618 | Find Greatest Common Divisor of 150 and 890, using prime factorization. | 3 |
| 2619 | Find Greatest Common Divisor of 77 and 28, using prime factorization. | 3 |
| 2620 | Find Greatest Common Divisor of 114 and 312, using repeated division. | 3 |
| 2621 | Find Greatest Common Divisor of 3 and 3016, using prime factorization. | 3 |
| 2622 | Find Greatest Common Divisor of 257 and 532, using Euclidean algorithm. | 3 |
| 2623 | Find Greatest Common Divisor of 153 and 119, using prime factorization. | 3 |
| 2624 | Find Greatest Common Divisor of 311 and 28, using prime factorization. | 3 |
| 2625 | Find Greatest Common Divisor of 311 and 28, using Euclidean algorithm. | 3 |
| 2626 | Find Greatest Common Divisor of 12 and 1234, using prime factorization. | 3 |
| 2627 | Find Greatest Common Divisor of 2517 and 2370, using Euclidean algorithm. | 3 |
| 2628 | Find Greatest Common Divisor of 1024 and 2256, using Euclidean algorithm. | 3 |
| 2629 | Find Greatest Common Divisor of 663 and 39, using prime factorization. | 3 |
| 2630 | Find Greatest Common Divisor of 316 and 180, using prime factorization. | 3 |
| 2631 | Find Greatest Common Divisor of 93 and 119, using prime factorization. | 3 |
| 2632 | Find Greatest Common Divisor of 78 and 741, using prime factorization. | 3 |
| 2633 | Find Greatest Common Divisor of 36 and 90, using prime factorization. | 3 |
| 2634 | Find Greatest Common Divisor of 97 and 1045, using Euclidean algorithm. | 3 |
| 2635 | Find Greatest Common Divisor of 12345 and 54321, using prime factorization. | 3 |
| 2636 | Find Greatest Common Divisor of 816 and 2260, using Euclidean algorithm. | 3 |
| 2637 | Find Greatest Common Divisor of 211 and 575, using prime factorization. | 3 |
| 2638 | Find Greatest Common Divisor of 2024 and 112, using Euclidean algorithm. | 3 |
| 2639 | Find Greatest Common Divisor of 1160718174 and 316258250, using prime factorization. | 3 |
| 2640 | Find Greatest Common Divisor of 16 and 38, using prime factorization. | 3 |
| 2641 | Find Greatest Common Divisor of 12 and 15, using Euclidean algorithm. | 3 |
| 2642 | Find Greatest Common Divisor of 3 and 1, using Euclidean algorithm. | 3 |
| 2643 | Find Greatest Common Divisor of 11607 and 3162, using Euclidean algorithm. | 3 |
| 2644 | Find Greatest Common Divisor of 2468 and 1357, using Euclidean algorithm. | 3 |
| 2645 | Find Greatest Common Divisor of 15 and 13, using Euclidean algorithm. | 3 |
| 2646 | Find Greatest Common Divisor of 1716 and 1260, using Euclidean algorithm. | 3 |
| 2647 | Find Greatest Common Divisor of 1056 and 228, using Euclidean algorithm. | 3 |
| 2648 | Find Greatest Common Divisor of 377 and 2303, using prime factorization. | 3 |
| 2649 | Find Greatest Common Divisor of 4001 and 2689, using Euclidean algorithm. | 3 |
| 2650 | Find Greatest Common Divisor of 33 and 145, using prime factorization. | 3 |
