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 2027. | 6 |
| 1502 | Find Greatest Common Divisor of 58 and 72, using prime factorization. | 6 |
| 1503 | Find Greatest Common Divisor of 15, 18 and 56, using prime factorization. | 6 |
| 1504 | Find Greatest Common Divisor of 56 and 70, using prime factorization. | 6 |
| 1505 | Find Greatest Common Divisor of 21 and 10, using prime factorization. | 6 |
| 1506 | Find Greatest Common Divisor of 15210 and 10210, using Euclidean algorithm. | 6 |
| 1507 | Find Greatest Common Divisor of 15290 and 10290, using Euclidean algorithm. | 6 |
| 1508 | Find Greatest Common Divisor of 1297 and 26, by listing out the factors. | 6 |
| 1509 | Find Greatest Common Divisor of 108 and 10, using Euclidean algorithm. | 6 |
| 1510 | Find Greatest Common Divisor of 986 and 289, using Euclidean algorithm. | 6 |
| 1511 | Find Greatest Common Divisor of 11 and 72, using Euclidean algorithm. | 6 |
| 1512 | Find Greatest Common Divisor of 30 and 13, using prime factorization. | 6 |
| 1513 | Find Greatest Common Divisor of 8, 9 and 45, using prime factorization. | 6 |
| 1514 | Find Greatest Common Divisor of 29640 and 179, by listing out the factors. | 6 |
| 1515 | Find Greatest Common Divisor of 1607. | 6 |
| 1516 | Find Greatest Common Divisor of 595 and 1463, using prime factorization. | 6 |
| 1517 | Find Greatest Common Divisor of 9357 and 5864, using Euclidean algorithm. | 6 |
| 1518 | Find Greatest Common Divisor of 91, 21, 1 and 2, using prime factorization. | 6 |
| 1519 | Find Greatest Common Divisor of 91, 21, 1 and 1, using prime factorization. | 6 |
| 1520 | Find Greatest Common Divisor of 2025 and 1089, using Euclidean algorithm. | 6 |
| 1521 | Find Greatest Common Divisor of 36, 63 and 108, using repeated division. | 6 |
| 1522 | Find Greatest Common Divisor of 9973 and 6393, using Euclidean algorithm. | 6 |
| 1523 | Find Greatest Common Divisor of 79 and 61, using prime factorization. | 6 |
| 1524 | Find Greatest Common Divisor of 48 and 4, using prime factorization. | 6 |
| 1525 | Find Greatest Common Divisor of 2 and 87, using Euclidean algorithm. | 6 |
| 1526 | Find Greatest Common Divisor of 3, 4 and 2, using prime factorization. | 6 |
| 1527 | Find Greatest Common Divisor of 6 and 24, by listing out the factors. | 6 |
| 1528 | Find Greatest Common Divisor of 4288 and 464, using Euclidean algorithm. | 6 |
| 1529 | Find Greatest Common Divisor of 110, 180 and 540, using prime factorization. | 6 |
| 1530 | Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm. | 6 |
| 1531 | Find Greatest Common Divisor of 2486625522 and 41582215163, using prime factorization. | 6 |
| 1532 | Find Greatest Common Divisor of 45 and 36, using Euclidean algorithm. | 6 |
| 1533 | Find Greatest Common Divisor of 7 and 9, using prime factorization. | 6 |
| 1534 | Find Greatest Common Divisor of 123456 and 789, using prime factorization. | 6 |
| 1535 | Find Greatest Common Divisor of 93149832 and 73482, using Euclidean algorithm. | 6 |
| 1536 | Find Greatest Common Divisor of 2 and 24, using prime factorization. | 6 |
| 1537 | Find Greatest Common Divisor of 1424 and 3084, using Euclidean algorithm. | 6 |
| 1538 | Find Greatest Common Divisor of 252 and 198, using prime factorization. | 6 |
| 1539 | Find Greatest Common Divisor of 4788 and 31256, using Euclidean algorithm. | 6 |
| 1540 | Find Greatest Common Divisor of 19 and 160, using prime factorization. | 6 |
| 1541 | Find Greatest Common Divisor of 42 and 14, using prime factorization. | 6 |
| 1542 | Find Greatest Common Divisor of 119 and 272, using Euclidean algorithm. | 6 |
| 1543 | Find Greatest Common Divisor of 32 and 640, using Euclidean algorithm. | 6 |
| 1544 | Find Greatest Common Divisor of 504 and 385, using Euclidean algorithm. | 6 |
| 1545 | Find Greatest Common Divisor of 48 and 60, using Euclidean algorithm. | 6 |
| 1546 | Find Greatest Common Divisor of 11111 and 111111, using Euclidean algorithm. | 6 |
| 1547 | Find Greatest Common Divisor of 3, 5 and 7, using prime factorization. | 6 |
| 1548 | Find Greatest Common Divisor of 504 and 270, using Euclidean algorithm. | 6 |
| 1549 | Find Greatest Common Divisor of 17 and 3120, using prime factorization. | 6 |
| 1550 | Find Greatest Common Divisor of 4131 and 2431, using Euclidean algorithm. | 6 |