GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1551 | Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm. | 6 |
| 1552 | Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm. | 6 |
| 1553 | Find Greatest Common Divisor of 35 and 192, using prime factorization. | 6 |
| 1554 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using prime factorization. | 6 |
| 1555 | Find Greatest Common Divisor of 272 and 1479, using Euclidean algorithm. | 6 |
| 1556 | Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm. | 6 |
| 1557 | Find Greatest Common Divisor of 1 and 6, using prime factorization. | 6 |
| 1558 | Find Greatest Common Divisor of 20 and 32, using prime factorization. | 6 |
| 1559 | Find Greatest Common Divisor of 973 and 301, using prime factorization. | 6 |
| 1560 | Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization. | 6 |
| 1561 | Find Greatest Common Divisor of 140 and 15, using prime factorization. | 6 |
| 1562 | Find Greatest Common Divisor of 3125 and 100000, using prime factorization. | 6 |
| 1563 | Find Greatest Common Divisor of 18 and 42, using repeated division. | 6 |
| 1564 | Find Greatest Common Divisor of 2569 and 1669, using prime factorization. | 6 |
| 1565 | Find Greatest Common Divisor of 20, 28 and 38, using repeated division. | 5 |
| 1566 | Find Greatest Common Divisor of 78125 and 10000000, using prime factorization. | 5 |
| 1567 | Find Greatest Common Divisor of 3670 and 1359, using prime factorization. | 5 |
| 1568 | Find Greatest Common Divisor of 6600 and 2570, using prime factorization. | 5 |
| 1569 | Find Greatest Common Divisor of 788 and 140, using prime factorization. | 5 |
| 1570 | Find Greatest Common Divisor of 380 and 266, using prime factorization. | 5 |
| 1571 | Find Greatest Common Divisor of 589, 23 and 238, using prime factorization. | 5 |
| 1572 | Find Greatest Common Divisor of 12 and 45, using repeated division. | 5 |
| 1573 | Find Greatest Common Divisor of 84 and 56, using prime factorization. | 5 |
| 1574 | Find Greatest Common Divisor of 54, 72 and 96, using repeated division. | 5 |
| 1575 | Find Greatest Common Divisor of 21 and 28, using prime factorization. | 5 |
| 1576 | Find Greatest Common Divisor of 12 and 18, by listing out the factors. | 5 |
| 1577 | Find Greatest Common Divisor of 1876 and 342, using prime factorization. | 5 |
| 1578 | Find Greatest Common Divisor of 15270 and 10270, using Euclidean algorithm. | 5 |
| 1579 | Find Greatest Common Divisor of 15310 and 10310, using Euclidean algorithm. | 5 |
| 1580 | Find Greatest Common Divisor of 15430 and 10430, using Euclidean algorithm. | 5 |
| 1581 | Find Greatest Common Divisor of 15450 and 10450, using Euclidean algorithm. | 5 |
| 1582 | Find Greatest Common Divisor of 15470 and 10470, using Euclidean algorithm. | 5 |
| 1583 | Find Greatest Common Divisor of 16250 and 11250, using Euclidean algorithm. | 5 |
| 1584 | Find Greatest Common Divisor of 16650 and 11650, using Euclidean algorithm. | 5 |
| 1585 | Find Greatest Common Divisor of 18050 and 13050, using Euclidean algorithm. | 5 |
| 1586 | Find Greatest Common Divisor of 1253 and 26, using prime factorization. | 5 |
| 1587 | Find Greatest Common Divisor of 890 and 26, using Euclidean algorithm. | 5 |
| 1588 | Find Greatest Common Divisor of 1297 and 26, using Euclidean algorithm. | 5 |
| 1589 | Find Greatest Common Divisor of 2701 and 29, using Euclidean algorithm. | 5 |
| 1590 | Find Greatest Common Divisor of 2592 and 29, using Euclidean algorithm. | 5 |
| 1591 | Find Greatest Common Divisor of 2592 and 2501, using Euclidean algorithm. | 5 |
| 1592 | Find Greatest Common Divisor of 2592 and 2567, using prime factorization. | 5 |
| 1593 | Find Greatest Common Divisor of 2592 and 2587, using Euclidean algorithm. | 5 |
| 1594 | Find Greatest Common Divisor of 2592 and 2591, using Euclidean algorithm. | 5 |
| 1595 | Find Greatest Common Divisor of 2592 and 69, using Euclidean algorithm. | 5 |
| 1596 | Find Greatest Common Divisor of 2592 and 2543, using Euclidean algorithm. | 5 |
| 1597 | Find Greatest Common Divisor of 2592 and 2569, using Euclidean algorithm. | 5 |
| 1598 | Find Greatest Common Divisor of 2406 and 654, using Euclidean algorithm. | 5 |
| 1599 | Find Greatest Common Divisor of 105, 315 and 462, using prime factorization. | 5 |
| 1600 | Find Greatest Common Divisor of 108 and 5, using prime factorization. | 5 |