GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5501 | Find Greatest Common Divisor of 4 and 7, using Euclidean algorithm. | 1 |
| 5502 | Find Greatest Common Divisor of 88 and 91, by listing out the factors. | 1 |
| 5503 | Find Greatest Common Divisor of 126 and 147, using prime factorization. | 1 |
| 5504 | Find Greatest Common Divisor of 2312 and 19520, using Euclidean algorithm. | 1 |
| 5505 | Find Greatest Common Divisor of 59516. | 1 |
| 5506 | Find Greatest Common Divisor of 729 and 19, using prime factorization. | 1 |
| 5507 | Find Greatest Common Divisor of 760 and 5, using Euclidean algorithm. | 1 |
| 5508 | Find Greatest Common Divisor of 760 and 50, using Euclidean algorithm. | 1 |
| 5509 | Find Greatest Common Divisor of 234 and 19, using Euclidean algorithm. | 1 |
| 5510 | Find Greatest Common Divisor of 36, 72, 144 and 164, by listing out the factors. | 1 |
| 5511 | Find Greatest Common Divisor of 6, 9, 12, 15 and 18, by listing out the factors. | 1 |
| 5512 | Find Greatest Common Divisor of 22 and 45, using Euclidean algorithm. | 1 |
| 5513 | Find Greatest Common Divisor of 22 and 46, using repeated division. | 1 |
| 5514 | Find Greatest Common Divisor of 65535 and 899, using prime factorization. | 1 |
| 5515 | Find Greatest Common Divisor of 63 and 899, using prime factorization. | 1 |
| 5516 | Find Greatest Common Divisor of 65 and 899, using prime factorization. | 1 |
| 5517 | Find Greatest Common Divisor of 9, 7, 1 and 7, using Euclidean algorithm. | 1 |
| 5518 | Find Greatest Common Divisor of 53 and 33, using Euclidean algorithm. | 1 |
| 5519 | Find Greatest Common Divisor of 12, 14 and 20, by listing out the factors. | 1 |
| 5520 | Find Greatest Common Divisor of 2560 and 1440, using prime factorization. | 1 |
| 5521 | Find Greatest Common Divisor of 52 and 12, using Euclidean algorithm. | 1 |
| 5522 | Find Greatest Common Divisor of 34 and 58, using Euclidean algorithm. | 1 |
| 5523 | Find Greatest Common Divisor of 15, 50 and 46, using repeated division. | 1 |
| 5524 | Find Greatest Common Divisor of 507885 and 60808, using Euclidean algorithm. | 1 |
| 5525 | Find Greatest Common Divisor of 36 and 233, using prime factorization. | 1 |
| 5526 | Find Greatest Common Divisor of 1 and 20, using Euclidean algorithm. | 1 |
| 5527 | Find Greatest Common Divisor of 3 and 20, using Euclidean algorithm. | 1 |
| 5528 | Find Greatest Common Divisor of 264 and 7, using prime factorization. | 1 |
| 5529 | Find Greatest Common Divisor of 5 and 264, using prime factorization. | 1 |
| 5530 | Find Greatest Common Divisor of 5301 and 456, using Euclidean algorithm. | 1 |
| 5531 | Find Greatest Common Divisor of 3552 and 2208, using prime factorization. | 1 |
| 5532 | Find Greatest Common Divisor of 160 and 19, using prime factorization. | 1 |
| 5533 | Find Greatest Common Divisor of 8 and 3, using Euclidean algorithm. | 1 |
| 5534 | Find Greatest Common Divisor of 987 and 3443, using Euclidean algorithm. | 1 |
| 5535 | Find Greatest Common Divisor of 987 and 343, using Euclidean algorithm. | 1 |
| 5536 | Find Greatest Common Divisor of 48 and 30, using prime factorization. | 1 |
| 5537 | Find Greatest Common Divisor of 462 and 357, using Euclidean algorithm. | 1 |
| 5538 | Find Greatest Common Divisor of 6 and 70, using prime factorization. | 1 |
| 5539 | Find Greatest Common Divisor of 6 and 400, using prime factorization. | 1 |
| 5540 | Find Greatest Common Divisor of 92610000 and 1372000, using prime factorization. | 1 |
| 5541 | Find Greatest Common Divisor of 345 and 587, using Euclidean algorithm. | 1 |
| 5542 | Find Greatest Common Divisor of 70, 90 and 6, using prime factorization. | 1 |
| 5543 | Find Greatest Common Divisor of 28, 36 and 15, using prime factorization. | 1 |
| 5544 | Find Greatest Common Divisor of 1792 and 217, using Euclidean algorithm. | 1 |
| 5545 | Find Greatest Common Divisor of 13 and 131302, using Euclidean algorithm. | 1 |
| 5546 | Find Greatest Common Divisor of 5742 and 5, using Euclidean algorithm. | 1 |
| 5547 | Find Greatest Common Divisor of 623. | 1 |
| 5548 | Find Greatest Common Divisor of 612 and 129, using prime factorization. | 1 |
| 5549 | Find Greatest Common Divisor of 19 and 160, using repeated division. | 1 |
| 5550 | Find Greatest Common Divisor of 73 and 24, using prime factorization. | 1 |
