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 0 and 43, using Euclidean algorithm. | 1 |
| 5502 | Find Greatest Common Divisor of 3 and 43, using prime factorization. | 1 |
| 5503 | Find Greatest Common Divisor of 25, 42 and 81, using prime factorization. | 1 |
| 5504 | Find Greatest Common Divisor of 45 and 26, using Euclidean algorithm. | 1 |
| 5505 | Find Greatest Common Divisor of 6232 and 1178, using prime factorization. | 1 |
| 5506 | Find Greatest Common Divisor of 9 and 7, using prime factorization. | 1 |
| 5507 | Find Greatest Common Divisor of 21 and 77, using prime factorization. | 1 |
| 5508 | Find Greatest Common Divisor of 21 and 77, using Euclidean algorithm. | 1 |
| 5509 | Find Greatest Common Divisor of 30 and 107, by listing out the factors. | 1 |
| 5510 | Find Greatest Common Divisor of 1000 and 998, using prime factorization. | 1 |
| 5511 | Find Greatest Common Divisor of 1530099 and 171259, using Euclidean algorithm. | 1 |
| 5512 | Find Greatest Common Divisor of 3 and 448, using prime factorization. | 1 |
| 5513 | Find Greatest Common Divisor of 55 and 196, using repeated division. | 1 |
| 5514 | Find Greatest Common Divisor of 78, 117 and 351, using prime factorization. | 1 |
| 5515 | Find Greatest Common Divisor of 196 and 55, using Euclidean algorithm. | 1 |
| 5516 | Find Greatest Common Divisor of 2021 and 1895, using Euclidean algorithm. | 1 |
| 5517 | Find Greatest Common Divisor of 7684 and 4148, using prime factorization. | 1 |
| 5518 | Find Greatest Common Divisor of 7684 and 4148, using Euclidean algorithm. | 1 |
| 5519 | Find Greatest Common Divisor of 4711 and 1024, using Euclidean algorithm. | 1 |
| 5520 | Find Greatest Common Divisor of 2622 and 1104, using prime factorization. | 1 |
| 5521 | Find Greatest Common Divisor of 432 and 546, using prime factorization. | 1 |
| 5522 | Find Greatest Common Divisor of 505 and 189, using prime factorization. | 1 |
| 5523 | Find Greatest Common Divisor of 1000 and 539, using prime factorization. | 1 |
| 5524 | Find Greatest Common Divisor of 5317 and 899, using prime factorization. | 1 |
| 5525 | Find Greatest Common Divisor of 8 and 693, using Euclidean algorithm. | 1 |
| 5526 | Find Greatest Common Divisor of 324 and 528, using Euclidean algorithm. | 1 |
| 5527 | Find Greatest Common Divisor of 81083 and 7, using Euclidean algorithm. | 1 |
| 5528 | Find Greatest Common Divisor of 81083 and 17, using Euclidean algorithm. | 1 |
| 5529 | Find Greatest Common Divisor of 41 and 41, using Euclidean algorithm. | 1 |
| 5530 | Find Greatest Common Divisor of 17, 34 and 56, using prime factorization. | 1 |
| 5531 | Find Greatest Common Divisor of 56 and 60, by listing out the factors. | 1 |
| 5532 | Find Greatest Common Divisor of 60 and 61, using prime factorization. | 1 |
| 5533 | Find Greatest Common Divisor of 48 and 57, using Euclidean algorithm. | 1 |
| 5534 | Find Greatest Common Divisor of 39 and 49, using Euclidean algorithm. | 1 |
| 5535 | Find Greatest Common Divisor of 39 and 49, using prime factorization. | 1 |
| 5536 | Find Greatest Common Divisor of 39 and 49, by listing out the factors. | 1 |
| 5537 | Find Greatest Common Divisor of 5 and 3, using Euclidean algorithm. | 1 |
| 5538 | Find Greatest Common Divisor of 660, 1386 and 2310, using prime factorization. | 1 |
| 5539 | Find Greatest Common Divisor of 78 and 66, using prime factorization. | 1 |
| 5540 | Find Greatest Common Divisor of 24 and 72, using prime factorization. | 1 |
| 5541 | Find Greatest Common Divisor of 0 and 72, using prime factorization. | 1 |
| 5542 | Find Greatest Common Divisor of 0 and 72, using Euclidean algorithm. | 1 |
| 5543 | Find Greatest Common Divisor of 106, 159 and 265, using prime factorization. | 1 |
| 5544 | Find Greatest Common Divisor of 2024 and 1061, using Euclidean algorithm. | 1 |
| 5545 | Find Greatest Common Divisor of 437 and 219, using Euclidean algorithm. | 1 |
| 5546 | Find Greatest Common Divisor of 437 and 219, using prime factorization. | 1 |
| 5547 | Find Greatest Common Divisor of 461 and 722, using prime factorization. | 1 |
| 5548 | Find Greatest Common Divisor of 461 and 722, using Euclidean algorithm. | 1 |
| 5549 | Find Greatest Common Divisor of 8 and 5, using repeated division. | 1 |
| 5550 | Find Greatest Common Divisor of 125 and 100, using repeated division. | 1 |
