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 518 and 194, using Euclidean algorithm. | 1 |
| 5752 | Find Greatest Common Divisor of 518 and 172, using Euclidean algorithm. | 1 |
| 5753 | Find Greatest Common Divisor of 598 and 172, using Euclidean algorithm. | 1 |
| 5754 | Find Greatest Common Divisor of 1071 and 577, using Euclidean algorithm. | 1 |
| 5755 | Find Greatest Common Divisor of 1071 and 588, using Euclidean algorithm. | 1 |
| 5756 | Find Greatest Common Divisor of 128 and 34, using prime factorization. | 1 |
| 5757 | Find Greatest Common Divisor of 128 and 54, using Euclidean algorithm. | 1 |
| 5758 | Find Greatest Common Divisor of 875 and 288, using prime factorization. | 1 |
| 5759 | Find Greatest Common Divisor of 345 and 234, using repeated division. | 1 |
| 5760 | Find Greatest Common Divisor of 8466 and 7684, using prime factorization. | 1 |
| 5761 | Find Greatest Common Divisor of 1 and 26, using Euclidean algorithm. | 1 |
| 5762 | Find Greatest Common Divisor of 18769 and 327, using prime factorization. | 1 |
| 5763 | Find Greatest Common Divisor of 5264 and 15472, using repeated division. | 1 |
| 5764 | Find Greatest Common Divisor of 5264 and 15472, using Euclidean algorithm. | 1 |
| 5765 | Find Greatest Common Divisor of 7 and 120, using Euclidean algorithm. | 1 |
| 5766 | Find Greatest Common Divisor of 7 and 120, using repeated division. | 1 |
| 5767 | Find Greatest Common Divisor of 65537. | 1 |
| 5768 | Find Greatest Common Divisor of 24, 26 and 50, using prime factorization. | 1 |
| 5769 | Find Greatest Common Divisor of 24, 26 and 50, by listing out the factors. | 1 |
| 5770 | Find Greatest Common Divisor of 201, 27 and 90, by listing out the factors. | 1 |
| 5771 | Find Greatest Common Divisor of 2, 6, 5351, 0, 5, 0, 71627, 7171, 5351, 5351, 1, 0, 716, 717071, 9738 and 9738, using prime factorization. | 1 |
| 5772 | Find Greatest Common Divisor of 2, 6, 5351, 0, 5, 0, 71627, 7171, 5351, 5351, 1, 0, 716, 717071, 5168 and 5168, using prime factorization. | 1 |
| 5773 | Find Greatest Common Divisor of 2, 6, 0, 71627, 7171, 4121, 4121, 1, 0, 716, 717071, 4121, 1213 and 1213, using prime factorization. | 1 |
| 5774 | Find Greatest Common Divisor of 2, 6, 0, 71627, 7171, 4121, 4121, 1, 0, 716, 717071, 4121, 3523 and 3523, using prime factorization. | 1 |
| 5775 | Find Greatest Common Divisor of 2, 6, 4962, 113, 98, 122, 113, 113, 4962, 4962, 49, 48, 113, 106, 113, 112, 113, 5453 and 5453, using prime factorization. | 1 |
| 5776 | Find Greatest Common Divisor of 2, 6, 4962, 113, 98, 122, 113, 113, 4962, 4962, 49, 48, 113, 106, 113, 112, 113, 8834 and 8834, using prime factorization. | 1 |
| 5777 | Find Greatest Common Divisor of 2, 6 and 8172, using prime factorization. | 1 |
| 5778 | Find Greatest Common Divisor of 2, 6 and 7035, using prime factorization. | 1 |
| 5779 | Find Greatest Common Divisor of 2, 6 and 6019, using prime factorization. | 1 |
| 5780 | Find Greatest Common Divisor of 2, 6 and 5905, using prime factorization. | 1 |
| 5781 | Find Greatest Common Divisor of 2, 6 and 6685, using prime factorization. | 1 |
| 5782 | Find Greatest Common Divisor of 2, 6 and 2440, using prime factorization. | 1 |
| 5783 | Find Greatest Common Divisor of 2, 6 and 1614, using prime factorization. | 1 |
| 5784 | Find Greatest Common Divisor of 2, 6 and 2518, using prime factorization. | 1 |
| 5785 | Find Greatest Common Divisor of 340 and 800, using repeated division. | 1 |
| 5786 | Find Greatest Common Divisor of 226, 5, 1008 and 40, using prime factorization. | 1 |
| 5787 | Find Greatest Common Divisor of 187 and 19, using prime factorization. | 1 |
| 5788 | Find Greatest Common Divisor of 187 and 19, using Euclidean algorithm. | 1 |
| 5789 | Find Greatest Common Divisor of 25, 55 and 555, using Euclidean algorithm. | 1 |
| 5790 | Find Greatest Common Divisor of 25, 55 and 5, using Euclidean algorithm. | 1 |
| 5791 | Find Greatest Common Divisor of 5315135135 and 566666666, using Euclidean algorithm. | 1 |
| 5792 | Find Greatest Common Divisor of 25 and 5, using Euclidean algorithm. | 1 |
| 5793 | Find Greatest Common Divisor of 5 and 25, using Euclidean algorithm. | 1 |
| 5794 | Find Greatest Common Divisor of 66 and 7, using Euclidean algorithm. | 1 |
| 5795 | Find Greatest Common Divisor of 7 and 7, using Euclidean algorithm. | 1 |
| 5796 | Find Greatest Common Divisor of 27 and 86, using Euclidean algorithm. | 1 |
| 5797 | Find Greatest Common Divisor of 274 and 30, using prime factorization. | 1 |
| 5798 | Find Greatest Common Divisor of 5655 and 12075, using Euclidean algorithm. | 1 |
| 5799 | Find Greatest Common Divisor of 36, 42 and 54, using prime factorization. | 1 |
| 5800 | Find Greatest Common Divisor of 7000000000000000 and 10487275715782582, using repeated division. | 1 |
