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 602 and 1505, using prime factorization. | 1 |
| 5352 | Find Greatest Common Divisor of 26. | 1 |
| 5353 | Find Greatest Common Divisor of 56. | 1 |
| 5354 | Find Greatest Common Divisor of 1296 and 384, using prime factorization. | 1 |
| 5355 | Find Greatest Common Divisor of 1296 and 384, using Euclidean algorithm. | 1 |
| 5356 | Find Greatest Common Divisor of 136 and 170, using Euclidean algorithm. | 1 |
| 5357 | Find Greatest Common Divisor of 900 and 270, using prime factorization. | 1 |
| 5358 | Find Greatest Common Divisor of 441, 567 and 693, using prime factorization. | 1 |
| 5359 | Find Greatest Common Divisor of 136, 170 and 255, using prime factorization. | 1 |
| 5360 | Find Greatest Common Divisor of 900 and 27, using prime factorization. | 1 |
| 5361 | Find Greatest Common Divisor of 11033442 and 1102246, using Euclidean algorithm. | 1 |
| 5362 | Find Greatest Common Divisor of 513 and 99, using prime factorization. | 1 |
| 5363 | Find Greatest Common Divisor of 84 and 338, using prime factorization. | 1 |
| 5364 | Find Greatest Common Divisor of 1 and 0, using repeated division. | 1 |
| 5365 | Find Greatest Common Divisor of 9 and 8, using Euclidean algorithm. | 1 |
| 5366 | Find Greatest Common Divisor of 5 and 5, using Euclidean algorithm. | 1 |
| 5367 | Find Greatest Common Divisor of 2 and 47, using Euclidean algorithm. | 1 |
| 5368 | Find Greatest Common Divisor of 5 and 1, using Euclidean algorithm. | 1 |
| 5369 | Find Greatest Common Divisor of 10 and 16, using Euclidean algorithm. | 1 |
| 5370 | Find Greatest Common Divisor of 14 and 35, using Euclidean algorithm. | 1 |
| 5371 | Find Greatest Common Divisor of 25 and 40, using Euclidean algorithm. | 1 |
| 5372 | Find Greatest Common Divisor of 81 and 37, using Euclidean algorithm. | 1 |
| 5373 | Find Greatest Common Divisor of 452 and 6004, using prime factorization. | 1 |
| 5374 | Find Greatest Common Divisor of 270 and 292, using prime factorization. | 1 |
| 5375 | Find Greatest Common Divisor of 111111 and 11111, using prime factorization. | 1 |
| 5376 | Find Greatest Common Divisor of 504 and 7, using prime factorization. | 1 |
| 5377 | Find Greatest Common Divisor of 56 and 9, using prime factorization. | 1 |
| 5378 | Find Greatest Common Divisor of 504 and 5, using prime factorization. | 1 |
| 5379 | Find Greatest Common Divisor of 2520 and 499, using prime factorization. | 1 |
| 5380 | Find Greatest Common Divisor of 684 and 28, using Euclidean algorithm. | 1 |
| 5381 | Find Greatest Common Divisor of 224 and 44, using Euclidean algorithm. | 1 |
| 5382 | Find Greatest Common Divisor of 228 and 44, using Euclidean algorithm. | 1 |
| 5383 | Find Greatest Common Divisor of 18 and 35, using prime factorization. | 1 |
| 5384 | Find Greatest Common Divisor of 18 and 35, using repeated division. | 1 |
| 5385 | Find Greatest Common Divisor of 30 and 35, using repeated division. | 1 |
| 5386 | Find Greatest Common Divisor of 30 and 35, using Euclidean algorithm. | 1 |
| 5387 | Find Greatest Common Divisor of 18 and 35, using Euclidean algorithm. | 1 |
| 5388 | Find Greatest Common Divisor of 76290 and 26880, using prime factorization. | 1 |
| 5389 | Find Greatest Common Divisor of 2023. | 1 |
| 5390 | Find Greatest Common Divisor of 2023 and 4046, using prime factorization. | 1 |
| 5391 | Find Greatest Common Divisor of 1003 and 2006, using prime factorization. | 1 |
| 5392 | Find Greatest Common Divisor of 12 and 28, using Euclidean algorithm. | 1 |
| 5393 | Find Greatest Common Divisor of 224 and 256, using Euclidean algorithm. | 1 |
| 5394 | Find Greatest Common Divisor of 580 and 252, using prime factorization. | 1 |
| 5395 | Find Greatest Common Divisor of 2603 and 2423, using prime factorization. | 1 |
| 5396 | Find Greatest Common Divisor of 2036 and 2423, using prime factorization. | 1 |
| 5397 | Find Greatest Common Divisor of 3062 and 2423, using prime factorization. | 1 |
| 5398 | Find Greatest Common Divisor of 3026 and 243, using prime factorization. | 1 |
| 5399 | Find Greatest Common Divisor of 679 and 2019, using prime factorization. | 1 |
| 5400 | Find Greatest Common Divisor of 673 and 2019, using prime factorization. | 1 |