GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 8301 | Find Greatest Common Divisor of 210 and 495, using prime factorization. | 1 |
| 8302 | Find Greatest Common Divisor of 9 and 38, using prime factorization. | 1 |
| 8303 | Find Greatest Common Divisor of 153 and 114, using Euclidean algorithm. | 1 |
| 8304 | Find Greatest Common Divisor of 10236 and 244, using prime factorization. | 1 |
| 8305 | Find Greatest Common Divisor of 199 and 991, using prime factorization. | 1 |
| 8306 | Find Greatest Common Divisor of 62839955 and 500000, using Euclidean algorithm. | 1 |
| 8307 | Find Greatest Common Divisor of 875 and 1000, by listing out the factors. | 1 |
| 8308 | Find Greatest Common Divisor of 875 and 1000, using repeated division. | 1 |
| 8309 | Find Greatest Common Divisor of 850 and 1000, using repeated division. | 1 |
| 8310 | Find Greatest Common Divisor of 14828 and 24486, using Euclidean algorithm. | 1 |
| 8311 | Find Greatest Common Divisor of 69 and 115, using prime factorization. | 1 |
| 8312 | Find Greatest Common Divisor of 720 and 1280, using prime factorization. | 1 |
| 8313 | Find Greatest Common Divisor of 505 and 1815, using prime factorization. | 1 |
| 8314 | Find Greatest Common Divisor of 4393 and 4181, using prime factorization. | 1 |
| 8315 | Find Greatest Common Divisor of 2447 and 4181, using prime factorization. | 1 |
| 8316 | Find Greatest Common Divisor of 6641 and 4181, using prime factorization. | 1 |
| 8317 | Find Greatest Common Divisor of 397 and 4181, using prime factorization. | 1 |
| 8318 | Find Greatest Common Divisor of 148 and 59, using Euclidean algorithm. | 1 |
| 8319 | Find Greatest Common Divisor of 2970 and 1260, using prime factorization. | 1 |
| 8320 | Find Greatest Common Divisor of 176 and 20, using prime factorization. | 1 |
| 8321 | Find Greatest Common Divisor of 190 and 24, using prime factorization. | 1 |
| 8322 | Find Greatest Common Divisor of 29 and 80, using Euclidean algorithm. | 1 |
| 8323 | Find Greatest Common Divisor of 8935 and 15, by listing out the factors. | 1 |
| 8324 | Find Greatest Common Divisor of 192 and 8, using Euclidean algorithm. | 1 |
| 8325 | Find Greatest Common Divisor of 192 and 3, using Euclidean algorithm. | 1 |
| 8326 | Find Greatest Common Divisor of 192 and 9, using Euclidean algorithm. | 1 |
| 8327 | Find Greatest Common Divisor of 192 and 7, using prime factorization. | 1 |
| 8328 | Find Greatest Common Divisor of 192 and 11, using prime factorization. | 1 |
| 8329 | Find Greatest Common Divisor of 9223372036854775807. | 1 |
| 8330 | Find Greatest Common Divisor of 72 and 45, using prime factorization. | 1 |
| 8331 | Find Greatest Common Divisor of 252 and 291, using Euclidean algorithm. | 1 |
| 8332 | Find Greatest Common Divisor of 117 and 845, using Euclidean algorithm. | 1 |
| 8333 | Find Greatest Common Divisor of 5387 and 133, using prime factorization. | 1 |
| 8334 | Find Greatest Common Divisor of 5387 and 133, using Euclidean algorithm. | 1 |
| 8335 | Find Greatest Common Divisor of 17 and 11, using Euclidean algorithm. | 1 |
| 8336 | Find Greatest Common Divisor of 223 and 48, using prime factorization. | 1 |
| 8337 | Find Greatest Common Divisor of 111111 and 11111, using Euclidean algorithm. | 1 |
| 8338 | Find Greatest Common Divisor of 192 and 19, using Euclidean algorithm. | 1 |
| 8339 | Find Greatest Common Divisor of 32 and 623, using Euclidean algorithm. | 1 |
| 8340 | Find Greatest Common Divisor of 32 and 263, using Euclidean algorithm. | 1 |
| 8341 | Find Greatest Common Divisor of 446 and 269, using Euclidean algorithm. | 1 |
| 8342 | Find Greatest Common Divisor of 12211 and 10422, using Euclidean algorithm. | 1 |
| 8343 | Find Greatest Common Divisor of 786 and 123, using Euclidean algorithm. | 1 |
| 8344 | Find Greatest Common Divisor of 2, 4, 3, 2, 5, 2, 2, 3, 5 and 2, using prime factorization. | 1 |
| 8345 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using prime factorization. | 1 |
| 8346 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, by listing out the factors. | 1 |
| 8347 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using Euclidean algorithm. | 1 |
| 8348 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using repeated division. | 1 |
| 8349 | Find Greatest Common Divisor of 150 and 51, using prime factorization. | 1 |
| 8350 | Find Greatest Common Divisor of 44, 32 and 54, using prime factorization. | 1 |
