GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7501 | Find Greatest Common Divisor of 210 and 588, using Euclidean algorithm. | 1 |
| 7502 | Find Greatest Common Divisor of 56 and 16, using prime factorization. | 1 |
| 7503 | Find Greatest Common Divisor of 10 and 12, using prime factorization. | 1 |
| 7504 | Find Greatest Common Divisor of 45 and 10, using prime factorization. | 1 |
| 7505 | Find Greatest Common Divisor of 144 and 610, using prime factorization. | 1 |
| 7506 | Find Greatest Common Divisor of 1665, 4554, 1683 and 4050, using repeated division. | 1 |
| 7507 | Find Greatest Common Divisor of 979 and 234, using prime factorization. | 1 |
| 7508 | Find Greatest Common Divisor of 754 and 33, using prime factorization. | 1 |
| 7509 | Find Greatest Common Divisor of 10669 and 360, using prime factorization. | 1 |
| 7510 | Find Greatest Common Divisor of 13 and 226, using prime factorization. | 1 |
| 7511 | Find Greatest Common Divisor of 13 and 226, using Euclidean algorithm. | 1 |
| 7512 | Find Greatest Common Divisor of 400 and 600, using repeated division. | 1 |
| 7513 | Find Greatest Common Divisor of 2260 and 812, using Euclidean algorithm. | 1 |
| 7514 | Find Greatest Common Divisor of 3912 and 618, using prime factorization. | 1 |
| 7515 | Find Greatest Common Divisor of 2, 2 and 1, using prime factorization. | 1 |
| 7516 | Find Greatest Common Divisor of 7469 and 4369, using Euclidean algorithm. | 1 |
| 7517 | Find Greatest Common Divisor of 4001 and 1312, using Euclidean algorithm. | 1 |
| 7518 | Find Greatest Common Divisor of 90 and 70, using prime factorization. | 1 |
| 7519 | Find Greatest Common Divisor of 90 and 70, using Euclidean algorithm. | 1 |
| 7520 | Find Greatest Common Divisor of 18021945. | 1 |
| 7521 | Find Greatest Common Divisor of 18021945, 3440835, 1003650 and 2443387, using prime factorization. | 1 |
| 7522 | Find Greatest Common Divisor of 17 and 25, using prime factorization. | 1 |
| 7523 | Find Greatest Common Divisor of 3223 and 5654, using prime factorization. | 1 |
| 7524 | Find Greatest Common Divisor of 68763878 and 98293729, using prime factorization. | 1 |
| 7525 | Find Greatest Common Divisor of 4294967295 and 4294967287, using prime factorization. | 1 |
| 7526 | Find Greatest Common Divisor of 15400 and 735, using prime factorization. | 1 |
| 7527 | Find Greatest Common Divisor of 50 and 12, using Euclidean algorithm. | 1 |
| 7528 | Find Greatest Common Divisor of 28 and 36, using Euclidean algorithm. | 1 |
| 7529 | Find Greatest Common Divisor of 30 and 80, using prime factorization. | 1 |
| 7530 | Find Greatest Common Divisor of 70, 120 and 217, using repeated division. | 1 |
| 7531 | Find Greatest Common Divisor of 70, 120 and 217, by listing out the factors. | 1 |
| 7532 | Find Greatest Common Divisor of 10 and 217, using Euclidean algorithm. | 1 |
| 7533 | Find Greatest Common Divisor of 70, 120 and 217, using Euclidean algorithm. | 1 |
| 7534 | Find Greatest Common Divisor of 232 and 145, using repeated division. | 1 |
| 7535 | Find Greatest Common Divisor of 232 and 145, using prime factorization. | 1 |
| 7536 | Find Greatest Common Divisor of 232 and 145, using Euclidean algorithm. | 1 |
| 7537 | Find Greatest Common Divisor of 800 and 234, using Euclidean algorithm. | 1 |
| 7538 | Find Greatest Common Divisor of 720 and 350, using prime factorization. | 1 |
| 7539 | Find Greatest Common Divisor of 114 and 143, using prime factorization. | 1 |
| 7540 | Find Greatest Common Divisor of 110 and 143, using prime factorization. | 1 |
| 7541 | Find Greatest Common Divisor of 10 and 143, using prime factorization. | 1 |
| 7542 | Find Greatest Common Divisor of 4032066, 2010 and 8096384514, using prime factorization. | 1 |
| 7543 | Find Greatest Common Divisor of 2 and 143, using prime factorization. | 1 |
| 7544 | Find Greatest Common Divisor of 1 and 143, using prime factorization. | 1 |
| 7545 | Find Greatest Common Divisor of 272 and 119, using Euclidean algorithm. | 1 |
| 7546 | Find Greatest Common Divisor of 1472 and 1124, using prime factorization. | 1 |
| 7547 | Find Greatest Common Divisor of 1472 and 1124, using Euclidean algorithm. | 1 |
| 7548 | Find Greatest Common Divisor of 629 and 187, using prime factorization. | 1 |
| 7549 | Find Greatest Common Divisor of 15015 and 3292, using prime factorization. | 1 |
| 7550 | Find Greatest Common Divisor of 120 and 126, using prime factorization. | 1 |
