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 234 and 531, using repeated division. | 1 |
| 4552 | Find Greatest Common Divisor of 234 and 531, by listing out the factors. | 1 |
| 4553 | Find Greatest Common Divisor of 23 and 531, using Euclidean algorithm. | 1 |
| 4554 | Find Greatest Common Divisor of 50 and 74, using Euclidean algorithm. | 1 |
| 4555 | Find Greatest Common Divisor of 92 and 111, using Euclidean algorithm. | 1 |
| 4556 | Find Greatest Common Divisor of 20 and 4, using Euclidean algorithm. | 1 |
| 4557 | Find Greatest Common Divisor of 20 and 5, using Euclidean algorithm. | 1 |
| 4558 | Find Greatest Common Divisor of 3125 and 21, using Euclidean algorithm. | 1 |
| 4559 | Find Greatest Common Divisor of 640 and 49, using Euclidean algorithm. | 1 |
| 4560 | Find Greatest Common Divisor of 22086 and 9990, using repeated division. | 1 |
| 4561 | Find Greatest Common Divisor of 22086 and 9990, using Euclidean algorithm. | 1 |
| 4562 | Find Greatest Common Divisor of 90581 and 17993, using prime factorization. | 1 |
| 4563 | Find Greatest Common Divisor of 1552303 and 233927, using Euclidean algorithm. | 1 |
| 4564 | Find Greatest Common Divisor of 168 and 9723, using Euclidean algorithm. | 1 |
| 4565 | Find Greatest Common Divisor of 26 and 37, using Euclidean algorithm. | 1 |
| 4566 | Find Greatest Common Divisor of 84 and 385, using Euclidean algorithm. | 1 |
| 4567 | Find Greatest Common Divisor of 342 and 344, using Euclidean algorithm. | 1 |
| 4568 | Find Greatest Common Divisor of 256 and 81, using prime factorization. | 1 |
| 4569 | Find Greatest Common Divisor of 540 and 720, using prime factorization. | 1 |
| 4570 | Find Greatest Common Divisor of 1900 and 172, using prime factorization. | 1 |
| 4571 | Find Greatest Common Divisor of 970 and 899, using prime factorization. | 1 |
| 4572 | Find Greatest Common Divisor of 970 and 890, using prime factorization. | 1 |
| 4573 | Find Greatest Common Divisor of 2798 and 36812, using prime factorization. | 1 |
| 4574 | Find Greatest Common Divisor of 145 and 355, using prime factorization. | 1 |
| 4575 | Find Greatest Common Divisor of 118 and 936, using prime factorization. | 1 |
| 4576 | Find Greatest Common Divisor of 118 and 918, using prime factorization. | 1 |
| 4577 | Find Greatest Common Divisor of 120 and 918, using prime factorization. | 1 |
| 4578 | Find Greatest Common Divisor of 14, 18 and 12, using prime factorization. | 1 |
| 4579 | Find Greatest Common Divisor of 999 and 19, using prime factorization. | 1 |
| 4580 | Find Greatest Common Divisor of 81, 36 and 48, using prime factorization. | 1 |
| 4581 | Find Greatest Common Divisor of 70, 190 and 350, using prime factorization. | 1 |
| 4582 | Find Greatest Common Divisor of 70, 600 and 350, using prime factorization. | 1 |
| 4583 | Find Greatest Common Divisor of 243, 729 and 270, using prime factorization. | 1 |
| 4584 | Find Greatest Common Divisor of 364 and 765, using prime factorization. | 1 |
| 4585 | Find Greatest Common Divisor of 6 and 35, using Euclidean algorithm. | 1 |
| 4586 | Find Greatest Common Divisor of 3572 and 838, using prime factorization. | 1 |
| 4587 | Find Greatest Common Divisor of 3572 and 838, using Euclidean algorithm. | 1 |
| 4588 | Find Greatest Common Divisor of 3543 and 92, using Euclidean algorithm. | 1 |
| 4589 | Find Greatest Common Divisor of 282 and 2332, using prime factorization. | 1 |
| 4590 | Find Greatest Common Divisor of 1223 and 195, using Euclidean algorithm. | 1 |
| 4591 | Find Greatest Common Divisor of 3401 and 542, using Euclidean algorithm. | 1 |
| 4592 | Find Greatest Common Divisor of 3572 and 211, using Euclidean algorithm. | 1 |
| 4593 | Find Greatest Common Divisor of 2871 and 169, using Euclidean algorithm. | 1 |
| 4594 | Find Greatest Common Divisor of 143 and 35, using Euclidean algorithm. | 1 |
| 4595 | Find Greatest Common Divisor of 385 and 35, using Euclidean algorithm. | 1 |
| 4596 | Find Greatest Common Divisor of 336 and 1120, using prime factorization. | 1 |
| 4597 | Find Greatest Common Divisor of 216 and 111, using Euclidean algorithm. | 1 |
| 4598 | Find Greatest Common Divisor of 5168 and 663, using Euclidean algorithm. | 1 |
| 4599 | Find Greatest Common Divisor of 7 and 84, using prime factorization. | 1 |
| 4600 | Find Greatest Common Divisor of 40 and 56, using prime factorization. | 1 |
