GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5351 | Find Greatest Common Divisor of 400 and 500, using prime factorization. | 1 |
| 5352 | Find Greatest Common Divisor of 90 and 54, using Euclidean algorithm. | 1 |
| 5353 | Find Greatest Common Divisor of 12, 20 and 14, using prime factorization. | 1 |
| 5354 | Find Greatest Common Divisor of 133, 55 and 39, using prime factorization. | 1 |
| 5355 | Find Greatest Common Divisor of 91, 209 and 10, using prime factorization. | 1 |
| 5356 | Find Greatest Common Divisor of 210 and 495, using prime factorization. | 1 |
| 5357 | Find Greatest Common Divisor of 9 and 38, using prime factorization. | 1 |
| 5358 | Find Greatest Common Divisor of 153 and 114, using Euclidean algorithm. | 1 |
| 5359 | Find Greatest Common Divisor of 10236 and 244, using prime factorization. | 1 |
| 5360 | Find Greatest Common Divisor of 199 and 991, using prime factorization. | 1 |
| 5361 | Find Greatest Common Divisor of 62839955 and 500000, using Euclidean algorithm. | 1 |
| 5362 | Find Greatest Common Divisor of 875 and 1000, by listing out the factors. | 1 |
| 5363 | Find Greatest Common Divisor of 875 and 1000, using repeated division. | 1 |
| 5364 | Find Greatest Common Divisor of 850 and 1000, using repeated division. | 1 |
| 5365 | Find Greatest Common Divisor of 14828 and 24486, using Euclidean algorithm. | 1 |
| 5366 | Find Greatest Common Divisor of 69 and 115, using prime factorization. | 1 |
| 5367 | Find Greatest Common Divisor of 720 and 1280, using prime factorization. | 1 |
| 5368 | Find Greatest Common Divisor of 505 and 1815, using prime factorization. | 1 |
| 5369 | Find Greatest Common Divisor of 4393 and 4181, using prime factorization. | 1 |
| 5370 | Find Greatest Common Divisor of 2447 and 4181, using prime factorization. | 1 |
| 5371 | Find Greatest Common Divisor of 6641 and 4181, using prime factorization. | 1 |
| 5372 | Find Greatest Common Divisor of 397 and 4181, using prime factorization. | 1 |
| 5373 | Find Greatest Common Divisor of 148 and 59, using Euclidean algorithm. | 1 |
| 5374 | Find Greatest Common Divisor of 2970 and 1260, using prime factorization. | 1 |
| 5375 | Find Greatest Common Divisor of 176 and 20, using prime factorization. | 1 |
| 5376 | Find Greatest Common Divisor of 190 and 24, using prime factorization. | 1 |
| 5377 | Find Greatest Common Divisor of 29 and 80, using Euclidean algorithm. | 1 |
| 5378 | Find Greatest Common Divisor of 8935 and 15, by listing out the factors. | 1 |
| 5379 | Find Greatest Common Divisor of 192 and 8, using Euclidean algorithm. | 1 |
| 5380 | Find Greatest Common Divisor of 192 and 3, using Euclidean algorithm. | 1 |
| 5381 | Find Greatest Common Divisor of 192 and 9, using Euclidean algorithm. | 1 |
| 5382 | Find Greatest Common Divisor of 192 and 7, using prime factorization. | 1 |
| 5383 | Find Greatest Common Divisor of 192 and 11, using prime factorization. | 1 |
| 5384 | Find Greatest Common Divisor of 9223372036854775807. | 1 |
| 5385 | Find Greatest Common Divisor of 72 and 45, using prime factorization. | 1 |
| 5386 | Find Greatest Common Divisor of 252 and 291, using Euclidean algorithm. | 1 |
| 5387 | Find Greatest Common Divisor of 117 and 845, using Euclidean algorithm. | 1 |
| 5388 | Find Greatest Common Divisor of 5387 and 133, using prime factorization. | 1 |
| 5389 | Find Greatest Common Divisor of 5387 and 133, using Euclidean algorithm. | 1 |
| 5390 | Find Greatest Common Divisor of 17 and 11, using Euclidean algorithm. | 1 |
| 5391 | Find Greatest Common Divisor of 223 and 48, using prime factorization. | 1 |
| 5392 | Find Greatest Common Divisor of 111111 and 11111, using Euclidean algorithm. | 1 |
| 5393 | Find Greatest Common Divisor of 192 and 19, using Euclidean algorithm. | 1 |
| 5394 | Find Greatest Common Divisor of 32 and 623, using Euclidean algorithm. | 1 |
| 5395 | Find Greatest Common Divisor of 32 and 263, using Euclidean algorithm. | 1 |
| 5396 | Find Greatest Common Divisor of 446 and 269, using Euclidean algorithm. | 1 |
| 5397 | Find Greatest Common Divisor of 12211 and 10422, using Euclidean algorithm. | 1 |
| 5398 | Find Greatest Common Divisor of 786 and 123, using Euclidean algorithm. | 1 |
| 5399 | Find Greatest Common Divisor of 2, 4, 3, 2, 5, 2, 2, 3, 5 and 2, using prime factorization. | 1 |
| 5400 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using prime factorization. | 1 |
