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 81, 54 and 108, using prime factorization. | 4 |
| 1552 | Find Greatest Common Divisor of 1002 and 558, using Euclidean algorithm. | 4 |
| 1553 | Find Greatest Common Divisor of 2040 and 1368, using Euclidean algorithm. | 4 |
| 1554 | Find Greatest Common Divisor of 377 and 238, using prime factorization. | 4 |
| 1555 | Find Greatest Common Divisor of 12 and 270, using Euclidean algorithm. | 4 |
| 1556 | Find Greatest Common Divisor of 24. | 4 |
| 1557 | Find Greatest Common Divisor of 24 and 40, using prime factorization. | 4 |
| 1558 | Find Greatest Common Divisor of 60 and 24, using Euclidean algorithm. | 4 |
| 1559 | Find Greatest Common Divisor of 6699 and 8265, using prime factorization. | 4 |
| 1560 | Find Greatest Common Divisor of 12. | 4 |
| 1561 | Find Greatest Common Divisor of 2600 and 5500, using prime factorization. | 4 |
| 1562 | Find Greatest Common Divisor of 52 and 16, using prime factorization. | 4 |
| 1563 | Find Greatest Common Divisor of 42 and 36, using prime factorization. | 4 |
| 1564 | Find Greatest Common Divisor of 1092 and 2295, using Euclidean algorithm. | 4 |
| 1565 | Find Greatest Common Divisor of 4999 and 1109, using prime factorization. | 4 |
| 1566 | Find Greatest Common Divisor of 4076 and 1024, using Euclidean algorithm. | 4 |
| 1567 | Find Greatest Common Divisor of 220 and 1323, using prime factorization. | 4 |
| 1568 | Find Greatest Common Divisor of 72, 120 and 144, using repeated division. | 4 |
| 1569 | Find Greatest Common Divisor of 40 and 25, using Euclidean algorithm. | 4 |
| 1570 | Find Greatest Common Divisor of 45 and 10, using repeated division. | 4 |
| 1571 | Find Greatest Common Divisor of 6773760 and 12902400, using prime factorization. | 4 |
| 1572 | Find Greatest Common Divisor of 24 and 36, using Euclidean algorithm. | 4 |
| 1573 | Find Greatest Common Divisor of 513, 1134 and 1215, using Euclidean algorithm. | 4 |
| 1574 | Find Greatest Common Divisor of 72, 108 and 2100, using Euclidean algorithm. | 4 |
| 1575 | Find Greatest Common Divisor of 27 and 108, using prime factorization. | 4 |
| 1576 | Find Greatest Common Divisor of 700 and 179, using prime factorization. | 4 |
| 1577 | Find Greatest Common Divisor of 700 and 179, using Euclidean algorithm. | 4 |
| 1578 | Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, by listing out the factors. | 4 |
| 1579 | Find Greatest Common Divisor of 504 and 1100, using Euclidean algorithm. | 4 |
| 1580 | Find Greatest Common Divisor of 40 and 60, using Euclidean algorithm. | 4 |
| 1581 | Find Greatest Common Divisor of 12 and 70, using prime factorization. | 4 |
| 1582 | Find Greatest Common Divisor of 12 and 70, using Euclidean algorithm. | 4 |
| 1583 | Find Greatest Common Divisor of 12 and 70, using repeated division. | 4 |
| 1584 | Find Greatest Common Divisor of 234 and 156, using prime factorization. | 4 |
| 1585 | Find Greatest Common Divisor of 234 and 156, using Euclidean algorithm. | 4 |
| 1586 | Find Greatest Common Divisor of 252 and 198, using prime factorization. | 4 |
| 1587 | Find Greatest Common Divisor of 142736 and 1729245, using Euclidean algorithm. | 4 |
| 1588 | Find Greatest Common Divisor of 586 and 682, using repeated division. | 4 |
| 1589 | Find Greatest Common Divisor of 511. | 4 |
| 1590 | Find Greatest Common Divisor of 2002 and 462, using Euclidean algorithm. | 4 |
| 1591 | Find Greatest Common Divisor of 3, 4 and 3, using prime factorization. | 4 |
| 1592 | Find Greatest Common Divisor of 26 and 9, using prime factorization. | 4 |
| 1593 | Find Greatest Common Divisor of 17 and 89, using Euclidean algorithm. | 4 |
| 1594 | Find Greatest Common Divisor of 1602. | 4 |
| 1595 | Find Greatest Common Divisor of 1602. | 4 |
| 1596 | Find Greatest Common Divisor of 6, 12 and 24, using prime factorization. | 4 |
| 1597 | Find Greatest Common Divisor of 8 and 5, using prime factorization. | 4 |
| 1598 | Find Greatest Common Divisor of 4, 1, 75 and 8, using prime factorization. | 4 |
| 1599 | Find Greatest Common Divisor of 4, 1, 75 and 8, using repeated division. | 4 |
| 1600 | Find Greatest Common Divisor of 8991 and 12345, using Euclidean algorithm. | 4 |
