GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1601 | Find Greatest Common Divisor of 2, 6 and 1, using prime factorization. | 8 |
| 1602 | Find Greatest Common Divisor of 100 and 6, using prime factorization. | 8 |
| 1603 | Find Greatest Common Divisor of 25 and 60, using Euclidean algorithm. | 8 |
| 1604 | Find Greatest Common Divisor of 84375 and 100000, using prime factorization. | 8 |
| 1605 | Find Greatest Common Divisor of 698 and 8, using prime factorization. | 8 |
| 1606 | Find Greatest Common Divisor of 8 and 22, using prime factorization. | 8 |
| 1607 | Find Greatest Common Divisor of 2006 and 16, using prime factorization. | 8 |
| 1608 | Find Greatest Common Divisor of 368 and 64, using prime factorization. | 8 |
| 1609 | Find Greatest Common Divisor of 64 and 100, using prime factorization. | 8 |
| 1610 | Find Greatest Common Divisor of 45 and 100, using prime factorization. | 8 |
| 1611 | Find Greatest Common Divisor of 590 and 366, using prime factorization. | 8 |
| 1612 | Find Greatest Common Divisor of 406 and 100, using prime factorization. | 8 |
| 1613 | Find Greatest Common Divisor of 228 and 8, using prime factorization. | 8 |
| 1614 | Find Greatest Common Divisor of 326 and 4, using prime factorization. | 8 |
| 1615 | Find Greatest Common Divisor of 50 and 59302, using prime factorization. | 8 |
| 1616 | Find Greatest Common Divisor of 36 and 96, using prime factorization. | 8 |
| 1617 | Find Greatest Common Divisor of 5 and 250, using prime factorization. | 8 |
| 1618 | Find Greatest Common Divisor of 18333334 and 100000000, using prime factorization. | 8 |
| 1619 | Find Greatest Common Divisor of 13 and 17, using Euclidean algorithm. | 8 |
| 1620 | Find Greatest Common Divisor of 12 and 4593, using prime factorization. | 8 |
| 1621 | Find Greatest Common Divisor of 120 and 3, using prime factorization. | 8 |
| 1622 | Find Greatest Common Divisor of 19388352 and 3363, using prime factorization. | 8 |
| 1623 | Find Greatest Common Divisor of 453069750 and 657575, using prime factorization. | 8 |
| 1624 | Find Greatest Common Divisor of 90 and 99, using prime factorization. | 8 |
| 1625 | Find Greatest Common Divisor of 4 and 100, using prime factorization. | 8 |
| 1626 | Find Greatest Common Divisor of 58 and 18, using prime factorization. | 8 |
| 1627 | Find Greatest Common Divisor of 99999900000 and 999999, using prime factorization. | 8 |
| 1628 | Find Greatest Common Divisor of 935 and 100, using prime factorization. | 8 |
| 1629 | Find Greatest Common Divisor of 28. | 8 |
| 1630 | Find Greatest Common Divisor of 14 and 26, using prime factorization. | 8 |
| 1631 | Find Greatest Common Divisor of 44838 and 4830, using Euclidean algorithm. | 8 |
| 1632 | Find Greatest Common Divisor of 102 and 351, using prime factorization. | 8 |
| 1633 | Find Greatest Common Divisor of 12 and 18, using repeated division. | 8 |
| 1634 | Find Greatest Common Divisor of 25, 30 and 40, using prime factorization. | 8 |
| 1635 | Find Greatest Common Divisor of 36 and 24, using prime factorization. | 8 |
| 1636 | Find Greatest Common Divisor of 7961. | 8 |
| 1637 | Find Greatest Common Divisor of 2 and 90, using prime factorization. | 8 |
| 1638 | Find Greatest Common Divisor of 70, 105 and 175, using prime factorization. | 8 |
| 1639 | Find Greatest Common Divisor of 1000 and 5040, using Euclidean algorithm. | 8 |
| 1640 | Find Greatest Common Divisor of 18 and 7, using Euclidean algorithm. | 8 |
| 1641 | Find Greatest Common Divisor of 466 and 267, using Euclidean algorithm. | 8 |
| 1642 | Find Greatest Common Divisor of 525. | 8 |
| 1643 | Find Greatest Common Divisor of 16261 and 85652, using Euclidean algorithm. | 8 |
| 1644 | Find Greatest Common Divisor of 160 and 7, using Euclidean algorithm. | 8 |
| 1645 | Find Greatest Common Divisor of 2. | 8 |
| 1646 | Find Greatest Common Divisor of 24140 and 16762, using Euclidean algorithm. | 7 |
| 1647 | Find Greatest Common Divisor of 98 and 273, using prime factorization. | 7 |
| 1648 | Find Greatest Common Divisor of 133 and 28, using Euclidean algorithm. | 7 |
| 1649 | Find Greatest Common Divisor of 1160718174 and 316258250, using repeated division. | 7 |
| 1650 | Find Greatest Common Divisor of 24 and 138, using Euclidean algorithm. | 7 |