GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6501 | Find Greatest Common Divisor of 10497600 and 4840, using prime factorization. | 1 |
| 6502 | Find Greatest Common Divisor of 587 and 345, using prime factorization. | 1 |
| 6503 | Find Greatest Common Divisor of 587 and 345, using Euclidean algorithm. | 1 |
| 6504 | Find Greatest Common Divisor of 288 and 29, using Euclidean algorithm. | 1 |
| 6505 | Find Greatest Common Divisor of 3672 and 595, using prime factorization. | 1 |
| 6506 | Find Greatest Common Divisor of 412 and 88, using prime factorization. | 1 |
| 6507 | Find Greatest Common Divisor of 1100 and 4231, using Euclidean algorithm. | 1 |
| 6508 | Find Greatest Common Divisor of 80 and 340, using prime factorization. | 1 |
| 6509 | Find Greatest Common Divisor of 5 and 12, using prime factorization. | 1 |
| 6510 | Find Greatest Common Divisor of 410, 1394 and 3034, using prime factorization. | 1 |
| 6511 | Find Greatest Common Divisor of 20 and 32, using Euclidean algorithm. | 1 |
| 6512 | Find Greatest Common Divisor of 16 and 35, using repeated division. | 1 |
| 6513 | Find Greatest Common Divisor of 16 and 35, by listing out the factors. | 1 |
| 6514 | Find Greatest Common Divisor of 114 and 522, using prime factorization. | 1 |
| 6515 | Find Greatest Common Divisor of 11, 7, 3 and 2, using prime factorization. | 1 |
| 6516 | Find Greatest Common Divisor of 10 and 2520, using Euclidean algorithm. | 1 |
| 6517 | Find Greatest Common Divisor of 8, 32 and 64, using prime factorization. | 1 |
| 6518 | Find Greatest Common Divisor of 8, 32 and 64, using repeated division. | 1 |
| 6519 | Find Greatest Common Divisor of 32, 56 and 78, using prime factorization. | 1 |
| 6520 | Find Greatest Common Divisor of 24, 12 and 36, using repeated division. | 1 |
| 6521 | Find Greatest Common Divisor of 334. | 1 |
| 6522 | Find Greatest Common Divisor of 12327 and 2409, using prime factorization. | 1 |
| 6523 | Find Greatest Common Divisor of 75 and 405, using prime factorization. | 1 |
| 6524 | Find Greatest Common Divisor of 7 and 16, using prime factorization. | 1 |
| 6525 | Find Greatest Common Divisor of 248625 and 415822, using prime factorization. | 1 |
| 6526 | Find Greatest Common Divisor of 295822 and 128625, using prime factorization. | 1 |
| 6527 | Find Greatest Common Divisor of 2486625522 and 41582215163, using Euclidean algorithm. | 1 |
| 6528 | Find Greatest Common Divisor of 248662 and 415822, by listing out the factors. | 1 |
| 6529 | Find Greatest Common Divisor of 248657 and 415822, using repeated division. | 1 |
| 6530 | Find Greatest Common Divisor of 2189 and 121, using Euclidean algorithm. | 1 |
| 6531 | Find Greatest Common Divisor of 1911 and 825, using Euclidean algorithm. | 1 |
| 6532 | Find Greatest Common Divisor of 1911 and 825, using prime factorization. | 1 |
| 6533 | Find Greatest Common Divisor of 4, 5, 7, 5, 11 and 25, using prime factorization. | 1 |
| 6534 | Find Greatest Common Divisor of 9 and 35000, using prime factorization. | 1 |
| 6535 | Find Greatest Common Divisor of 4, 0 and 808, using prime factorization. | 1 |
| 6536 | Find Greatest Common Divisor of 1760 and 2080, using prime factorization. | 1 |
| 6537 | Find Greatest Common Divisor of 10 and 4, using Euclidean algorithm. | 1 |
| 6538 | Find Greatest Common Divisor of 12 and 33, using Euclidean algorithm. | 1 |
| 6539 | Find Greatest Common Divisor of 388, 576 and 7164, using Euclidean algorithm. | 1 |
| 6540 | Find Greatest Common Divisor of 388, 576 and 7164, by listing out the factors. | 1 |
| 6541 | Find Greatest Common Divisor of 101 and 3267, using prime factorization. | 1 |
| 6542 | Find Greatest Common Divisor of 101 and 3267, using repeated division. | 1 |
| 6543 | Find Greatest Common Divisor of 4378 and 2722, using prime factorization. | 1 |
| 6544 | Find Greatest Common Divisor of 42 and 154, using prime factorization. | 1 |
| 6545 | Find Greatest Common Divisor of 2722 and 2462, using prime factorization. | 1 |
| 6546 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using prime factorization. | 1 |
| 6547 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using Euclidean algorithm. | 1 |
| 6548 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using repeated division. | 1 |
| 6549 | Find Greatest Common Divisor of 1235 and 765, by listing out the factors. | 1 |
| 6550 | Find Greatest Common Divisor of 1 and 60, using prime factorization. | 1 |
