GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 401 | Find Greatest Common Divisor of 509 and 1177, using Euclidean algorithm. | 5 |
| 402 | Find Greatest Common Divisor of 6 and 36, using prime factorization. | 5 |
| 403 | Find Greatest Common Divisor of 65 and 130, using prime factorization. | 5 |
| 404 | Find Greatest Common Divisor of 816 and 1071, using Euclidean algorithm. | 5 |
| 405 | Find Greatest Common Divisor of 93 and 42, using Euclidean algorithm. | 5 |
| 406 | Find Greatest Common Divisor of 24140 and 16762, using Euclidean algorithm. | 5 |
| 407 | Find Greatest Common Divisor of 1369 and 2597, using Euclidean algorithm. | 5 |
| 408 | Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm. | 5 |
| 409 | Find Greatest Common Divisor of 16534528044 and 8332745927, using Euclidean algorithm. | 5 |
| 410 | Find Greatest Common Divisor of 128 and 423, using prime factorization. | 5 |
| 411 | Find Greatest Common Divisor of 1220 and 288, using Euclidean algorithm. | 5 |
| 412 | Find Greatest Common Divisor of 330 and 156, using Euclidean algorithm. | 5 |
| 413 | Find Greatest Common Divisor of 0 and 6, using prime factorization. | 5 |
| 414 | Find Greatest Common Divisor of 784 and 336, using Euclidean algorithm. | 5 |
| 415 | Find Greatest Common Divisor of 35 and 25, using Euclidean algorithm. | 5 |
| 416 | Find Greatest Common Divisor of 16 and 35, using prime factorization. | 5 |
| 417 | Find Greatest Common Divisor of 18 and 32, using prime factorization. | 5 |
| 418 | Find Greatest Common Divisor of 96 and 34, using prime factorization. | 5 |
| 419 | Find Greatest Common Divisor of 18 and 201, using prime factorization. | 5 |
| 420 | Find Greatest Common Divisor of 11 and 55, using prime factorization. | 5 |
| 421 | Find Greatest Common Divisor of 102, 170 and 255, using prime factorization. | 5 |
| 422 | Find Greatest Common Divisor of 18 and 201, by listing out the factors. | 5 |
| 423 | Find Greatest Common Divisor of 2 and 82, using prime factorization. | 5 |
| 424 | Find Greatest Common Divisor of 36 and 60, using prime factorization. | 5 |
| 425 | Find Greatest Common Divisor of 24 and 36, using prime factorization. | 5 |
| 426 | Find Greatest Common Divisor of 36 and 54, using Euclidean algorithm. | 5 |
| 427 | Find Greatest Common Divisor of 3587 and 1819, using prime factorization. | 5 |
| 428 | Find Greatest Common Divisor of 315 and 825, using prime factorization. | 5 |
| 429 | Find Greatest Common Divisor of 504 and 270, using Euclidean algorithm. | 5 |
| 430 | Find Greatest Common Divisor of 27 and 108, using prime factorization. | 4 |
| 431 | Find Greatest Common Divisor of 6699 and 8265, using prime factorization. | 4 |
| 432 | Find Greatest Common Divisor of 72, 108 and 2100, using prime factorization. | 4 |
| 433 | Find Greatest Common Divisor of 270 and 192, using prime factorization. | 4 |
| 434 | Find Greatest Common Divisor of 628 and 2260, using prime factorization. | 4 |
| 435 | Find Greatest Common Divisor of 216, 900, 36, 120, 144, 108, 49, 60, 150 and 25, using prime factorization. | 4 |
| 436 | Find Greatest Common Divisor of 941688 and 133980, by listing out the factors. | 4 |
| 437 | Find Greatest Common Divisor of 17 and 33, using Euclidean algorithm. | 4 |
| 438 | Find Greatest Common Divisor of 56 and 98, using prime factorization. | 4 |
| 439 | Find Greatest Common Divisor of 66 and 150, using prime factorization. | 4 |
| 440 | Find Greatest Common Divisor of 1001 and 1331, using prime factorization. | 4 |
| 441 | Find Greatest Common Divisor of 0 and 8, using prime factorization. | 4 |
| 442 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using prime factorization. | 4 |
| 443 | Find Greatest Common Divisor of 5 and 4, using prime factorization. | 4 |
| 444 | Find Greatest Common Divisor of 504 and 1100, using Euclidean algorithm. | 4 |
| 445 | Find Greatest Common Divisor of 221 and 35, using Euclidean algorithm. | 4 |
| 446 | Find Greatest Common Divisor of 8976 and 345, using Euclidean algorithm. | 4 |
| 447 | Find Greatest Common Divisor of 17 and 34, using Euclidean algorithm. | 4 |
| 448 | Find Greatest Common Divisor of 160 and 7, using Euclidean algorithm. | 4 |
| 449 | Find Greatest Common Divisor of 258 and 518, using prime factorization. | 4 |
| 450 | Find Greatest Common Divisor of 258 and 518, using repeated division. | 4 |
