GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 551 | Find Greatest Common Divisor of 20 and 3, using prime factorization. | 4 |
| 552 | Find Greatest Common Divisor of 5000000000. | 4 |
| 553 | Find Greatest Common Divisor of 941688 and 133980, by listing out the factors. | 4 |
| 554 | Find Greatest Common Divisor of 5. | 4 |
| 555 | Find Greatest Common Divisor of 432, 576 and 1008, by listing out the factors. | 4 |
| 556 | Find Greatest Common Divisor of 432, 576 and 1008, using prime factorization. | 4 |
| 557 | Find Greatest Common Divisor of 21, 28 and 49, using Euclidean algorithm. | 4 |
| 558 | Find Greatest Common Divisor of 21, 28 and 49, using prime factorization. | 4 |
| 559 | Find Greatest Common Divisor of 618, 1030 and 1442, using prime factorization. | 4 |
| 560 | Find Greatest Common Divisor of 258 and 518, using repeated division. | 4 |
| 561 | Find Greatest Common Divisor of 258 and 518, using prime factorization. | 4 |
| 562 | Find Greatest Common Divisor of 306 and 657, using repeated division. | 4 |
| 563 | Find Greatest Common Divisor of 2028, 1 and 2029, by listing out the factors. | 4 |
| 564 | Find Greatest Common Divisor of 17 and 3120, by listing out the factors. | 4 |
| 565 | Find Greatest Common Divisor of 48 and 36, using repeated division. | 4 |
| 566 | Find Greatest Common Divisor of 623 and 935, using prime factorization. | 4 |
| 567 | Find Greatest Common Divisor of 521, 2 and 71, using Euclidean algorithm. | 4 |
| 568 | Find Greatest Common Divisor of 6 and 10, using Euclidean algorithm. | 4 |
| 569 | Find Greatest Common Divisor of 77 and 110, using Euclidean algorithm. | 4 |
| 570 | Find Greatest Common Divisor of 63 and 77, using prime factorization. | 4 |
| 571 | Find Greatest Common Divisor of 9 and 1680, using prime factorization. | 4 |
| 572 | Find Greatest Common Divisor of 648 and 124, using Euclidean algorithm. | 4 |
| 573 | Find Greatest Common Divisor of 17 and 34, using Euclidean algorithm. | 4 |
| 574 | Find Greatest Common Divisor of 221 and 35, using Euclidean algorithm. | 4 |
| 575 | Find Greatest Common Divisor of 32 and 640, using Euclidean algorithm. | 4 |
| 576 | Find Greatest Common Divisor of 4. | 4 |
| 577 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, by listing out the factors. | 4 |
| 578 | Find Greatest Common Divisor of 216, 900, 36, 120, 144, 108, 49, 60, 150 and 25, using prime factorization. | 4 |
| 579 | Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm. | 4 |
| 580 | Find Greatest Common Divisor of 316 and 180, using Euclidean algorithm. | 4 |
| 581 | Find Greatest Common Divisor of 5 and 4, using prime factorization. | 4 |
| 582 | Find Greatest Common Divisor of 3532 and 3288, using Euclidean algorithm. | 4 |
| 583 | Find Greatest Common Divisor of 18, 24 and 12, using prime factorization. | 4 |
| 584 | Find Greatest Common Divisor of 7 and 8, using prime factorization. | 4 |
| 585 | Find Greatest Common Divisor of 504 and 385, using prime factorization. | 4 |
| 586 | Find Greatest Common Divisor of 1001 and 1331, using prime factorization. | 4 |
| 587 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using prime factorization. | 4 |
| 588 | Find Greatest Common Divisor of 11 and 20, using prime factorization. | 4 |
| 589 | Find Greatest Common Divisor of 160 and 7, using Euclidean algorithm. | 4 |
| 590 | Find Greatest Common Divisor of 3 and 8, using repeated division. | 4 |
| 591 | Find Greatest Common Divisor of 301981 and 449573, using prime factorization. | 4 |
| 592 | Find Greatest Common Divisor of 5, 70, 1 and 84, using Euclidean algorithm. | 4 |
| 593 | Find Greatest Common Divisor of 5, 70, 1 and 84, using repeated division. | 4 |
| 594 | Find Greatest Common Divisor of 12 and 12, using prime factorization. | 4 |
| 595 | Find Greatest Common Divisor of 12 and 88, using Euclidean algorithm. | 4 |
| 596 | Find Greatest Common Divisor of 15 and 88, using Euclidean algorithm. | 4 |
| 597 | Find Greatest Common Divisor of 20240605010775. | 4 |
| 598 | Find Greatest Common Divisor of 2447 and 3997, using Euclidean algorithm. | 4 |
| 599 | Find Greatest Common Divisor of 3, 5 and 7, using prime factorization. | 4 |
| 600 | Find Greatest Common Divisor of 628 and 2260, using prime factorization. | 4 |
