GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1451 | Find Greatest Common Divisor of 2957 and 400680, using repeated division. | 2 |
1452 | Find Greatest Common Divisor of 604 and 138, using prime factorization. | 2 |
1453 | Find Greatest Common Divisor of 20 and 4, using prime factorization. | 2 |
1454 | Find Greatest Common Divisor of 80 and 90, using prime factorization. | 2 |
1455 | Find Greatest Common Divisor of 276 and 115, using Euclidean algorithm. | 2 |
1456 | Find Greatest Common Divisor of 54 and 888, using Euclidean algorithm. | 2 |
1457 | Find Greatest Common Divisor of 70 and 120, using prime factorization. | 2 |
1458 | Find Greatest Common Divisor of 1340 and 1340, using prime factorization. | 2 |
1459 | Find Greatest Common Divisor of 90 and 1, using Euclidean algorithm. | 2 |
1460 | Find Greatest Common Divisor of 2957 and 400680, using prime factorization. | 2 |
1461 | Find Greatest Common Divisor of 1 and 5, using prime factorization. | 2 |
1462 | Find Greatest Common Divisor of 12 and 5, using prime factorization. | 2 |
1463 | Find Greatest Common Divisor of 132 and 318, using Euclidean algorithm. | 2 |
1464 | Find Greatest Common Divisor of 2957 and 400680, using Euclidean algorithm. | 2 |
1465 | Find Greatest Common Divisor of 17 and 25, using repeated division. | 2 |
1466 | Find Greatest Common Divisor of 0 and 2, using prime factorization. | 2 |
1467 | Find Greatest Common Divisor of 70 and 120, using repeated division. | 2 |
1468 | Find Greatest Common Divisor of 976 and 174, using prime factorization. | 2 |
1469 | Find Greatest Common Divisor of 209 and 132, using prime factorization. | 2 |
1470 | Find Greatest Common Divisor of 3501 and 400680, using Euclidean algorithm. | 2 |
1471 | Find Greatest Common Divisor of 243. | 2 |
1472 | Find Greatest Common Divisor of 17 and 25, by listing out the factors. | 2 |
1473 | Find Greatest Common Divisor of 65 and 39, using prime factorization. | 2 |
1474 | Find Greatest Common Divisor of 40 and 210, using prime factorization. | 2 |
1475 | Find Greatest Common Divisor of 42 and 70, using prime factorization. | 2 |
1476 | Find Greatest Common Divisor of 168 and 504, using repeated division. | 2 |
1477 | Find Greatest Common Divisor of 1369 and 2597, using Euclidean algorithm. | 2 |
1478 | Find Greatest Common Divisor of 4 and 20, using Euclidean algorithm. | 2 |
1479 | Find Greatest Common Divisor of 296 and 4995, using prime factorization. | 2 |
1480 | Find Greatest Common Divisor of 229 and 66, using prime factorization. | 2 |
1481 | Find Greatest Common Divisor of 115, 230 and 345, using repeated division. | 2 |
1482 | Find Greatest Common Divisor of 6897 and 9481, using Euclidean algorithm. | 2 |
1483 | Find Greatest Common Divisor of 20, 15 and 5, using prime factorization. | 2 |
1484 | Find Greatest Common Divisor of 437 and 219, by listing out the factors. | 2 |
1485 | Find Greatest Common Divisor of 728. | 2 |
1486 | Find Greatest Common Divisor of 9, 5 and 43, using prime factorization. | 2 |
1487 | Find Greatest Common Divisor of 442 and 1120, using Euclidean algorithm. | 2 |
1488 | Find Greatest Common Divisor of 425 and 85, using repeated division. | 2 |
1489 | Find Greatest Common Divisor of 28, 38, 52, 54 and 68, using prime factorization. | 2 |
1490 | Find Greatest Common Divisor of 143 and 277, using Euclidean algorithm. | 2 |
1491 | Find Greatest Common Divisor of 60, 4 and 8, by listing out the factors. | 2 |
1492 | Find Greatest Common Divisor of 21 and 72, using prime factorization. | 2 |
1493 | Find Greatest Common Divisor of 66 and 286, using prime factorization. | 2 |
1494 | Find Greatest Common Divisor of 10 and 18, using repeated division. | 2 |
1495 | Find Greatest Common Divisor of 12906 and 42905, using Euclidean algorithm. | 2 |
1496 | Find Greatest Common Divisor of 21 and 72, using Euclidean algorithm. | 2 |
1497 | Find Greatest Common Divisor of 1023 and 217, using prime factorization. | 2 |
1498 | Find Greatest Common Divisor of 5 and 192, using repeated division. | 2 |
1499 | Find Greatest Common Divisor of 341 and 385, using prime factorization. | 2 |
1500 | Find Greatest Common Divisor of 49 and 900, using prime factorization. | 2 |