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 5, 35 and 40, using prime factorization. | 4 |
| 1602 | Find Greatest Common Divisor of 13, 52 and 78, using prime factorization. | 4 |
| 1603 | Find Greatest Common Divisor of 15, 16 and 18, using prime factorization. | 4 |
| 1604 | Find Greatest Common Divisor of 142 and 84, using Euclidean algorithm. | 4 |
| 1605 | Find Greatest Common Divisor of 8, 12 and 18, using repeated division. | 4 |
| 1606 | Find Greatest Common Divisor of 637 and 588, using prime factorization. | 4 |
| 1607 | Find Greatest Common Divisor of 289 and 300, using prime factorization. | 4 |
| 1608 | Find Greatest Common Divisor of 18, 25 and 8, using prime factorization. | 4 |
| 1609 | Find Greatest Common Divisor of 31426 and 100000, using prime factorization. | 4 |
| 1610 | Find Greatest Common Divisor of 2. | 4 |
| 1611 | Find Greatest Common Divisor of 180 and 225, using repeated division. | 4 |
| 1612 | Find Greatest Common Divisor of 18, 36 and 60, using prime factorization. | 4 |
| 1613 | Find Greatest Common Divisor of 1876 and 342, using Euclidean algorithm. | 4 |
| 1614 | Find Greatest Common Divisor of 1045 and 1265, using prime factorization. | 4 |
| 1615 | Find Greatest Common Divisor of 15090 and 10090, using Euclidean algorithm. | 4 |
| 1616 | Find Greatest Common Divisor of 15150 and 10150, using Euclidean algorithm. | 4 |
| 1617 | Find Greatest Common Divisor of 15170 and 10170, using Euclidean algorithm. | 4 |
| 1618 | Find Greatest Common Divisor of 15190 and 10190, using Euclidean algorithm. | 4 |
| 1619 | Find Greatest Common Divisor of 15230 and 10230, using Euclidean algorithm. | 4 |
| 1620 | Find Greatest Common Divisor of 15250 and 10250, using Euclidean algorithm. | 4 |
| 1621 | Find Greatest Common Divisor of 15350 and 10350, using Euclidean algorithm. | 4 |
| 1622 | Find Greatest Common Divisor of 15370 and 10370, using Euclidean algorithm. | 4 |
| 1623 | Find Greatest Common Divisor of 15390 and 10390, using Euclidean algorithm. | 4 |
| 1624 | Find Greatest Common Divisor of 15410 and 10410, using Euclidean algorithm. | 4 |
| 1625 | Find Greatest Common Divisor of 15490 and 10490, using Euclidean algorithm. | 4 |
| 1626 | Find Greatest Common Divisor of 15570 and 10570, using Euclidean algorithm. | 4 |
| 1627 | Find Greatest Common Divisor of 15590 and 10590, using Euclidean algorithm. | 4 |
| 1628 | Find Greatest Common Divisor of 15750 and 10750, using Euclidean algorithm. | 4 |
| 1629 | Find Greatest Common Divisor of 16050 and 11050, using Euclidean algorithm. | 4 |
| 1630 | Find Greatest Common Divisor of 16070 and 11070, using Euclidean algorithm. | 4 |
| 1631 | Find Greatest Common Divisor of 16170 and 11170, using Euclidean algorithm. | 4 |
| 1632 | Find Greatest Common Divisor of 16470 and 11470, using Euclidean algorithm. | 4 |
| 1633 | Find Greatest Common Divisor of 16490 and 11490, using Euclidean algorithm. | 4 |
| 1634 | Find Greatest Common Divisor of 16510 and 11510, using Euclidean algorithm. | 4 |
| 1635 | Find Greatest Common Divisor of 16530 and 11530, using Euclidean algorithm. | 4 |
| 1636 | Find Greatest Common Divisor of 16590 and 11590, using Euclidean algorithm. | 4 |
| 1637 | Find Greatest Common Divisor of 16610 and 11610, using Euclidean algorithm. | 4 |
| 1638 | Find Greatest Common Divisor of 16630 and 11630, using Euclidean algorithm. | 4 |
| 1639 | Find Greatest Common Divisor of 16670 and 11670, using Euclidean algorithm. | 4 |
| 1640 | Find Greatest Common Divisor of 16710 and 11710, using Euclidean algorithm. | 4 |
| 1641 | Find Greatest Common Divisor of 16750 and 11750, using Euclidean algorithm. | 4 |
| 1642 | Find Greatest Common Divisor of 17970 and 12970, using Euclidean algorithm. | 4 |
| 1643 | Find Greatest Common Divisor of 16790 and 11790, using Euclidean algorithm. | 4 |
| 1644 | Find Greatest Common Divisor of 16870 and 11870, using Euclidean algorithm. | 4 |
| 1645 | Find Greatest Common Divisor of 16950 and 11950, using Euclidean algorithm. | 4 |
| 1646 | Find Greatest Common Divisor of 16970 and 11970, using Euclidean algorithm. | 4 |
| 1647 | Find Greatest Common Divisor of 16990 and 11990, using Euclidean algorithm. | 4 |
| 1648 | Find Greatest Common Divisor of 17070 and 12070, using Euclidean algorithm. | 4 |
| 1649 | Find Greatest Common Divisor of 17090 and 12090, using Euclidean algorithm. | 4 |
| 1650 | Find Greatest Common Divisor of 17130 and 12130, using Euclidean algorithm. | 4 |
