GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7801 | Find Greatest Common Divisor of 987 and 343, using Euclidean algorithm. | 1 |
| 7802 | Find Greatest Common Divisor of 48 and 30, using prime factorization. | 1 |
| 7803 | Find Greatest Common Divisor of 462 and 357, using Euclidean algorithm. | 1 |
| 7804 | Find Greatest Common Divisor of 6 and 70, using prime factorization. | 1 |
| 7805 | Find Greatest Common Divisor of 92610000 and 1372000, using prime factorization. | 1 |
| 7806 | Find Greatest Common Divisor of 345 and 587, using Euclidean algorithm. | 1 |
| 7807 | Find Greatest Common Divisor of 70, 90 and 6, using prime factorization. | 1 |
| 7808 | Find Greatest Common Divisor of 28, 36 and 15, using prime factorization. | 1 |
| 7809 | Find Greatest Common Divisor of 1792 and 217, using Euclidean algorithm. | 1 |
| 7810 | Find Greatest Common Divisor of 13 and 131302, using Euclidean algorithm. | 1 |
| 7811 | Find Greatest Common Divisor of 5742 and 5, using Euclidean algorithm. | 1 |
| 7812 | Find Greatest Common Divisor of 623. | 1 |
| 7813 | Find Greatest Common Divisor of 612 and 129, using prime factorization. | 1 |
| 7814 | Find Greatest Common Divisor of 19 and 160, using repeated division. | 1 |
| 7815 | Find Greatest Common Divisor of 73 and 24, using prime factorization. | 1 |
| 7816 | Find Greatest Common Divisor of 56, 112 and 224, using prime factorization. | 1 |
| 7817 | Find Greatest Common Divisor of 106, 212 and 400, using prime factorization. | 1 |
| 7818 | Find Greatest Common Divisor of 102 and 202, using prime factorization. | 1 |
| 7819 | Find Greatest Common Divisor of 84 and 1200, using prime factorization. | 1 |
| 7820 | Find Greatest Common Divisor of 2, 3, 5, 7, 11, 2, 4, 3, 9, 11, 17 and 14, using prime factorization. | 1 |
| 7821 | Find Greatest Common Divisor of 160 and 19, using Euclidean algorithm. | 1 |
| 7822 | Find Greatest Common Divisor of 195 and 65, using Euclidean algorithm. | 1 |
| 7823 | Find Greatest Common Divisor of 1111968 and 2963520, using prime factorization. | 1 |
| 7824 | Find Greatest Common Divisor of 8448 and 13, using Euclidean algorithm. | 1 |
| 7825 | Find Greatest Common Divisor of 2 and 1680, using prime factorization. | 1 |
| 7826 | Find Greatest Common Divisor of 3 and 1680, using prime factorization. | 1 |
| 7827 | Find Greatest Common Divisor of 5 and 1680, using prime factorization. | 1 |
| 7828 | Find Greatest Common Divisor of 13 and 1680, using prime factorization. | 1 |
| 7829 | Find Greatest Common Divisor of 5 and 3016, using prime factorization. | 1 |
| 7830 | Find Greatest Common Divisor of 129 and 236, using Euclidean algorithm. | 1 |
| 7831 | Find Greatest Common Divisor of 512, 518 and 1064, using Euclidean algorithm. | 1 |
| 7832 | Find Greatest Common Divisor of 85 and 425, by listing out the factors. | 1 |
| 7833 | Find Greatest Common Divisor of 947 and 85, using prime factorization. | 1 |
| 7834 | Find Greatest Common Divisor of 947 and 85, using Euclidean algorithm. | 1 |
| 7835 | Find Greatest Common Divisor of 175. | 1 |
| 7836 | Find Greatest Common Divisor of 3094 and 819, using Euclidean algorithm. | 1 |
| 7837 | Find Greatest Common Divisor of 37 and 160, using prime factorization. | 1 |
| 7838 | Find Greatest Common Divisor of 2, 510, 2 and 207, using Euclidean algorithm. | 1 |
| 7839 | Find Greatest Common Divisor of 8, 7 and 8, using prime factorization. | 1 |
| 7840 | Find Greatest Common Divisor of 36, 54 and 90, using repeated division. | 1 |
| 7841 | Find Greatest Common Divisor of 145, 15 and 5, using prime factorization. | 1 |
| 7842 | Find Greatest Common Divisor of 145, 15 and 5, using repeated division. | 1 |
| 7843 | Find Greatest Common Divisor of 7 and 1, using Euclidean algorithm. | 1 |
| 7844 | Find Greatest Common Divisor of 101 and 100, using Euclidean algorithm. | 1 |
| 7845 | Find Greatest Common Divisor of 43 and 33, using prime factorization. | 1 |
| 7846 | Find Greatest Common Divisor of 13113 and 1410, using Euclidean algorithm. | 1 |
| 7847 | Find Greatest Common Divisor of 115, 230 and 345, using Euclidean algorithm. | 1 |
| 7848 | Find Greatest Common Divisor of 1949 and 2436, using Euclidean algorithm. | 1 |
| 7849 | Find Greatest Common Divisor of 24 and 576, using prime factorization. | 1 |
| 7850 | Find Greatest Common Divisor of 380 and 171, by listing out the factors. | 1 |
