GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4551 | Find Greatest Common Divisor of 43 and 59, using prime factorization. | 2 |
| 4552 | Find Greatest Common Divisor of 66 and 90, using prime factorization. | 2 |
| 4553 | Find Greatest Common Divisor of 456 and 123, using Euclidean algorithm. | 2 |
| 4554 | Find Greatest Common Divisor of 199 and 98, using Euclidean algorithm. | 2 |
| 4555 | Find Greatest Common Divisor of 172 and 246, using prime factorization. | 2 |
| 4556 | Find Greatest Common Divisor of 24 and 55, using prime factorization. | 2 |
| 4557 | Find Greatest Common Divisor of 216 and 352, using repeated division. | 2 |
| 4558 | Find Greatest Common Divisor of 98 and 74, using prime factorization. | 2 |
| 4559 | Find Greatest Common Divisor of 64, 192 and 960, using prime factorization. | 2 |
| 4560 | Find Greatest Common Divisor of 425, 255 and 4131, using prime factorization. | 2 |
| 4561 | Find Greatest Common Divisor of 14580 and 57608, using Euclidean algorithm. | 2 |
| 4562 | Find Greatest Common Divisor of 180 and 162, using Euclidean algorithm. | 2 |
| 4563 | Find Greatest Common Divisor of 180 and 164, using Euclidean algorithm. | 2 |
| 4564 | Find Greatest Common Divisor of 172 and 22, using Euclidean algorithm. | 2 |
| 4565 | Find Greatest Common Divisor of 30 and 209, using Euclidean algorithm. | 2 |
| 4566 | Find Greatest Common Divisor of 100 and 96, using Euclidean algorithm. | 2 |
| 4567 | Find Greatest Common Divisor of 627 and 168, using Euclidean algorithm. | 2 |
| 4568 | Find Greatest Common Divisor of 154 and 168, using Euclidean algorithm. | 2 |
| 4569 | Find Greatest Common Divisor of 132 and 114, using Euclidean algorithm. | 2 |
| 4570 | Find Greatest Common Divisor of 240 and 204, using Euclidean algorithm. | 2 |
| 4571 | Find Greatest Common Divisor of 593 and 891, using prime factorization. | 2 |
| 4572 | Find Greatest Common Divisor of 615 and 1080, using prime factorization. | 2 |
| 4573 | Find Greatest Common Divisor of 615 and 1080, using Euclidean algorithm. | 2 |
| 4574 | Find Greatest Common Divisor of 123456 and 654321, using Euclidean algorithm. | 2 |
| 4575 | Find Greatest Common Divisor of 1236 and 61, using prime factorization. | 2 |
| 4576 | Find Greatest Common Divisor of 1000 and 20, using prime factorization. | 2 |
| 4577 | Find Greatest Common Divisor of 1280. | 2 |
| 4578 | Find Greatest Common Divisor of 7 and 1000, using prime factorization. | 2 |
| 4579 | Find Greatest Common Divisor of 15 and 26, using prime factorization. | 2 |
| 4580 | Find Greatest Common Divisor of 16 and 26, using prime factorization. | 2 |
| 4581 | Find Greatest Common Divisor of 22 and 26, using prime factorization. | 2 |
| 4582 | Find Greatest Common Divisor of 18 and 26, using prime factorization. | 2 |
| 4583 | Find Greatest Common Divisor of 553 and 4, using prime factorization. | 2 |
| 4584 | Find Greatest Common Divisor of 2053 and 5, using repeated division. | 2 |
| 4585 | Find Greatest Common Divisor of 156 and 52, using prime factorization. | 2 |
| 4586 | Find Greatest Common Divisor of 1025 and 22, using repeated division. | 2 |
| 4587 | Find Greatest Common Divisor of 106 and 53, using Euclidean algorithm. | 2 |
| 4588 | Find Greatest Common Divisor of 12 and 66, by listing out the factors. | 2 |
| 4589 | Find Greatest Common Divisor of 235 and 45, using prime factorization. | 2 |
| 4590 | Find Greatest Common Divisor of 665 and 805, using prime factorization. | 2 |
| 4591 | Find Greatest Common Divisor of 99 and 41, using prime factorization. | 2 |
| 4592 | Find Greatest Common Divisor of 277 and 1031, using prime factorization. | 2 |
| 4593 | Find Greatest Common Divisor of 155 and 95, using prime factorization. | 2 |
| 4594 | Find Greatest Common Divisor of 49, 7 and 14, using prime factorization. | 2 |
| 4595 | Find Greatest Common Divisor of 3, 14, 3, 14, 18, 18, 8, 8, 8 and 8, using prime factorization. | 2 |
| 4596 | Find Greatest Common Divisor of 300 and 155, using Euclidean algorithm. | 2 |
| 4597 | Find Greatest Common Divisor of 41 and 71, using prime factorization. | 2 |
| 4598 | Find Greatest Common Divisor of 12 and 25, using prime factorization. | 2 |
| 4599 | Find Greatest Common Divisor of 4675 and 12055, using prime factorization. | 2 |
| 4600 | Find Greatest Common Divisor of 625 and 180, using prime factorization. | 2 |