GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2151 | Find Greatest Common Divisor of 5000000000. | 4 |
| 2152 | Find Greatest Common Divisor of 17 and 6, using Euclidean algorithm. | 4 |
| 2153 | Find Greatest Common Divisor of 192 and 5, using prime factorization. | 4 |
| 2154 | Find Greatest Common Divisor of 1000, 500, 0, 500 and 1000, using prime factorization. | 4 |
| 2155 | Find Greatest Common Divisor of 2 and 0, using Euclidean algorithm. | 3 |
| 2156 | Find Greatest Common Divisor of 2 and 0, using prime factorization. | 3 |
| 2157 | Find Greatest Common Divisor of 5 and 12, using Euclidean algorithm. | 3 |
| 2158 | Find Greatest Common Divisor of 79 and 41, using prime factorization. | 3 |
| 2159 | Find Greatest Common Divisor of 46, 69 and 92, by listing out the factors. | 3 |
| 2160 | Find Greatest Common Divisor of 2, 5 and 7, using prime factorization. | 3 |
| 2161 | Find Greatest Common Divisor of 807 and 481, using Euclidean algorithm. | 3 |
| 2162 | Find Greatest Common Divisor of 396 and 792, by listing out the factors. | 3 |
| 2163 | Find Greatest Common Divisor of 24 and 48, using repeated division. | 3 |
| 2164 | Find Greatest Common Divisor of 12075 and 4655, using prime factorization. | 3 |
| 2165 | Find Greatest Common Divisor of 12075 and 4655, using Euclidean algorithm. | 3 |
| 2166 | Find Greatest Common Divisor of 270 and 192, using repeated division. | 3 |
| 2167 | Find Greatest Common Divisor of 175, 225 and 350, using repeated division. | 3 |
| 2168 | Find Greatest Common Divisor of 11 and 25, using Euclidean algorithm. | 3 |
| 2169 | Find Greatest Common Divisor of 98 and 24, using Euclidean algorithm. | 3 |
| 2170 | Find Greatest Common Divisor of 72 and 52, using Euclidean algorithm. | 3 |
| 2171 | Find Greatest Common Divisor of 150 and 890, using prime factorization. | 3 |
| 2172 | Find Greatest Common Divisor of 77 and 28, using prime factorization. | 3 |
| 2173 | Find Greatest Common Divisor of 114 and 312, using repeated division. | 3 |
| 2174 | Find Greatest Common Divisor of 3 and 3016, using prime factorization. | 3 |
| 2175 | Find Greatest Common Divisor of 257 and 532, using Euclidean algorithm. | 3 |
| 2176 | Find Greatest Common Divisor of 153 and 119, using prime factorization. | 3 |
| 2177 | Find Greatest Common Divisor of 311 and 28, using prime factorization. | 3 |
| 2178 | Find Greatest Common Divisor of 311 and 28, using Euclidean algorithm. | 3 |
| 2179 | Find Greatest Common Divisor of 12 and 1234, using prime factorization. | 3 |
| 2180 | Find Greatest Common Divisor of 2517 and 2370, using Euclidean algorithm. | 3 |
| 2181 | Find Greatest Common Divisor of 1024 and 2256, using Euclidean algorithm. | 3 |
| 2182 | Find Greatest Common Divisor of 663 and 39, using prime factorization. | 3 |
| 2183 | Find Greatest Common Divisor of 316 and 180, using prime factorization. | 3 |
| 2184 | Find Greatest Common Divisor of 93 and 119, using prime factorization. | 3 |
| 2185 | Find Greatest Common Divisor of 78 and 741, using prime factorization. | 3 |
| 2186 | Find Greatest Common Divisor of 36 and 90, using prime factorization. | 3 |
| 2187 | Find Greatest Common Divisor of 42 and 70, using prime factorization. | 3 |
| 2188 | Find Greatest Common Divisor of 97 and 1045, using Euclidean algorithm. | 3 |
| 2189 | Find Greatest Common Divisor of 12345 and 54321, using prime factorization. | 3 |
| 2190 | Find Greatest Common Divisor of 816 and 2260, using Euclidean algorithm. | 3 |
| 2191 | Find Greatest Common Divisor of 211 and 575, using prime factorization. | 3 |
| 2192 | Find Greatest Common Divisor of 2024 and 112, using Euclidean algorithm. | 3 |
| 2193 | Find Greatest Common Divisor of 1160718174 and 316258250, using prime factorization. | 3 |
| 2194 | Find Greatest Common Divisor of 16 and 38, using prime factorization. | 3 |
| 2195 | Find Greatest Common Divisor of 12 and 15, using Euclidean algorithm. | 3 |
| 2196 | Find Greatest Common Divisor of 3 and 1, using Euclidean algorithm. | 3 |
| 2197 | Find Greatest Common Divisor of 11607 and 3162, using Euclidean algorithm. | 3 |
| 2198 | Find Greatest Common Divisor of 1769 and 2378, using Euclidean algorithm. | 3 |
| 2199 | Find Greatest Common Divisor of 2468 and 1357, using Euclidean algorithm. | 3 |
| 2200 | Find Greatest Common Divisor of 15 and 13, using Euclidean algorithm. | 3 |
