GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 501 | Find Greatest Common Divisor of 8 and 65, using prime factorization. | 4 |
| 502 | Find Greatest Common Divisor of 123 and 36, using prime factorization. | 4 |
| 503 | Find Greatest Common Divisor of 45 and 18, using prime factorization. | 4 |
| 504 | Find Greatest Common Divisor of 45 and 10, using repeated division. | 4 |
| 505 | Find Greatest Common Divisor of 6773760 and 12902400, using prime factorization. | 4 |
| 506 | Find Greatest Common Divisor of 62 and 8, using prime factorization. | 4 |
| 507 | Find Greatest Common Divisor of 513, 1134 and 1215, using Euclidean algorithm. | 4 |
| 508 | Find Greatest Common Divisor of 72, 108 and 2100, using Euclidean algorithm. | 4 |
| 509 | Find Greatest Common Divisor of 27 and 6, using prime factorization. | 4 |
| 510 | Find Greatest Common Divisor of 594 and 16, using prime factorization. | 4 |
| 511 | Find Greatest Common Divisor of 27 and 108, using prime factorization. | 4 |
| 512 | Find Greatest Common Divisor of 700 and 179, using prime factorization. | 4 |
| 513 | Find Greatest Common Divisor of 700 and 179, using Euclidean algorithm. | 4 |
| 514 | Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, by listing out the factors. | 4 |
| 515 | Find Greatest Common Divisor of 93149832 and 73482, using Euclidean algorithm. | 4 |
| 516 | Find Greatest Common Divisor of 504 and 1100, using Euclidean algorithm. | 4 |
| 517 | Find Greatest Common Divisor of 108 and 10, using prime factorization. | 4 |
| 518 | Find Greatest Common Divisor of 40 and 60, using Euclidean algorithm. | 4 |
| 519 | Find Greatest Common Divisor of 60 and 5, using prime factorization. | 4 |
| 520 | Find Greatest Common Divisor of 12 and 70, using prime factorization. | 4 |
| 521 | Find Greatest Common Divisor of 12 and 70, using Euclidean algorithm. | 4 |
| 522 | Find Greatest Common Divisor of 12 and 70, using repeated division. | 4 |
| 523 | Find Greatest Common Divisor of 18 and 42, using prime factorization. | 4 |
| 524 | Find Greatest Common Divisor of 54 and 4, using prime factorization. | 4 |
| 525 | Find Greatest Common Divisor of 8125 and 10000, using prime factorization. | 4 |
| 526 | Find Greatest Common Divisor of 54 and 10, using prime factorization. | 4 |
| 527 | Find Greatest Common Divisor of 234 and 156, using prime factorization. | 4 |
| 528 | Find Greatest Common Divisor of 234 and 156, using Euclidean algorithm. | 4 |
| 529 | Find Greatest Common Divisor of 26 and 16, using prime factorization. | 4 |
| 530 | Find Greatest Common Divisor of 8 and 20, using prime factorization. | 4 |
| 531 | Find Greatest Common Divisor of 165 and 346, using Euclidean algorithm. | 4 |
| 532 | Find Greatest Common Divisor of 64 and 4, using prime factorization. | 4 |
| 533 | Find Greatest Common Divisor of 2026. | 4 |
| 534 | Find Greatest Common Divisor of 586 and 682, using repeated division. | 4 |
| 535 | Find Greatest Common Divisor of 511. | 4 |
| 536 | Find Greatest Common Divisor of 2002 and 462, using Euclidean algorithm. | 4 |
| 537 | Find Greatest Common Divisor of 20 and 15, using prime factorization. | 4 |
| 538 | Find Greatest Common Divisor of 3, 4 and 3, using prime factorization. | 4 |
| 539 | Find Greatest Common Divisor of 26 and 9, using prime factorization. | 4 |
| 540 | Find Greatest Common Divisor of 1602. | 4 |
| 541 | Find Greatest Common Divisor of 1602. | 4 |
| 542 | Find Greatest Common Divisor of 10 and 3, using Euclidean algorithm. | 4 |
| 543 | Find Greatest Common Divisor of 24 and 48, by listing out the factors. | 4 |
| 544 | Find Greatest Common Divisor of 1000, 500, 0, 500 and 1000, using prime factorization. | 4 |
| 545 | Find Greatest Common Divisor of 414 and 1035, using prime factorization. | 4 |
| 546 | Find Greatest Common Divisor of 270 and 192, using prime factorization. | 4 |
| 547 | Find Greatest Common Divisor of 1000 and 750, using prime factorization. | 4 |
| 548 | Find Greatest Common Divisor of 17 and 6, using Euclidean algorithm. | 4 |
| 549 | Find Greatest Common Divisor of 20 and 2, using prime factorization. | 4 |
| 550 | Find Greatest Common Divisor of 20 and 3, using prime factorization. | 4 |
