GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3551 | Find Greatest Common Divisor of 11 and 3, using Euclidean algorithm. | 2 |
| 3552 | Find Greatest Common Divisor of 1100 and 57330, using Euclidean algorithm. | 2 |
| 3553 | Find Greatest Common Divisor of 4113. | 2 |
| 3554 | Find Greatest Common Divisor of 117 and 4113, using prime factorization. | 2 |
| 3555 | Find Greatest Common Divisor of 457 and 13, using prime factorization. | 2 |
| 3556 | Find Greatest Common Divisor of 457 and 3250, using prime factorization. | 2 |
| 3557 | Find Greatest Common Divisor of 8, 12 and 30, using prime factorization. | 2 |
| 3558 | Find Greatest Common Divisor of 18, 16, 54 and 36, using prime factorization. | 2 |
| 3559 | Find Greatest Common Divisor of 14, 27 and 55, using prime factorization. | 2 |
| 3560 | Find Greatest Common Divisor of 20 and 9, using repeated division. | 2 |
| 3561 | Find Greatest Common Divisor of 260 and 628, using prime factorization. | 2 |
| 3562 | Find Greatest Common Divisor of 27 and 8, using prime factorization. | 2 |
| 3563 | Find Greatest Common Divisor of 406 and 945, using prime factorization. | 2 |
| 3564 | Find Greatest Common Divisor of 405 and 945, using prime factorization. | 2 |
| 3565 | Find Greatest Common Divisor of 132 and 630, using Euclidean algorithm. | 2 |
| 3566 | Find Greatest Common Divisor of 66 and 150, using repeated division. | 2 |
| 3567 | Find Greatest Common Divisor of 170 and 122, using repeated division. | 2 |
| 3568 | Find Greatest Common Divisor of 170 and 122, by listing out the factors. | 2 |
| 3569 | Find Greatest Common Divisor of 792 and 275, using prime factorization. | 2 |
| 3570 | Find Greatest Common Divisor of 39 and 2535, using prime factorization. | 2 |
| 3571 | Find Greatest Common Divisor of 54 and 888, using Euclidean algorithm. | 2 |
| 3572 | Find Greatest Common Divisor of 25 and 29, using prime factorization. | 2 |
| 3573 | Find Greatest Common Divisor of 5245 and 930, using prime factorization. | 2 |
| 3574 | Find Greatest Common Divisor of 4076 and 2076, using prime factorization. | 2 |
| 3575 | Find Greatest Common Divisor of 457 and 378, using prime factorization. | 2 |
| 3576 | Find Greatest Common Divisor of 780 and 224, using repeated division. | 2 |
| 3577 | Find Greatest Common Divisor of 25, 30 and 40, using Euclidean algorithm. | 2 |
| 3578 | Find Greatest Common Divisor of 26513 and 32321, using Euclidean algorithm. | 2 |
| 3579 | Find Greatest Common Divisor of 415 and 142, using Euclidean algorithm. | 2 |
| 3580 | Find Greatest Common Divisor of 471 and 562, using Euclidean algorithm. | 2 |
| 3581 | Find Greatest Common Divisor of 295 and 504, using Euclidean algorithm. | 2 |
| 3582 | Find Greatest Common Divisor of 387 and 129, using Euclidean algorithm. | 2 |
| 3583 | Find Greatest Common Divisor of 359 and 125, using prime factorization. | 2 |
| 3584 | Find Greatest Common Divisor of 1320 and 1065, using prime factorization. | 2 |
| 3585 | Find Greatest Common Divisor of 24 and 15, using Euclidean algorithm. | 2 |
| 3586 | Find Greatest Common Divisor of 17 and 11, using prime factorization. | 2 |
| 3587 | Find Greatest Common Divisor of 147 and 288, using prime factorization. | 2 |
| 3588 | Find Greatest Common Divisor of 147 and 288, using repeated division. | 2 |
| 3589 | Find Greatest Common Divisor of 689 and 489, using prime factorization. | 2 |
| 3590 | Find Greatest Common Divisor of 249 and 147, using prime factorization. | 2 |
| 3591 | Find Greatest Common Divisor of 39 and 162, using prime factorization. | 2 |
| 3592 | Find Greatest Common Divisor of 39 and 162, using Euclidean algorithm. | 2 |
| 3593 | Find Greatest Common Divisor of 6120 and 3000, using Euclidean algorithm. | 2 |
| 3594 | Find Greatest Common Divisor of 725 and 236, using Euclidean algorithm. | 2 |
| 3595 | Find Greatest Common Divisor of 3578 and 9512, using repeated division. | 2 |
| 3596 | Find Greatest Common Divisor of 366 and 36, using prime factorization. | 2 |
| 3597 | Find Greatest Common Divisor of 366 and 36, using Euclidean algorithm. | 2 |
| 3598 | Find Greatest Common Divisor of 100 and 321, using prime factorization. | 2 |
| 3599 | Find Greatest Common Divisor of 27 and 100, using prime factorization. | 2 |
| 3600 | Find Greatest Common Divisor of 1007 and 97000000, using prime factorization. | 2 |