GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6601 | Find Greatest Common Divisor of 34496 and 1936, using prime factorization. | 1 |
| 6602 | Find Greatest Common Divisor of 999 and 998, using Euclidean algorithm. | 1 |
| 6603 | Find Greatest Common Divisor of 12075 and 4655, using repeated division. | 1 |
| 6604 | Find Greatest Common Divisor of 43336 and 332, using repeated division. | 1 |
| 6605 | Find Greatest Common Divisor of 14 and 17, using prime factorization. | 1 |
| 6606 | Find Greatest Common Divisor of 297 and 100, using Euclidean algorithm. | 1 |
| 6607 | Find Greatest Common Divisor of 735 and 225, using Euclidean algorithm. | 1 |
| 6608 | Find Greatest Common Divisor of 49 and 15, using prime factorization. | 1 |
| 6609 | Find Greatest Common Divisor of 42432 and 42334, using Euclidean algorithm. | 1 |
| 6610 | Find Greatest Common Divisor of 349 and 1758, using prime factorization. | 1 |
| 6611 | Find Greatest Common Divisor of 2587 and 4345, using prime factorization. | 1 |
| 6612 | Find Greatest Common Divisor of 756 and 2587, using prime factorization. | 1 |
| 6613 | Find Greatest Common Divisor of 13. | 1 |
| 6614 | Find Greatest Common Divisor of 234 and 156, using repeated division. | 1 |
| 6615 | Find Greatest Common Divisor of 960 and 9000, using prime factorization. | 1 |
| 6616 | Find Greatest Common Divisor of 72 and 333, using Euclidean algorithm. | 1 |
| 6617 | Find Greatest Common Divisor of 102 and 785, using Euclidean algorithm. | 1 |
| 6618 | Find Greatest Common Divisor of 96, 2, 11, 29, 39 and 49, using Euclidean algorithm. | 1 |
| 6619 | Find Greatest Common Divisor of 43 and 57, using Euclidean algorithm. | 1 |
| 6620 | Find Greatest Common Divisor of 7, 4 and 6, using prime factorization. | 1 |
| 6621 | Find Greatest Common Divisor of 480 and 512, using prime factorization. | 1 |
| 6622 | Find Greatest Common Divisor of 7 and 2, using prime factorization. | 1 |
| 6623 | Find Greatest Common Divisor of 40375 and 240000, using prime factorization. | 1 |
| 6624 | Find Greatest Common Divisor of 71250 and 240000, using prime factorization. | 1 |
| 6625 | Find Greatest Common Divisor of 111555 and 555111, using prime factorization. | 1 |
| 6626 | Find Greatest Common Divisor of 7 and 3, using prime factorization. | 1 |
| 6627 | Find Greatest Common Divisor of 12 and 697, using Euclidean algorithm. | 1 |
| 6628 | Find Greatest Common Divisor of 287 and 2009, using prime factorization. | 1 |
| 6629 | Find Greatest Common Divisor of 889 and 2009, using prime factorization. | 1 |
| 6630 | Find Greatest Common Divisor of 899 and 2009, using prime factorization. | 1 |
| 6631 | Find Greatest Common Divisor of 7469 and 2464, using repeated division. | 1 |
| 6632 | Find Greatest Common Divisor of 7469 and 2464, by listing out the factors. | 1 |
| 6633 | Find Greatest Common Divisor of 3234, 2541 and 6006, using prime factorization. | 1 |
| 6634 | Find Greatest Common Divisor of 9, 6 and 15, using prime factorization. | 1 |
| 6635 | Find Greatest Common Divisor of 24, 30 and 10, using repeated division. | 1 |
| 6636 | Find Greatest Common Divisor of 46802 and 22500, using prime factorization. | 1 |
| 6637 | Find Greatest Common Divisor of 2579 and 2424, by listing out the factors. | 1 |
| 6638 | Find Greatest Common Divisor of 4 and 10, using prime factorization. | 1 |
| 6639 | Find Greatest Common Divisor of 99824435698771045 and 998244359987710471, using Euclidean algorithm. | 1 |
| 6640 | Find Greatest Common Divisor of 89 and 37, using prime factorization. | 1 |
| 6641 | Find Greatest Common Divisor of 350 and 230, using prime factorization. | 1 |
| 6642 | Find Greatest Common Divisor of 198, 19 and 4, using prime factorization. | 1 |
| 6643 | Find Greatest Common Divisor of 48, 72 and 96, using prime factorization. | 1 |
| 6644 | Find Greatest Common Divisor of 2358 and 2025, using prime factorization. | 1 |
| 6645 | Find Greatest Common Divisor of 627 and 1611, using Euclidean algorithm. | 1 |
| 6646 | Find Greatest Common Divisor of 135 and 25, using repeated division. | 1 |
| 6647 | Find Greatest Common Divisor of 135 and 25, using Euclidean algorithm. | 1 |
| 6648 | Find Greatest Common Divisor of 1001 and 3101, using prime factorization. | 1 |
| 6649 | Find Greatest Common Divisor of 35 and 6, using prime factorization. | 1 |
| 6650 | Find Greatest Common Divisor of 171, 399 and 741, using prime factorization. | 1 |
