GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
2151 | Find Greatest Common Divisor of 0 and 72, using prime factorization. | 1 |
2152 | Find Greatest Common Divisor of 14 and 35, by listing out the factors. | 1 |
2153 | Find Greatest Common Divisor of 6, 9 and 12, by listing out the factors. | 1 |
2154 | Find Greatest Common Divisor of 10 and 65, using prime factorization. | 1 |
2155 | Find Greatest Common Divisor of 0 and 72, using Euclidean algorithm. | 1 |
2156 | Find Greatest Common Divisor of 2 and 55, using Euclidean algorithm. | 1 |
2157 | Find Greatest Common Divisor of 720 and 350, using prime factorization. | 1 |
2158 | Find Greatest Common Divisor of 12 and 120, using prime factorization. | 1 |
2159 | Find Greatest Common Divisor of 106, 159 and 265, using prime factorization. | 1 |
2160 | Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using repeated division. | 1 |
2161 | Find Greatest Common Divisor of 3, 25 and 5, using Euclidean algorithm. | 1 |
2162 | Find Greatest Common Divisor of 3 and 11, using Euclidean algorithm. | 1 |
2163 | Find Greatest Common Divisor of 3 and 1680, using prime factorization. | 1 |
2164 | Find Greatest Common Divisor of 31 and 17, using Euclidean algorithm. | 1 |
2165 | Find Greatest Common Divisor of 7 and 12, using prime factorization. | 1 |
2166 | Find Greatest Common Divisor of 5 and 72, using repeated division. | 1 |
2167 | Find Greatest Common Divisor of 2375 and 362, using prime factorization. | 1 |
2168 | Find Greatest Common Divisor of 495. | 1 |
2169 | Find Greatest Common Divisor of 56 and 72, by listing out the factors. | 1 |
2170 | Find Greatest Common Divisor of 1651 and 2032, by listing out the factors. | 1 |
2171 | Find Greatest Common Divisor of 75 and 50, using Euclidean algorithm. | 1 |
2172 | Find Greatest Common Divisor of 4884 and 5365, using prime factorization. | 1 |
2173 | Find Greatest Common Divisor of 125 and 350, using prime factorization. | 1 |
2174 | Find Greatest Common Divisor of 5 and 1680, using prime factorization. | 1 |
2175 | Find Greatest Common Divisor of 761457 and 614573, using Euclidean algorithm. | 1 |
2176 | Find Greatest Common Divisor of 378 and 140, using repeated division. | 1 |
2177 | Find Greatest Common Divisor of 73556 and 3444, using Euclidean algorithm. | 1 |
2178 | Find Greatest Common Divisor of 90 and 53, using Euclidean algorithm. | 1 |
2179 | Find Greatest Common Divisor of 754 and 33, using prime factorization. | 1 |
2180 | Find Greatest Common Divisor of 477 and 990, using prime factorization. | 1 |
2181 | Find Greatest Common Divisor of 19 and 160, using repeated division. | 1 |
2182 | Find Greatest Common Divisor of 11 and 3, using Euclidean algorithm. | 1 |
2183 | Find Greatest Common Divisor of 13 and 1680, using prime factorization. | 1 |
2184 | Find Greatest Common Divisor of 4, 3, 8, 2, 20, 24, 2, 3, 18, 2, 46 and 30, using prime factorization. | 1 |
2185 | Find Greatest Common Divisor of 1 and 12, using prime factorization. | 1 |
2186 | Find Greatest Common Divisor of 231 and 1000, using Euclidean algorithm. | 1 |
2187 | Find Greatest Common Divisor of 1000, 9 and 6, using prime factorization. | 1 |
2188 | Find Greatest Common Divisor of 118 and 25, using Euclidean algorithm. | 1 |
2189 | Find Greatest Common Divisor of 2394 and 342, using repeated division. | 1 |
2190 | Find Greatest Common Divisor of 91 and 267, using Euclidean algorithm. | 1 |
2191 | Find Greatest Common Divisor of 82 and 72, using Euclidean algorithm. | 1 |
2192 | Find Greatest Common Divisor of 114 and 522, using prime factorization. | 1 |
2193 | Find Greatest Common Divisor of 31 and 12, using prime factorization. | 1 |
2194 | Find Greatest Common Divisor of 160 and 1, using prime factorization. | 1 |
2195 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using Euclidean algorithm. | 1 |
2196 | Find Greatest Common Divisor of 456 and 25824, using prime factorization. | 1 |
2197 | Find Greatest Common Divisor of 46 and 32, using Euclidean algorithm. | 1 |
2198 | Find Greatest Common Divisor of 140. | 1 |
2199 | Find Greatest Common Divisor of 3912 and 618, using prime factorization. | 1 |
2200 | Find Greatest Common Divisor of 45 and 16, using prime factorization. | 1 |