GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2651 | Find Greatest Common Divisor of 123456 and 789, using Euclidean algorithm. | 3 |
| 2652 | Find Greatest Common Divisor of 24 and 69, using Euclidean algorithm. | 3 |
| 2653 | Find Greatest Common Divisor of 160 and 3, using prime factorization. | 3 |
| 2654 | Find Greatest Common Divisor of 3, 2 and 2, using prime factorization. | 3 |
| 2655 | Find Greatest Common Divisor of 2024 and 1058, using Euclidean algorithm. | 3 |
| 2656 | Find Greatest Common Divisor of 3 and 20, using prime factorization. | 3 |
| 2657 | Find Greatest Common Divisor of 17 and 3120, using repeated division. | 3 |
| 2658 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using Euclidean algorithm. | 3 |
| 2659 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using repeated division. | 3 |
| 2660 | Find Greatest Common Divisor of 17 and 34, using repeated division. | 3 |
| 2661 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using repeated division. | 3 |
| 2662 | Find Greatest Common Divisor of 6468 and 14300, using prime factorization. | 3 |
| 2663 | Find Greatest Common Divisor of 160 and 7, using repeated division. | 3 |
| 2664 | Find Greatest Common Divisor of 2 and 1, using prime factorization. | 3 |
| 2665 | Find Greatest Common Divisor of 7 and 40, using prime factorization. | 3 |
| 2666 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using prime factorization. | 3 |
| 2667 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, by listing out the factors. | 3 |
| 2668 | Find Greatest Common Divisor of 192, 256 and 304, using prime factorization. | 3 |
| 2669 | Find Greatest Common Divisor of 27, 80, 108, 20 and 75, using prime factorization. | 3 |
| 2670 | Find Greatest Common Divisor of 7 and 26, using Euclidean algorithm. | 3 |
| 2671 | Find Greatest Common Divisor of 21 and 2511, using Euclidean algorithm. | 3 |
| 2672 | Find Greatest Common Divisor of 110 and 2511, using Euclidean algorithm. | 3 |
| 2673 | Find Greatest Common Divisor of 105 and 120, using prime factorization. | 3 |
| 2674 | Find Greatest Common Divisor of 112 and 144, using prime factorization. | 3 |
| 2675 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, using prime factorization. | 3 |
| 2676 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, by listing out the factors. | 3 |
| 2677 | Find Greatest Common Divisor of 115 and 184, using prime factorization. | 3 |
| 2678 | Find Greatest Common Divisor of 28 and 52, using Euclidean algorithm. | 3 |
| 2679 | Find Greatest Common Divisor of 52 and 54, using repeated division. | 3 |
| 2680 | Find Greatest Common Divisor of 3. | 3 |
| 2681 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, by listing out the factors. | 3 |
| 2682 | Find Greatest Common Divisor of 291 and 252, using repeated division. | 3 |
| 2683 | Find Greatest Common Divisor of 3219 and 74, using Euclidean algorithm. | 3 |
| 2684 | Find Greatest Common Divisor of 2024 and 748, using Euclidean algorithm. | 3 |
| 2685 | Find Greatest Common Divisor of 16 and 31, using Euclidean algorithm. | 3 |
| 2686 | Find Greatest Common Divisor of 16 and 31, using repeated division. | 3 |
| 2687 | Find Greatest Common Divisor of 20240605010777. | 3 |
| 2688 | Find Greatest Common Divisor of 20240605010778. | 3 |
| 2689 | Find Greatest Common Divisor of 419 and 105, using Euclidean algorithm. | 3 |
| 2690 | Find Greatest Common Divisor of 645 and 363, using Euclidean algorithm. | 3 |
| 2691 | Find Greatest Common Divisor of 49152 and 81000, using prime factorization. | 3 |
| 2692 | Find Greatest Common Divisor of 512 and 18, using Euclidean algorithm. | 3 |
| 2693 | Find Greatest Common Divisor of 1160718174. | 3 |
| 2694 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using repeated division. | 3 |
| 2695 | Find Greatest Common Divisor of 21 and 91, using prime factorization. | 3 |
| 2696 | Find Greatest Common Divisor of 89 and 98, using Euclidean algorithm. | 3 |
| 2697 | Find Greatest Common Divisor of 8, 13, 39, 42 and 48, by listing out the factors. | 3 |
| 2698 | Find Greatest Common Divisor of 44 and 17, using Euclidean algorithm. | 3 |
| 2699 | Find Greatest Common Divisor of 403, 465 and 651, using prime factorization. | 3 |
| 2700 | Find Greatest Common Divisor of 143 and 277, using Euclidean algorithm. | 3 |
