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 1955 and 29030, using Euclidean algorithm. | 1 |
| 4752 | Find Greatest Common Divisor of 96 and 144, using prime factorization. | 1 |
| 4753 | Find Greatest Common Divisor of 681 and 43, using prime factorization. | 1 |
| 4754 | Find Greatest Common Divisor of 681 and 43, using Euclidean algorithm. | 1 |
| 4755 | Find Greatest Common Divisor of 10672 and 4147, by listing out the factors. | 1 |
| 4756 | Find Greatest Common Divisor of 12 and 42, using prime factorization. | 1 |
| 4757 | Find Greatest Common Divisor of 1610 and 667, using Euclidean algorithm. | 1 |
| 4758 | Find Greatest Common Divisor of 115 and 46, using Euclidean algorithm. | 1 |
| 4759 | Find Greatest Common Divisor of 250, 148 and 316, using prime factorization. | 1 |
| 4760 | Find Greatest Common Divisor of 524 and 148, using prime factorization. | 1 |
| 4761 | Find Greatest Common Divisor of 630 and 1260, using repeated division. | 1 |
| 4762 | Find Greatest Common Divisor of 324, 378 and 1890, using repeated division. | 1 |
| 4763 | Find Greatest Common Divisor of 115 and 644, using repeated division. | 1 |
| 4764 | Find Greatest Common Divisor of 216 and 234, using Euclidean algorithm. | 1 |
| 4765 | Find Greatest Common Divisor of 84 and 36, using prime factorization. | 1 |
| 4766 | Find Greatest Common Divisor of 1794 and 2346, using prime factorization. | 1 |
| 4767 | Find Greatest Common Divisor of 557 and 239, using Euclidean algorithm. | 1 |
| 4768 | Find Greatest Common Divisor of 11, 3, 7 and 2, using prime factorization. | 1 |
| 4769 | Find Greatest Common Divisor of 29106 and 5382, using Euclidean algorithm. | 1 |
| 4770 | Find Greatest Common Divisor of 28260 and 5148, using Euclidean algorithm. | 1 |
| 4771 | Find Greatest Common Divisor of 28539 and 5088, using Euclidean algorithm. | 1 |
| 4772 | Find Greatest Common Divisor of 13 and 3, using Euclidean algorithm. | 1 |
| 4773 | Find Greatest Common Divisor of 18 and 6, using Euclidean algorithm. | 1 |
| 4774 | Find Greatest Common Divisor of 4 and 20, by listing out the factors. | 1 |
| 4775 | Find Greatest Common Divisor of 317 and 525, using prime factorization. | 1 |
| 4776 | Find Greatest Common Divisor of 289 and 377, using Euclidean algorithm. | 1 |
| 4777 | Find Greatest Common Divisor of 750, 242 and 9, using prime factorization. | 1 |
| 4778 | Find Greatest Common Divisor of 25 and 17, using Euclidean algorithm. | 1 |
| 4779 | Find Greatest Common Divisor of 9800, 420 and 2520, by listing out the factors. | 1 |
| 4780 | Find Greatest Common Divisor of 18, 12 and 24, using repeated division. | 1 |
| 4781 | Find Greatest Common Divisor of 8925 and 76576500, using prime factorization. | 1 |
| 4782 | Find Greatest Common Divisor of 169, 28, 16, 8, 160, 28, 292, 108, 56, 68, 72, 28, 124, 52 and 264, using prime factorization. | 1 |
| 4783 | Find Greatest Common Divisor of 35, 88, 16, 260, 92, 140, 100, 80, 80 and 344, using prime factorization. | 1 |
| 4784 | Find Greatest Common Divisor of 314 and 159, using Euclidean algorithm. | 1 |
| 4785 | Find Greatest Common Divisor of 504 and 295, using Euclidean algorithm. | 1 |
| 4786 | Find Greatest Common Divisor of 3 and 11, using Euclidean algorithm. | 1 |
| 4787 | Find Greatest Common Divisor of 97 and 7000, by listing out the factors. | 1 |
| 4788 | Find Greatest Common Divisor of 37, 13 and 11, using prime factorization. | 1 |
| 4789 | Find Greatest Common Divisor of 56 and 128, using prime factorization. | 1 |
| 4790 | Find Greatest Common Divisor of 123 and 321, using prime factorization. | 1 |
| 4791 | Find Greatest Common Divisor of 406 and 945, by listing out the factors. | 1 |
| 4792 | Find Greatest Common Divisor of 170 and 122, using Euclidean algorithm. | 1 |
| 4793 | Find Greatest Common Divisor of 170 and 122, using prime factorization. | 1 |
| 4794 | Find Greatest Common Divisor of 12378 and 467, using prime factorization. | 1 |
| 4795 | Find Greatest Common Divisor of 1110 and 0, using prime factorization. | 1 |
| 4796 | Find Greatest Common Divisor of 57 and 0, using Euclidean algorithm. | 1 |
| 4797 | Find Greatest Common Divisor of 36542 and 22022, using prime factorization. | 1 |
| 4798 | Find Greatest Common Divisor of 147 and 70, using prime factorization. | 1 |
| 4799 | Find Greatest Common Divisor of 10 and 409, using prime factorization. | 1 |
| 4800 | Find Greatest Common Divisor of 10234 and 578, using Euclidean algorithm. | 1 |
