GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5551 | Find Greatest Common Divisor of 243000000 and 259200, using prime factorization. | 1 |
| 5552 | Find Greatest Common Divisor of 238. | 1 |
| 5553 | Find Greatest Common Divisor of 16 and 224, using repeated division. | 1 |
| 5554 | Find Greatest Common Divisor of 2274 and 917, using prime factorization. | 1 |
| 5555 | Find Greatest Common Divisor of 42828 and 6409, using prime factorization. | 1 |
| 5556 | Find Greatest Common Divisor of 42828 and 6409, using Euclidean algorithm. | 1 |
| 5557 | Find Greatest Common Divisor of 6508 and 3465, using prime factorization. | 1 |
| 5558 | Find Greatest Common Divisor of 4148 and 7864, using Euclidean algorithm. | 1 |
| 5559 | Find Greatest Common Divisor of 36, 54, 90, 126, 9223372036854775807 and 968349, using prime factorization. | 1 |
| 5560 | Find Greatest Common Divisor of 36, 54, 90, 126 and 9912499122, using prime factorization. | 1 |
| 5561 | Find Greatest Common Divisor of 13 and 52, using repeated division. | 1 |
| 5562 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization. | 1 |
| 5563 | Find Greatest Common Divisor of 1256 and 140, using Euclidean algorithm. | 1 |
| 5564 | Find Greatest Common Divisor of 32, 8 and 56, using prime factorization. | 1 |
| 5565 | Find Greatest Common Divisor of 32, 8 and 56, using Euclidean algorithm. | 1 |
| 5566 | Find Greatest Common Divisor of 32, 8 and 56, using repeated division. | 1 |
| 5567 | Find Greatest Common Divisor of 15, 28 and 50, using prime factorization. | 1 |
| 5568 | Find Greatest Common Divisor of 5 and 63, using prime factorization. | 1 |
| 5569 | Find Greatest Common Divisor of 54 and 24, using Euclidean algorithm. | 1 |
| 5570 | Find Greatest Common Divisor of 177 and 137688, using prime factorization. | 1 |
| 5571 | Find Greatest Common Divisor of 177 and 137688, using repeated division. | 1 |
| 5572 | Find Greatest Common Divisor of 60 and 667, using prime factorization. | 1 |
| 5573 | Find Greatest Common Divisor of 35 and 15, using Euclidean algorithm. | 1 |
| 5574 | Find Greatest Common Divisor of 77 and 23, using Euclidean algorithm. | 1 |
| 5575 | Find Greatest Common Divisor of 210 and 84, using Euclidean algorithm. | 1 |
| 5576 | Find Greatest Common Divisor of 1421 and 1519, using prime factorization. | 1 |
| 5577 | Find Greatest Common Divisor of 54 and 32, using prime factorization. | 1 |
| 5578 | Find Greatest Common Divisor of 82. | 1 |
| 5579 | Find Greatest Common Divisor of 620 and 140, using prime factorization. | 1 |
| 5580 | Find Greatest Common Divisor of 50 and 32, using prime factorization. | 1 |
| 5581 | Find Greatest Common Divisor of 1529 and 14038, using prime factorization. | 1 |
| 5582 | Find Greatest Common Divisor of 1529 and 14039, using prime factorization. | 1 |
| 5583 | Find Greatest Common Divisor of 123 and 277, using prime factorization. | 1 |
| 5584 | Find Greatest Common Divisor of 358 and 309, using prime factorization. | 1 |
| 5585 | Find Greatest Common Divisor of 358 and 308, using repeated division. | 1 |
| 5586 | Find Greatest Common Divisor of 2020 and 456, using Euclidean algorithm. | 1 |
| 5587 | Find Greatest Common Divisor of 2020 and 458, using Euclidean algorithm. | 1 |
| 5588 | Find Greatest Common Divisor of 378 and 256, using prime factorization. | 1 |
| 5589 | Find Greatest Common Divisor of 4601 and 2021, using prime factorization. | 1 |
| 5590 | Find Greatest Common Divisor of 4601 and 2021, using Euclidean algorithm. | 1 |
| 5591 | Find Greatest Common Divisor of 371 and 127, using Euclidean algorithm. | 1 |
| 5592 | Find Greatest Common Divisor of 373 and 127, using Euclidean algorithm. | 1 |
| 5593 | Find Greatest Common Divisor of 232804 and 208754, using Euclidean algorithm. | 1 |
| 5594 | Find Greatest Common Divisor of 232804, 208754 and 575498, using prime factorization. | 1 |
| 5595 | Find Greatest Common Divisor of 4200, 5400 and 6660, using prime factorization. | 1 |
| 5596 | Find Greatest Common Divisor of 542832, 184756 and 360864, using prime factorization. | 1 |
| 5597 | Find Greatest Common Divisor of 90008, 320000 and 420768, using prime factorization. | 1 |
| 5598 | Find Greatest Common Divisor of 35 and 55, using prime factorization. | 1 |
| 5599 | Find Greatest Common Divisor of 5436 and 675, using repeated division. | 1 |
| 5600 | Find Greatest Common Divisor of 199 and 23, using Euclidean algorithm. | 1 |
