GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6051 | Find Greatest Common Divisor of 2, 3, 5, 7, 11, 2, 4, 3, 9, 11, 17 and 14, using prime factorization. | 1 |
| 6052 | Find Greatest Common Divisor of 160 and 19, using Euclidean algorithm. | 1 |
| 6053 | Find Greatest Common Divisor of 195 and 65, using Euclidean algorithm. | 1 |
| 6054 | Find Greatest Common Divisor of 1111968 and 2963520, using prime factorization. | 1 |
| 6055 | Find Greatest Common Divisor of 8448 and 13, using Euclidean algorithm. | 1 |
| 6056 | Find Greatest Common Divisor of 2 and 1680, using prime factorization. | 1 |
| 6057 | Find Greatest Common Divisor of 3 and 1680, using prime factorization. | 1 |
| 6058 | Find Greatest Common Divisor of 5 and 1680, using prime factorization. | 1 |
| 6059 | Find Greatest Common Divisor of 13 and 1680, using prime factorization. | 1 |
| 6060 | Find Greatest Common Divisor of 5 and 3016, using prime factorization. | 1 |
| 6061 | Find Greatest Common Divisor of 129 and 236, using Euclidean algorithm. | 1 |
| 6062 | Find Greatest Common Divisor of 512, 518 and 1064, using Euclidean algorithm. | 1 |
| 6063 | Find Greatest Common Divisor of 85 and 425, by listing out the factors. | 1 |
| 6064 | Find Greatest Common Divisor of 947 and 85, using prime factorization. | 1 |
| 6065 | Find Greatest Common Divisor of 947 and 85, using Euclidean algorithm. | 1 |
| 6066 | Find Greatest Common Divisor of 175. | 1 |
| 6067 | Find Greatest Common Divisor of 3094 and 819, using Euclidean algorithm. | 1 |
| 6068 | Find Greatest Common Divisor of 37 and 160, using prime factorization. | 1 |
| 6069 | Find Greatest Common Divisor of 2, 510, 2 and 207, using Euclidean algorithm. | 1 |
| 6070 | Find Greatest Common Divisor of 8, 7 and 8, using prime factorization. | 1 |
| 6071 | Find Greatest Common Divisor of 36, 54 and 90, using repeated division. | 1 |
| 6072 | Find Greatest Common Divisor of 145, 15 and 5, using prime factorization. | 1 |
| 6073 | Find Greatest Common Divisor of 145, 15 and 5, using repeated division. | 1 |
| 6074 | Find Greatest Common Divisor of 7 and 1, using Euclidean algorithm. | 1 |
| 6075 | Find Greatest Common Divisor of 101 and 100, using Euclidean algorithm. | 1 |
| 6076 | Find Greatest Common Divisor of 43 and 33, using prime factorization. | 1 |
| 6077 | Find Greatest Common Divisor of 13113 and 1410, using Euclidean algorithm. | 1 |
| 6078 | Find Greatest Common Divisor of 115, 230 and 345, using Euclidean algorithm. | 1 |
| 6079 | Find Greatest Common Divisor of 1949 and 2436, using Euclidean algorithm. | 1 |
| 6080 | Find Greatest Common Divisor of 24 and 576, using prime factorization. | 1 |
| 6081 | Find Greatest Common Divisor of 380 and 171, by listing out the factors. | 1 |
| 6082 | Find Greatest Common Divisor of 155 and 52, using Euclidean algorithm. | 1 |
| 6083 | Find Greatest Common Divisor of 39 and 56, using repeated division. | 1 |
| 6084 | Find Greatest Common Divisor of 39 and 56, using prime factorization. | 1 |
| 6085 | Find Greatest Common Divisor of 7255 and 2000, using Euclidean algorithm. | 1 |
| 6086 | Find Greatest Common Divisor of 130 and 221, using Euclidean algorithm. | 1 |
| 6087 | Find Greatest Common Divisor of 1461 and 117, using Euclidean algorithm. | 1 |
| 6088 | Find Greatest Common Divisor of 663 and 39, using repeated division. | 1 |
| 6089 | Find Greatest Common Divisor of 663 and 39, using Euclidean algorithm. | 1 |
| 6090 | Find Greatest Common Divisor of 2286 and 2575, using Euclidean algorithm. | 1 |
| 6091 | Find Greatest Common Divisor of 6825 and 11846, using prime factorization. | 1 |
| 6092 | Find Greatest Common Divisor of 6825 and 11846, using Euclidean algorithm. | 1 |
| 6093 | Find Greatest Common Divisor of 6897 and 1597, using Euclidean algorithm. | 1 |
| 6094 | Find Greatest Common Divisor of 6897 and 11155, using Euclidean algorithm. | 1 |
| 6095 | Find Greatest Common Divisor of 75 and 618, using prime factorization. | 1 |
| 6096 | Find Greatest Common Divisor of 25 and 952, using prime factorization. | 1 |
| 6097 | Find Greatest Common Divisor of 2040 and 629, using Euclidean algorithm. | 1 |
| 6098 | Find Greatest Common Divisor of 48, 108 and 120, using prime factorization. | 1 |
| 6099 | Find Greatest Common Divisor of 52 and 234, using prime factorization. | 1 |
| 6100 | Find Greatest Common Divisor of 168 and 126, by listing out the factors. | 1 |
