GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5751 | Find Greatest Common Divisor of 69 and 34, using prime factorization. | 1 |
| 5752 | Find Greatest Common Divisor of 69 and 34, using Euclidean algorithm. | 1 |
| 5753 | Find Greatest Common Divisor of 60 and 30, using Euclidean algorithm. | 1 |
| 5754 | Find Greatest Common Divisor of 50 and 15, using Euclidean algorithm. | 1 |
| 5755 | Find Greatest Common Divisor of 99 and 18, using Euclidean algorithm. | 1 |
| 5756 | Find Greatest Common Divisor of 88 and 9, using Euclidean algorithm. | 1 |
| 5757 | Find Greatest Common Divisor of 88 and 18, using Euclidean algorithm. | 1 |
| 5758 | Find Greatest Common Divisor of 6437 and 2393, using Euclidean algorithm. | 1 |
| 5759 | Find Greatest Common Divisor of 51 and 93, using prime factorization. | 1 |
| 5760 | Find Greatest Common Divisor of 51 and 93, using repeated division. | 1 |
| 5761 | Find Greatest Common Divisor of 51 and 93, using Euclidean algorithm. | 1 |
| 5762 | Find Greatest Common Divisor of 1586 and 899, using Euclidean algorithm. | 1 |
| 5763 | Find Greatest Common Divisor of 46 and 64, using prime factorization. | 1 |
| 5764 | Find Greatest Common Divisor of 890 and 525, using prime factorization. | 1 |
| 5765 | Find Greatest Common Divisor of 18 and 22, using prime factorization. | 1 |
| 5766 | Find Greatest Common Divisor of 1 and 8, using repeated division. | 1 |
| 5767 | Find Greatest Common Divisor of 115 and 184, using repeated division. | 1 |
| 5768 | Find Greatest Common Divisor of 165 and 285, using prime factorization. | 1 |
| 5769 | Find Greatest Common Divisor of 165 and 285, using Euclidean algorithm. | 1 |
| 5770 | Find Greatest Common Divisor of 91, 64 and 87, using repeated division. | 1 |
| 5771 | Find Greatest Common Divisor of 28 and 38, using prime factorization. | 1 |
| 5772 | Find Greatest Common Divisor of 28 and 38, using repeated division. | 1 |
| 5773 | Find Greatest Common Divisor of 28 and 38, using Euclidean algorithm. | 1 |
| 5774 | Find Greatest Common Divisor of 54 and 68, using prime factorization. | 1 |
| 5775 | Find Greatest Common Divisor of 2000 and 3000, using prime factorization. | 1 |
| 5776 | Find Greatest Common Divisor of 34 and 18, using prime factorization. | 1 |
| 5777 | Find Greatest Common Divisor of 378 and 140, using prime factorization. | 1 |
| 5778 | Find Greatest Common Divisor of 378 and 140, using repeated division. | 1 |
| 5779 | Find Greatest Common Divisor of 31 and 12, using prime factorization. | 1 |
| 5780 | Find Greatest Common Divisor of 10 and 30, using Euclidean algorithm. | 1 |
| 5781 | Find Greatest Common Divisor of 42 and 18, using Euclidean algorithm. | 1 |
| 5782 | Find Greatest Common Divisor of 110 and 2511, by listing out the factors. | 1 |
| 5783 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, using prime factorization. | 1 |
| 5784 | Find Greatest Common Divisor of 616 and 32, using prime factorization. | 1 |
| 5785 | Find Greatest Common Divisor of 2282 and 420, using prime factorization. | 1 |
| 5786 | Find Greatest Common Divisor of 48153687 and 165849, using prime factorization. | 1 |
| 5787 | Find Greatest Common Divisor of 2, 50, 1, 2, 60 and 1, using prime factorization. | 1 |
| 5788 | Find Greatest Common Divisor of 23, 17, 23 and 31, using prime factorization. | 1 |
| 5789 | Find Greatest Common Divisor of 7, 5, 4, 3, 1, 8, 5, 5, 3, 2, 2 and 2, using Euclidean algorithm. | 1 |
| 5790 | Find Greatest Common Divisor of 160 and 1, using prime factorization. | 1 |
| 5791 | Find Greatest Common Divisor of 2915 and 1445, using repeated division. | 1 |
| 5792 | Find Greatest Common Divisor of 147 and 91, using Euclidean algorithm. | 1 |
| 5793 | Find Greatest Common Divisor of 130 and 99, using Euclidean algorithm. | 1 |
| 5794 | Find Greatest Common Divisor of 5, 9, 2 and 3, using Euclidean algorithm. | 1 |
| 5795 | Find Greatest Common Divisor of 52 and 104, using prime factorization. | 1 |
| 5796 | Find Greatest Common Divisor of 3 and 111, using prime factorization. | 1 |
| 5797 | Find Greatest Common Divisor of 2 and 111, using prime factorization. | 1 |
| 5798 | Find Greatest Common Divisor of 1547 and 3536, using prime factorization. | 1 |
| 5799 | Find Greatest Common Divisor of 1547 and 3543, using Euclidean algorithm. | 1 |
| 5800 | Find Greatest Common Divisor of 23, 10, 23 and 7, using prime factorization. | 1 |
