GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4751 | Find Greatest Common Divisor of 123456 and 654321, using Euclidean algorithm. | 2 |
| 4752 | Find Greatest Common Divisor of 1236 and 61, using prime factorization. | 2 |
| 4753 | Find Greatest Common Divisor of 1000 and 20, using prime factorization. | 2 |
| 4754 | Find Greatest Common Divisor of 1280. | 2 |
| 4755 | Find Greatest Common Divisor of 7 and 1000, using prime factorization. | 2 |
| 4756 | Find Greatest Common Divisor of 15 and 26, using prime factorization. | 2 |
| 4757 | Find Greatest Common Divisor of 16 and 26, using prime factorization. | 2 |
| 4758 | Find Greatest Common Divisor of 22 and 26, using prime factorization. | 2 |
| 4759 | Find Greatest Common Divisor of 18 and 26, using prime factorization. | 2 |
| 4760 | Find Greatest Common Divisor of 553 and 4, using prime factorization. | 2 |
| 4761 | Find Greatest Common Divisor of 2053 and 5, using repeated division. | 2 |
| 4762 | Find Greatest Common Divisor of 156 and 52, using prime factorization. | 2 |
| 4763 | Find Greatest Common Divisor of 1025 and 22, using repeated division. | 2 |
| 4764 | Find Greatest Common Divisor of 106 and 53, using Euclidean algorithm. | 2 |
| 4765 | Find Greatest Common Divisor of 12 and 66, by listing out the factors. | 2 |
| 4766 | Find Greatest Common Divisor of 235 and 45, using prime factorization. | 2 |
| 4767 | Find Greatest Common Divisor of 665 and 805, using prime factorization. | 2 |
| 4768 | Find Greatest Common Divisor of 99 and 41, using prime factorization. | 2 |
| 4769 | Find Greatest Common Divisor of 277 and 1031, using prime factorization. | 2 |
| 4770 | Find Greatest Common Divisor of 155 and 95, using prime factorization. | 2 |
| 4771 | Find Greatest Common Divisor of 49, 7 and 14, using prime factorization. | 2 |
| 4772 | Find Greatest Common Divisor of 3, 14, 3, 14, 18, 18, 8, 8, 8 and 8, using prime factorization. | 2 |
| 4773 | Find Greatest Common Divisor of 300 and 155, using Euclidean algorithm. | 2 |
| 4774 | Find Greatest Common Divisor of 41 and 71, using prime factorization. | 2 |
| 4775 | Find Greatest Common Divisor of 12 and 25, using prime factorization. | 2 |
| 4776 | Find Greatest Common Divisor of 4675 and 12055, using prime factorization. | 2 |
| 4777 | Find Greatest Common Divisor of 625 and 180, using prime factorization. | 2 |
| 4778 | Find Greatest Common Divisor of 18 and 25, using prime factorization. | 2 |
| 4779 | Find Greatest Common Divisor of 5 and 26, using Euclidean algorithm. | 2 |
| 4780 | Find Greatest Common Divisor of 16 and 29, using Euclidean algorithm. | 2 |
| 4781 | Find Greatest Common Divisor of 82472 and 79300, using prime factorization. | 2 |
| 4782 | Find Greatest Common Divisor of 600 and 480, using prime factorization. | 2 |
| 4783 | Find Greatest Common Divisor of 429 and 299, using Euclidean algorithm. | 2 |
| 4784 | Find Greatest Common Divisor of 429 and 299, using repeated division. | 2 |
| 4785 | Find Greatest Common Divisor of 429 and 299, by listing out the factors. | 2 |
| 4786 | Find Greatest Common Divisor of 210 and 45, using Euclidean algorithm. | 2 |
| 4787 | Find Greatest Common Divisor of 1109 and 4999, using Euclidean algorithm. | 2 |
| 4788 | Find Greatest Common Divisor of 24 and 12, using prime factorization. | 2 |
| 4789 | Find Greatest Common Divisor of 424 and 82, using repeated division. | 2 |
| 4790 | Find Greatest Common Divisor of 424 and 82, using Euclidean algorithm. | 2 |
| 4791 | Find Greatest Common Divisor of 2 and 2147483647, using Euclidean algorithm. | 2 |
| 4792 | Find Greatest Common Divisor of 500 and 40, using Euclidean algorithm. | 2 |
| 4793 | Find Greatest Common Divisor of 2, 6, 12, 20 and 30, using prime factorization. | 2 |
| 4794 | Find Greatest Common Divisor of 51, 68 and 85, using prime factorization. | 2 |
| 4795 | Find Greatest Common Divisor of 8, 18 and 30, using repeated division. | 2 |
| 4796 | Find Greatest Common Divisor of 5544 and 6600, using Euclidean algorithm. | 2 |
| 4797 | Find Greatest Common Divisor of 33 and 16, using prime factorization. | 2 |
| 4798 | Find Greatest Common Divisor of 128 and 164, using prime factorization. | 2 |
| 4799 | Find Greatest Common Divisor of 328, 769, 541, 986, 215 and 734, using prime factorization. | 2 |
| 4800 | Find Greatest Common Divisor of 2151 and 863, using repeated division. | 2 |