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 397 and 450, using Euclidean algorithm. | 2 |
1452 | Find Greatest Common Divisor of 1111 and 1111, using prime factorization. | 2 |
1453 | Find Greatest Common Divisor of 228 and 28, using prime factorization. | 2 |
1454 | Find Greatest Common Divisor of 35. | 2 |
1455 | Find Greatest Common Divisor of 2015 and 2018, using prime factorization. | 2 |
1456 | Find Greatest Common Divisor of 36 and 45, using prime factorization. | 2 |
1457 | Find Greatest Common Divisor of 16, 20 and 12, using prime factorization. | 2 |
1458 | Find Greatest Common Divisor of 972 and 2250, using prime factorization. | 2 |
1459 | Find Greatest Common Divisor of 18, 20 and 26, using prime factorization. | 2 |
1460 | Find Greatest Common Divisor of 18, 20 and 16, using prime factorization. | 2 |
1461 | Find Greatest Common Divisor of 32, 48 and 44, using prime factorization. | 2 |
1462 | Find Greatest Common Divisor of 34 and 68, using prime factorization. | 2 |
1463 | Find Greatest Common Divisor of 2771 and 206, using prime factorization. | 2 |
1464 | Find Greatest Common Divisor of 1, 8, 0, 36, 0 and 9, using prime factorization. | 2 |
1465 | Find Greatest Common Divisor of 12, 14, 34, 41, 47 and 34, using prime factorization. | 2 |
1466 | Find Greatest Common Divisor of 1100 and 57330, using Euclidean algorithm. | 2 |
1467 | Find Greatest Common Divisor of 4113. | 2 |
1468 | Find Greatest Common Divisor of 117 and 4113, using prime factorization. | 2 |
1469 | Find Greatest Common Divisor of 457 and 13, using prime factorization. | 2 |
1470 | Find Greatest Common Divisor of 457 and 3250, using prime factorization. | 2 |
1471 | Find Greatest Common Divisor of 8, 12 and 30, using prime factorization. | 2 |
1472 | Find Greatest Common Divisor of 18, 16, 54 and 36, using prime factorization. | 2 |
1473 | Find Greatest Common Divisor of 14, 27 and 55, using prime factorization. | 2 |
1474 | Find Greatest Common Divisor of 20 and 9, using repeated division. | 2 |
1475 | Find Greatest Common Divisor of 260 and 628, using prime factorization. | 2 |
1476 | Find Greatest Common Divisor of 27 and 8, using prime factorization. | 2 |
1477 | Find Greatest Common Divisor of 406 and 945, using prime factorization. | 2 |
1478 | Find Greatest Common Divisor of 405 and 945, using prime factorization. | 2 |
1479 | Find Greatest Common Divisor of 132 and 630, using Euclidean algorithm. | 2 |
1480 | Find Greatest Common Divisor of 66 and 150, using repeated division. | 2 |
1481 | Find Greatest Common Divisor of 170 and 122, using repeated division. | 2 |
1482 | Find Greatest Common Divisor of 170 and 122, by listing out the factors. | 2 |
1483 | Find Greatest Common Divisor of 792 and 275, using prime factorization. | 2 |
1484 | Find Greatest Common Divisor of 39 and 2535, using prime factorization. | 2 |
1485 | Find Greatest Common Divisor of 54 and 888, using Euclidean algorithm. | 2 |
1486 | Find Greatest Common Divisor of 25 and 29, using prime factorization. | 2 |
1487 | Find Greatest Common Divisor of 5245 and 930, using prime factorization. | 2 |
1488 | Find Greatest Common Divisor of 4076 and 2076, using prime factorization. | 2 |
1489 | Find Greatest Common Divisor of 457 and 378, using prime factorization. | 2 |
1490 | Find Greatest Common Divisor of 780 and 224, using repeated division. | 2 |
1491 | Find Greatest Common Divisor of 25, 30 and 40, using prime factorization. | 2 |
1492 | Find Greatest Common Divisor of 25, 30 and 40, using Euclidean algorithm. | 2 |
1493 | Find Greatest Common Divisor of 26513 and 32321, using Euclidean algorithm. | 2 |
1494 | Find Greatest Common Divisor of 415 and 142, using Euclidean algorithm. | 2 |
1495 | Find Greatest Common Divisor of 471 and 562, using Euclidean algorithm. | 2 |
1496 | Find Greatest Common Divisor of 295 and 504, using Euclidean algorithm. | 2 |
1497 | Find Greatest Common Divisor of 387 and 129, using Euclidean algorithm. | 2 |
1498 | Find Greatest Common Divisor of 359 and 125, using prime factorization. | 2 |
1499 | Find Greatest Common Divisor of 8 and 12, using Euclidean algorithm. | 2 |
1500 | Find Greatest Common Divisor of 1320 and 1065, using prime factorization. | 2 |