GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4801 | Find Greatest Common Divisor of 389 and 1570, using prime factorization. | 1 |
| 4802 | Find Greatest Common Divisor of 294 and 398, using Euclidean algorithm. | 1 |
| 4803 | Find Greatest Common Divisor of 845 and 745, using Euclidean algorithm. | 1 |
| 4804 | Find Greatest Common Divisor of 20, 32 and 24, using prime factorization. | 1 |
| 4805 | Find Greatest Common Divisor of 58 and 1, using repeated division. | 1 |
| 4806 | Find Greatest Common Divisor of 109 and 2, using repeated division. | 1 |
| 4807 | Find Greatest Common Divisor of 359 and 125, using repeated division. | 1 |
| 4808 | Find Greatest Common Divisor of 1320 and 1065, using Euclidean algorithm. | 1 |
| 4809 | Find Greatest Common Divisor of 1320 and 1065, by listing out the factors. | 1 |
| 4810 | Find Greatest Common Divisor of 238 and 1105, using Euclidean algorithm. | 1 |
| 4811 | Find Greatest Common Divisor of 240 and 360, using Euclidean algorithm. | 1 |
| 4812 | Find Greatest Common Divisor of 177 and 346, using prime factorization. | 1 |
| 4813 | Find Greatest Common Divisor of 12345 and 67890, using prime factorization. | 1 |
| 4814 | Find Greatest Common Divisor of 234 and 564, using Euclidean algorithm. | 1 |
| 4815 | Find Greatest Common Divisor of 34 and 567, using prime factorization. | 1 |
| 4816 | Find Greatest Common Divisor of 6120 and 2040, using prime factorization. | 1 |
| 4817 | Find Greatest Common Divisor of 6120 and 2040, using repeated division. | 1 |
| 4818 | Find Greatest Common Divisor of 6120 and 2040, by listing out the factors. | 1 |
| 4819 | Find Greatest Common Divisor of 6120 and 2040, using Euclidean algorithm. | 1 |
| 4820 | Find Greatest Common Divisor of 725 and 236, using prime factorization. | 1 |
| 4821 | Find Greatest Common Divisor of 34 and 1649, using Euclidean algorithm. | 1 |
| 4822 | Find Greatest Common Divisor of 91 and 1649, using Euclidean algorithm. | 1 |
| 4823 | Find Greatest Common Divisor of 97 and 1649, using Euclidean algorithm. | 1 |
| 4824 | Find Greatest Common Divisor of 3578 and 9512, using Euclidean algorithm. | 1 |
| 4825 | Find Greatest Common Divisor of 9873, 543 and 21, using Euclidean algorithm. | 1 |
| 4826 | Find Greatest Common Divisor of 375 and 588, using prime factorization. | 1 |
| 4827 | Find Greatest Common Divisor of 251, 33 and 257, using prime factorization. | 1 |
| 4828 | Find Greatest Common Divisor of 221 and 143, using prime factorization. | 1 |
| 4829 | Find Greatest Common Divisor of 221 and 143, using Euclidean algorithm. | 1 |
| 4830 | Find Greatest Common Divisor of 140 and 9, using prime factorization. | 1 |
| 4831 | Find Greatest Common Divisor of 77 and 60, using prime factorization. | 1 |
| 4832 | Find Greatest Common Divisor of 16261 and 11270, using prime factorization. | 1 |
| 4833 | Find Greatest Common Divisor of 2014 and 10000, using prime factorization. | 1 |
| 4834 | Find Greatest Common Divisor of 260 and 455, using Euclidean algorithm. | 1 |
| 4835 | Find Greatest Common Divisor of 480 and 1800, using Euclidean algorithm. | 1 |
| 4836 | Find Greatest Common Divisor of 120 and 144, using Euclidean algorithm. | 1 |
| 4837 | Find Greatest Common Divisor of 210 and 861, using Euclidean algorithm. | 1 |
| 4838 | Find Greatest Common Divisor of 1386 and 1170, using Euclidean algorithm. | 1 |
| 4839 | Find Greatest Common Divisor of 17 and 374904, using Euclidean algorithm. | 1 |
| 4840 | Find Greatest Common Divisor of 3 and 393624, using Euclidean algorithm. | 1 |
| 4841 | Find Greatest Common Divisor of 761457 and 614573, using Euclidean algorithm. | 1 |
| 4842 | Find Greatest Common Divisor of 2394 and 342, using repeated division. | 1 |
| 4843 | Find Greatest Common Divisor of 2, 42, 1, 2, 96 and 1, using prime factorization. | 1 |
| 4844 | Find Greatest Common Divisor of 102 and 351, by listing out the factors. | 1 |
| 4845 | Find Greatest Common Divisor of 31415 and 14142, by listing out the factors. | 1 |
| 4846 | Find Greatest Common Divisor of 5740875 and 4762800, using prime factorization. | 1 |
| 4847 | Find Greatest Common Divisor of 6, 9 and 12, using prime factorization. | 1 |
| 4848 | Find Greatest Common Divisor of 14 and 400, using prime factorization. | 1 |
| 4849 | Find Greatest Common Divisor of 162 and 97, using Euclidean algorithm. | 1 |
| 4850 | Find Greatest Common Divisor of 84 and 28, using Euclidean algorithm. | 1 |
