GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1501 | Find Greatest Common Divisor of 39 and 13, using prime factorization. | 5 |
| 1502 | Find Greatest Common Divisor of 69 and 6, using prime factorization. | 5 |
| 1503 | Find Greatest Common Divisor of 254 and 70, using prime factorization. | 5 |
| 1504 | Find Greatest Common Divisor of 30 and 40, using prime factorization. | 5 |
| 1505 | Find Greatest Common Divisor of 2735. | 5 |
| 1506 | Find Greatest Common Divisor of 36 and 20, using repeated division. | 5 |
| 1507 | Find Greatest Common Divisor of 257. | 5 |
| 1508 | Find Greatest Common Divisor of 10 and 1120, using prime factorization. | 5 |
| 1509 | Find Greatest Common Divisor of 23 and 46, using prime factorization. | 5 |
| 1510 | Find Greatest Common Divisor of 143 and 91, using repeated division. | 5 |
| 1511 | Find Greatest Common Divisor of 24 and 4, using prime factorization. | 5 |
| 1512 | Find Greatest Common Divisor of 90 and 252, using Euclidean algorithm. | 5 |
| 1513 | Find Greatest Common Divisor of 90 and 252, using prime factorization. | 5 |
| 1514 | Find Greatest Common Divisor of 90 and 252, using repeated division. | 5 |
| 1515 | Find Greatest Common Divisor of 7 and 8, using repeated division. | 5 |
| 1516 | Find Greatest Common Divisor of 2 and 64, using prime factorization. | 5 |
| 1517 | Find Greatest Common Divisor of 52 and 6, using prime factorization. | 5 |
| 1518 | Find Greatest Common Divisor of 26 and 30, using prime factorization. | 5 |
| 1519 | Find Greatest Common Divisor of 2 and 720, using prime factorization. | 5 |
| 1520 | Find Greatest Common Divisor of 10 and 104, using prime factorization. | 5 |
| 1521 | Find Greatest Common Divisor of 30 and 32, using prime factorization. | 5 |
| 1522 | Find Greatest Common Divisor of 225 and 24, using prime factorization. | 5 |
| 1523 | Find Greatest Common Divisor of 100 and 45, using prime factorization. | 5 |
| 1524 | Find Greatest Common Divisor of 147 and 57, using prime factorization. | 5 |
| 1525 | Find Greatest Common Divisor of 2009 and 7, using prime factorization. | 5 |
| 1526 | Find Greatest Common Divisor of 80 and 12, using prime factorization. | 5 |
| 1527 | Find Greatest Common Divisor of 105 and 20, using prime factorization. | 5 |
| 1528 | Find Greatest Common Divisor of 27 and 39, using prime factorization. | 5 |
| 1529 | Find Greatest Common Divisor of 118 and 2, using prime factorization. | 5 |
| 1530 | Find Greatest Common Divisor of 16 and 352, using prime factorization. | 5 |
| 1531 | Find Greatest Common Divisor of 108 and 70, using prime factorization. | 5 |
| 1532 | Find Greatest Common Divisor of 171 and 9, using prime factorization. | 5 |
| 1533 | Find Greatest Common Divisor of 453 and 12, using prime factorization. | 5 |
| 1534 | Find Greatest Common Divisor of 81 and 36, using repeated division. | 5 |
| 1535 | Find Greatest Common Divisor of 81 and 36, by listing out the factors. | 5 |
| 1536 | Find Greatest Common Divisor of 2133132421. | 5 |
| 1537 | Find Greatest Common Divisor of 2133132421. | 5 |
| 1538 | Find Greatest Common Divisor of 24 and 46, using Euclidean algorithm. | 5 |
| 1539 | Find Greatest Common Divisor of 630 and 494, using prime factorization. | 5 |
| 1540 | Find Greatest Common Divisor of 102 and 60, using prime factorization. | 5 |
| 1541 | Find Greatest Common Divisor of 10092 and 1654, using Euclidean algorithm. | 5 |
| 1542 | Find Greatest Common Divisor of 1999 and 299, using Euclidean algorithm. | 5 |
| 1543 | Find Greatest Common Divisor of 22800 and 15200, using prime factorization. | 5 |
| 1544 | Find Greatest Common Divisor of 513. | 4 |
| 1545 | Find Greatest Common Divisor of 6977. | 4 |
| 1546 | Find Greatest Common Divisor of 128 and 324, by listing out the factors. | 4 |
| 1547 | Find Greatest Common Divisor of 128 and 324, using Euclidean algorithm. | 4 |
| 1548 | Find Greatest Common Divisor of 478 and 127, using Euclidean algorithm. | 4 |
| 1549 | Find Greatest Common Divisor of 18, 54 and 81, using Euclidean algorithm. | 4 |
| 1550 | Find Greatest Common Divisor of 70 and 8, using prime factorization. | 4 |