GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3501 | Find Greatest Common Divisor of 5 and 92, using prime factorization. | 2 |
| 3502 | Find Greatest Common Divisor of 160485, 2, 127104 and 14, using prime factorization. | 2 |
| 3503 | Find Greatest Common Divisor of 63018702 and 11388300, using Euclidean algorithm. | 2 |
| 3504 | Find Greatest Common Divisor of 42 and 77, using Euclidean algorithm. | 2 |
| 3505 | Find Greatest Common Divisor of 44 and 36, using Euclidean algorithm. | 2 |
| 3506 | Find Greatest Common Divisor of 40 and 125, using prime factorization. | 2 |
| 3507 | Find Greatest Common Divisor of 34 and 14, using prime factorization. | 2 |
| 3508 | Find Greatest Common Divisor of 162 and 108, using prime factorization. | 2 |
| 3509 | Find Greatest Common Divisor of 24 and 20, using Euclidean algorithm. | 2 |
| 3510 | Find Greatest Common Divisor of 72 and 21, using prime factorization. | 2 |
| 3511 | Find Greatest Common Divisor of 72 and 252, using prime factorization. | 2 |
| 3512 | Find Greatest Common Divisor of 911 and 172, using prime factorization. | 2 |
| 3513 | Find Greatest Common Divisor of 604 and 138, using prime factorization. | 2 |
| 3514 | Find Greatest Common Divisor of 27 and 5, using prime factorization. | 2 |
| 3515 | Find Greatest Common Divisor of 205800 and 6468, using prime factorization. | 2 |
| 3516 | Find Greatest Common Divisor of 12345. | 2 |
| 3517 | Find Greatest Common Divisor of 132 and 250, using prime factorization. | 2 |
| 3518 | Find Greatest Common Divisor of 56 and 999, using Euclidean algorithm. | 2 |
| 3519 | Find Greatest Common Divisor of 10 and 45, using prime factorization. | 2 |
| 3520 | Find Greatest Common Divisor of 85 and 7225, using Euclidean algorithm. | 2 |
| 3521 | Find Greatest Common Divisor of 81, 2, 8, 9 and 1, using prime factorization. | 2 |
| 3522 | Find Greatest Common Divisor of 670 and 5000, using prime factorization. | 2 |
| 3523 | Find Greatest Common Divisor of 98 and 1200, using prime factorization. | 2 |
| 3524 | Find Greatest Common Divisor of 98 and 1120, using prime factorization. | 2 |
| 3525 | Find Greatest Common Divisor of 60, 4 and 8, by listing out the factors. | 2 |
| 3526 | Find Greatest Common Divisor of 30 and 40, by listing out the factors. | 2 |
| 3527 | Find Greatest Common Divisor of 8 and 10, by listing out the factors. | 2 |
| 3528 | Find Greatest Common Divisor of 8 and 10, using repeated division. | 2 |
| 3529 | Find Greatest Common Divisor of 18 and 45, using prime factorization. | 2 |
| 3530 | Find Greatest Common Divisor of 124 and 360, using Euclidean algorithm. | 2 |
| 3531 | Find Greatest Common Divisor of 108 and 144, using Euclidean algorithm. | 2 |
| 3532 | Find Greatest Common Divisor of 2349 and 1537, using Euclidean algorithm. | 2 |
| 3533 | Find Greatest Common Divisor of 12 and 53, using repeated division. | 2 |
| 3534 | Find Greatest Common Divisor of 12 and 53, using Euclidean algorithm. | 2 |
| 3535 | Find Greatest Common Divisor of 6, 89, 8 and 1, using prime factorization. | 2 |
| 3536 | Find Greatest Common Divisor of 7469 and 2463, using prime factorization. | 2 |
| 3537 | Find Greatest Common Divisor of 1147 and 899, using Euclidean algorithm. | 2 |
| 3538 | Find Greatest Common Divisor of 1147 and 889, using Euclidean algorithm. | 2 |
| 3539 | Find Greatest Common Divisor of 84 and 378, using prime factorization. | 2 |
| 3540 | Find Greatest Common Divisor of 216 and 324, using prime factorization. | 2 |
| 3541 | Find Greatest Common Divisor of 662 and 414, using prime factorization. | 2 |
| 3542 | Find Greatest Common Divisor of 384 and 2750, using prime factorization. | 2 |
| 3543 | Find Greatest Common Divisor of 243. | 2 |
| 3544 | Find Greatest Common Divisor of 220 and 8900, using prime factorization. | 2 |
| 3545 | Find Greatest Common Divisor of 1, 9, 1 and 3, using prime factorization. | 2 |
| 3546 | Find Greatest Common Divisor of 1, 8, 1 and 2, using prime factorization. | 2 |
| 3547 | Find Greatest Common Divisor of 36, 81 and 2, using prime factorization. | 2 |
| 3548 | Find Greatest Common Divisor of 4801 and 500, using Euclidean algorithm. | 2 |
| 3549 | Find Greatest Common Divisor of 3120. | 2 |
| 3550 | Find Greatest Common Divisor of 130 and 115, by listing out the factors. | 2 |