GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1451 | Find Greatest Common Divisor of 2592 and 69, using Euclidean algorithm. | 5 |
| 1452 | Find Greatest Common Divisor of 2592 and 2543, using Euclidean algorithm. | 5 |
| 1453 | Find Greatest Common Divisor of 2592 and 2569, using Euclidean algorithm. | 5 |
| 1454 | Find Greatest Common Divisor of 2406 and 654, using Euclidean algorithm. | 5 |
| 1455 | Find Greatest Common Divisor of 105, 315 and 462, using prime factorization. | 5 |
| 1456 | Find Greatest Common Divisor of 108 and 5, using prime factorization. | 5 |
| 1457 | Find Greatest Common Divisor of 112 and 48, using prime factorization. | 5 |
| 1458 | Find Greatest Common Divisor of 46 and 177, using prime factorization. | 5 |
| 1459 | Find Greatest Common Divisor of 55 and 16, using prime factorization. | 5 |
| 1460 | Find Greatest Common Divisor of 56 and 24, using repeated division. | 5 |
| 1461 | Find Greatest Common Divisor of 24 and 16, using repeated division. | 5 |
| 1462 | Find Greatest Common Divisor of 1164, 3445 and 4146, using prime factorization. | 5 |
| 1463 | Find Greatest Common Divisor of 9964, 7058 and 4427, using repeated division. | 5 |
| 1464 | Find Greatest Common Divisor of 60 and 146, using Euclidean algorithm. | 5 |
| 1465 | Find Greatest Common Divisor of 60 and 146, using prime factorization. | 5 |
| 1466 | Find Greatest Common Divisor of 2059 and 581, using Euclidean algorithm. | 5 |
| 1467 | Find Greatest Common Divisor of 232, 392 and 1989, using prime factorization. | 5 |
| 1468 | Find Greatest Common Divisor of 864162. | 5 |
| 1469 | Find Greatest Common Divisor of 7939 and 437325, using Euclidean algorithm. | 5 |
| 1470 | Find Greatest Common Divisor of 2304, 20736 and 576, using prime factorization. | 5 |
| 1471 | Find Greatest Common Divisor of 52, 9843 and 105, using prime factorization. | 5 |
| 1472 | Find Greatest Common Divisor of 120 and 180, using repeated division. | 5 |
| 1473 | Find Greatest Common Divisor of 1625 and 975, using Euclidean algorithm. | 5 |
| 1474 | Find Greatest Common Divisor of 7963409. | 5 |
| 1475 | Find Greatest Common Divisor of 54, 84 and 108, using Euclidean algorithm. | 5 |
| 1476 | Find Greatest Common Divisor of 54, 84 and 108, using repeated division. | 5 |
| 1477 | Find Greatest Common Divisor of 69 and 161, using Euclidean algorithm. | 5 |
| 1478 | Find Greatest Common Divisor of 2210 and 1131, using Euclidean algorithm. | 5 |
| 1479 | Find Greatest Common Divisor of 45 and 67, using prime factorization. | 5 |
| 1480 | Find Greatest Common Divisor of 27 and 180, using prime factorization. | 5 |
| 1481 | Find Greatest Common Divisor of 2 and 90, using prime factorization. | 5 |
| 1482 | Find Greatest Common Divisor of 82071 and 1133349, using prime factorization. | 5 |
| 1483 | Find Greatest Common Divisor of 104 and 42, using Euclidean algorithm. | 5 |
| 1484 | Find Greatest Common Divisor of 98 and 57, using prime factorization. | 5 |
| 1485 | Find Greatest Common Divisor of 98 and 105, using prime factorization. | 5 |
| 1486 | Find Greatest Common Divisor of 34 and 255, using Euclidean algorithm. | 5 |
| 1487 | Find Greatest Common Divisor of 36, 24 and 60, using prime factorization. | 5 |
| 1488 | Find Greatest Common Divisor of 36, 24 and 60, using repeated division. | 5 |
| 1489 | Find Greatest Common Divisor of 7 and 8, using Euclidean algorithm. | 5 |
| 1490 | Find Greatest Common Divisor of 16. | 5 |
| 1491 | Find Greatest Common Divisor of 756 and 537, using Euclidean algorithm. | 5 |
| 1492 | Find Greatest Common Divisor of 114. | 5 |
| 1493 | Find Greatest Common Divisor of 98 and 199, using Euclidean algorithm. | 5 |
| 1494 | Find Greatest Common Divisor of 4901 and 1729, using prime factorization. | 5 |
| 1495 | Find Greatest Common Divisor of 120. | 5 |
| 1496 | Find Greatest Common Divisor of 120 and 168, using prime factorization. | 5 |
| 1497 | Find Greatest Common Divisor of 128 and 1001, using Euclidean algorithm. | 5 |
| 1498 | Find Greatest Common Divisor of 7234 and 3476, using Euclidean algorithm. | 5 |
| 1499 | Find Greatest Common Divisor of 30864 and 15400, using prime factorization. | 5 |
| 1500 | Find Greatest Common Divisor of 3486 and 10292, using Euclidean algorithm. | 5 |