GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1551 | Find Greatest Common Divisor of 357 and 476, using prime factorization. | 2 |
1552 | Find Greatest Common Divisor of 1048 and 136, using Euclidean algorithm. | 2 |
1553 | Find Greatest Common Divisor of 10 and 9, using prime factorization. | 2 |
1554 | Find Greatest Common Divisor of 366 and 36, using prime factorization. | 2 |
1555 | Find Greatest Common Divisor of 195 and 45, using Euclidean algorithm. | 2 |
1556 | Find Greatest Common Divisor of 366 and 36, using Euclidean algorithm. | 2 |
1557 | Find Greatest Common Divisor of 345 and 369, using prime factorization. | 2 |
1558 | Find Greatest Common Divisor of 8, 16 and 20, using prime factorization. | 2 |
1559 | Find Greatest Common Divisor of 2689 and 1369, using Euclidean algorithm. | 2 |
1560 | Find Greatest Common Divisor of 31 and 120, using prime factorization. | 2 |
1561 | Find Greatest Common Divisor of 8 and 10, by listing out the factors. | 2 |
1562 | Find Greatest Common Divisor of 54321 and 9876, using Euclidean algorithm. | 2 |
1563 | Find Greatest Common Divisor of 457 and 13, using prime factorization. | 2 |
1564 | Find Greatest Common Divisor of 369 and 345, using repeated division. | 2 |
1565 | Find Greatest Common Divisor of 12, 18 and 21, using prime factorization. | 2 |
1566 | Find Greatest Common Divisor of 12 and 90, using prime factorization. | 2 |
1567 | Find Greatest Common Divisor of 41 and 1001, using prime factorization. | 2 |
1568 | Find Greatest Common Divisor of 32 and 120, using prime factorization. | 2 |
1569 | Find Greatest Common Divisor of 75 and 60, using prime factorization. | 2 |
1570 | Find Greatest Common Divisor of 116369 and 2873, by listing out the factors. | 2 |
1571 | Find Greatest Common Divisor of 143 and 227, using prime factorization. | 2 |
1572 | Find Greatest Common Divisor of 33 and 120, using prime factorization. | 2 |
1573 | Find Greatest Common Divisor of 8 and 10, using repeated division. | 2 |
1574 | Find Greatest Common Divisor of 180, 2 and 210, using prime factorization. | 2 |
1575 | Find Greatest Common Divisor of 1513 and 120, using prime factorization. | 2 |
1576 | Find Greatest Common Divisor of 5 and 1, using prime factorization. | 2 |
1577 | Find Greatest Common Divisor of 20 and 115, using prime factorization. | 2 |
1578 | Find Greatest Common Divisor of 12 and 8, using repeated division. | 2 |
1579 | Find Greatest Common Divisor of 369 and 345, using Euclidean algorithm. | 2 |
1580 | Find Greatest Common Divisor of 35 and 120, using prime factorization. | 2 |
1581 | Find Greatest Common Divisor of 72 and 52, using repeated division. | 2 |
1582 | Find Greatest Common Divisor of 12 and 16, using repeated division. | 2 |
1583 | Find Greatest Common Divisor of 5871420 and 299, using prime factorization. | 2 |
1584 | Find Greatest Common Divisor of 9, 15 and 12, using prime factorization. | 2 |
1585 | Find Greatest Common Divisor of 3, 2, 2 and 2, using prime factorization. | 2 |
1586 | Find Greatest Common Divisor of 3, 1 and 1, using Euclidean algorithm. | 2 |
1587 | Find Greatest Common Divisor of 42, 63 and 140, using prime factorization. | 2 |
1588 | Find Greatest Common Divisor of 36 and 120, using prime factorization. | 2 |
1589 | Find Greatest Common Divisor of 18 and 45, using prime factorization. | 2 |
1590 | Find Greatest Common Divisor of 4001, 1312 and 458, using Euclidean algorithm. | 2 |
1591 | Find Greatest Common Divisor of 259 and 621, using prime factorization. | 2 |
1592 | Find Greatest Common Divisor of 457 and 3250, using prime factorization. | 2 |
1593 | Find Greatest Common Divisor of 11200 and 7, by listing out the factors. | 2 |
1594 | Find Greatest Common Divisor of 78 and 32, using Euclidean algorithm. | 2 |
1595 | Find Greatest Common Divisor of 2, 4 and 6, using prime factorization. | 2 |
1596 | Find Greatest Common Divisor of 98 and 24, using Euclidean algorithm. | 2 |
1597 | Find Greatest Common Divisor of 60 and 84, using Euclidean algorithm. | 2 |
1598 | Find Greatest Common Divisor of 125 and 11, using prime factorization. | 2 |
1599 | Find Greatest Common Divisor of 91, 64 and 87, using prime factorization. | 2 |
1600 | Find Greatest Common Divisor of 102 and 221, using prime factorization. | 2 |