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 12 and 270, using Euclidean algorithm. | 4 |
| 552 | Find Greatest Common Divisor of 2025. | 4 |
| 553 | Find Greatest Common Divisor of 39 and 12, using prime factorization. | 4 |
| 554 | Find Greatest Common Divisor of 6699 and 8265, using prime factorization. | 4 |
| 555 | Find Greatest Common Divisor of 30 and 45, using prime factorization. | 4 |
| 556 | Find Greatest Common Divisor of 12. | 4 |
| 557 | Find Greatest Common Divisor of 2600 and 5500, using prime factorization. | 4 |
| 558 | Find Greatest Common Divisor of 42 and 36, using prime factorization. | 4 |
| 559 | Find Greatest Common Divisor of 1092 and 2295, using Euclidean algorithm. | 4 |
| 560 | Find Greatest Common Divisor of 4999 and 1109, using prime factorization. | 4 |
| 561 | Find Greatest Common Divisor of 220 and 1323, using prime factorization. | 4 |
| 562 | Find Greatest Common Divisor of 72, 120 and 144, using repeated division. | 4 |
| 563 | Find Greatest Common Divisor of 40 and 25, using Euclidean algorithm. | 4 |
| 564 | Find Greatest Common Divisor of 8 and 65, using prime factorization. | 4 |
| 565 | Find Greatest Common Divisor of 30 and 36, using prime factorization. | 4 |
| 566 | Find Greatest Common Divisor of 45 and 18, using prime factorization. | 4 |
| 567 | Find Greatest Common Divisor of 45 and 10, using repeated division. | 4 |
| 568 | Find Greatest Common Divisor of 6773760 and 12902400, using prime factorization. | 4 |
| 569 | Find Greatest Common Divisor of 45 and 24, using prime factorization. | 4 |
| 570 | Find Greatest Common Divisor of 62 and 8, using prime factorization. | 4 |
| 571 | Find Greatest Common Divisor of 513, 1134 and 1215, using Euclidean algorithm. | 4 |
| 572 | Find Greatest Common Divisor of 72, 108 and 2100, using Euclidean algorithm. | 4 |
| 573 | Find Greatest Common Divisor of 26 and 4, using prime factorization. | 4 |
| 574 | Find Greatest Common Divisor of 594 and 16, using prime factorization. | 4 |
| 575 | Find Greatest Common Divisor of 27 and 108, using prime factorization. | 4 |
| 576 | Find Greatest Common Divisor of 700 and 179, using prime factorization. | 4 |
| 577 | Find Greatest Common Divisor of 700 and 179, using Euclidean algorithm. | 4 |
| 578 | Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, by listing out the factors. | 4 |
| 579 | Find Greatest Common Divisor of 64 and 124, using prime factorization. | 4 |
| 580 | Find Greatest Common Divisor of 93149832 and 73482, using Euclidean algorithm. | 4 |
| 581 | Find Greatest Common Divisor of 15 and 9, using prime factorization. | 4 |
| 582 | Find Greatest Common Divisor of 504 and 1100, using Euclidean algorithm. | 4 |
| 583 | Find Greatest Common Divisor of 32 and 20, using prime factorization. | 4 |
| 584 | Find Greatest Common Divisor of 40 and 60, using Euclidean algorithm. | 4 |
| 585 | Find Greatest Common Divisor of 12 and 70, using prime factorization. | 4 |
| 586 | Find Greatest Common Divisor of 12 and 70, using Euclidean algorithm. | 4 |
| 587 | Find Greatest Common Divisor of 12 and 70, using repeated division. | 4 |
| 588 | Find Greatest Common Divisor of 84 and 75, using prime factorization. | 4 |
| 589 | Find Greatest Common Divisor of 234 and 156, using prime factorization. | 4 |
| 590 | Find Greatest Common Divisor of 234 and 156, using Euclidean algorithm. | 4 |
| 591 | Find Greatest Common Divisor of 26 and 16, using prime factorization. | 4 |
| 592 | Find Greatest Common Divisor of 586 and 682, using repeated division. | 4 |
| 593 | Find Greatest Common Divisor of 511. | 4 |
| 594 | Find Greatest Common Divisor of 2002 and 462, using Euclidean algorithm. | 4 |
| 595 | Find Greatest Common Divisor of 18, 60 and 75, using prime factorization. | 3 |
| 596 | Find Greatest Common Divisor of 252 and 105, using Euclidean algorithm. | 3 |
| 597 | Find Greatest Common Divisor of 790 and 380, using prime factorization. | 3 |
| 598 | Find Greatest Common Divisor of 576, 1152, 1280, 136 and 200, using prime factorization. | 3 |
| 599 | Find Greatest Common Divisor of 48 and 64, using prime factorization. | 3 |
| 600 | Find Greatest Common Divisor of 2486625522 and 41582215163, using repeated division. | 3 |
