GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2751 | Find Greatest Common Divisor of 800, 500, 300 and 1000, by listing out the factors. | 3 |
| 2752 | Find Greatest Common Divisor of 60, 90 and 120, using prime factorization. | 3 |
| 2753 | Find Greatest Common Divisor of 1234567 and 7654321, using repeated division. | 3 |
| 2754 | Find Greatest Common Divisor of 183 and 47, using Euclidean algorithm. | 3 |
| 2755 | Find Greatest Common Divisor of 213 and 79, using Euclidean algorithm. | 3 |
| 2756 | Find Greatest Common Divisor of 215 and 81, using Euclidean algorithm. | 3 |
| 2757 | Find Greatest Common Divisor of 215 and 98, using Euclidean algorithm. | 3 |
| 2758 | Find Greatest Common Divisor of 7 and 5, using Euclidean algorithm. | 3 |
| 2759 | Find Greatest Common Divisor of 55 and 99, using prime factorization. | 3 |
| 2760 | Find Greatest Common Divisor of 154 and 198, using prime factorization. | 3 |
| 2761 | Find Greatest Common Divisor of 662 and 414, using Euclidean algorithm. | 3 |
| 2762 | Find Greatest Common Divisor of 77 and 9, using Euclidean algorithm. | 3 |
| 2763 | Find Greatest Common Divisor of 77 and 22, using prime factorization. | 3 |
| 2764 | Find Greatest Common Divisor of 300 and 10, using prime factorization. | 3 |
| 2765 | Find Greatest Common Divisor of 150 and 5, using prime factorization. | 3 |
| 2766 | Find Greatest Common Divisor of 623 and 406, using prime factorization. | 3 |
| 2767 | Find Greatest Common Divisor of 120 and 75, using Euclidean algorithm. | 3 |
| 2768 | Find Greatest Common Divisor of 1, 2, 3 and 7, using Euclidean algorithm. | 3 |
| 2769 | Find Greatest Common Divisor of 65025 and 16, using Euclidean algorithm. | 3 |
| 2770 | Find Greatest Common Divisor of 32, 60 and 68, using repeated division. | 3 |
| 2771 | Find Greatest Common Divisor of 206 and 16, using prime factorization. | 3 |
| 2772 | Find Greatest Common Divisor of 84 and 198, using prime factorization. | 3 |
| 2773 | Find Greatest Common Divisor of 840 and 630, using repeated division. | 3 |
| 2774 | Find Greatest Common Divisor of 710 and 310, using prime factorization. | 2 |
| 2775 | Find Greatest Common Divisor of 252 and 105, using prime factorization. | 2 |
| 2776 | Find Greatest Common Divisor of 798 and 111, using prime factorization. | 2 |
| 2777 | Find Greatest Common Divisor of 120000, 144000 and 15000, using prime factorization. | 2 |
| 2778 | Find Greatest Common Divisor of 1340 and 1340, using prime factorization. | 2 |
| 2779 | Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm. | 2 |
| 2780 | Find Greatest Common Divisor of 84 and 96, using prime factorization. | 2 |
| 2781 | Find Greatest Common Divisor of 165, 45 and 5, using prime factorization. | 2 |
| 2782 | Find Greatest Common Divisor of 5 and 288, using prime factorization. | 2 |
| 2783 | Find Greatest Common Divisor of 250 and 134, using prime factorization. | 2 |
| 2784 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using Euclidean algorithm. | 2 |
| 2785 | Find Greatest Common Divisor of 889 and 246, using Euclidean algorithm. | 2 |
| 2786 | Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm. | 2 |
| 2787 | Find Greatest Common Divisor of 357 and 476, using prime factorization. | 2 |
| 2788 | Find Greatest Common Divisor of 585 and 169, using Euclidean algorithm. | 2 |
| 2789 | Find Greatest Common Divisor of 12 and 24, using Euclidean algorithm. | 2 |
| 2790 | Find Greatest Common Divisor of 1 and 7, using Euclidean algorithm. | 2 |
| 2791 | Find Greatest Common Divisor of 132 and 100, using prime factorization. | 2 |
| 2792 | Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm. | 2 |
| 2793 | Find Greatest Common Divisor of 1513 and 120, using prime factorization. | 2 |
| 2794 | Find Greatest Common Divisor of 99 and 81, using prime factorization. | 2 |
| 2795 | Find Greatest Common Divisor of 5616 and 54756, using prime factorization. | 2 |
| 2796 | Find Greatest Common Divisor of 111 and 201, using Euclidean algorithm. | 2 |
| 2797 | Find Greatest Common Divisor of 3, 1 and 1, using Euclidean algorithm. | 2 |
| 2798 | Find Greatest Common Divisor of 16 and 35, using Euclidean algorithm. | 2 |
| 2799 | Find Greatest Common Divisor of 32, 56 and 78, using repeated division. | 2 |
| 2800 | Find Greatest Common Divisor of 2907 and 105, using prime factorization. | 2 |