GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6451 | Find Greatest Common Divisor of 15 and 20, using Euclidean algorithm. | 1 |
| 6452 | Find Greatest Common Divisor of 15 and 33, using Euclidean algorithm. | 1 |
| 6453 | Find Greatest Common Divisor of 15 and 36, using Euclidean algorithm. | 1 |
| 6454 | Find Greatest Common Divisor of 15 and 46, using Euclidean algorithm. | 1 |
| 6455 | Find Greatest Common Divisor of 15 and 8, using Euclidean algorithm. | 1 |
| 6456 | Find Greatest Common Divisor of 15 and 22, using Euclidean algorithm. | 1 |
| 6457 | Find Greatest Common Divisor of 15 and 23, using Euclidean algorithm. | 1 |
| 6458 | Find Greatest Common Divisor of 15 and 24, using Euclidean algorithm. | 1 |
| 6459 | Find Greatest Common Divisor of 15 and 25, using Euclidean algorithm. | 1 |
| 6460 | Find Greatest Common Divisor of 15 and 26, using Euclidean algorithm. | 1 |
| 6461 | Find Greatest Common Divisor of 15 and 27, using Euclidean algorithm. | 1 |
| 6462 | Find Greatest Common Divisor of 10 and 21, using Euclidean algorithm. | 1 |
| 6463 | Find Greatest Common Divisor of 10 and 22, using Euclidean algorithm. | 1 |
| 6464 | Find Greatest Common Divisor of 10 and 23, using Euclidean algorithm. | 1 |
| 6465 | Find Greatest Common Divisor of 10 and 24, using Euclidean algorithm. | 1 |
| 6466 | Find Greatest Common Divisor of 10 and 26, using Euclidean algorithm. | 1 |
| 6467 | Find Greatest Common Divisor of 10 and 27, using Euclidean algorithm. | 1 |
| 6468 | Find Greatest Common Divisor of 10 and 28, using Euclidean algorithm. | 1 |
| 6469 | Find Greatest Common Divisor of 11 and 20, using Euclidean algorithm. | 1 |
| 6470 | Find Greatest Common Divisor of 11 and 28, using Euclidean algorithm. | 1 |
| 6471 | Find Greatest Common Divisor of 210, 385 and 560, using Euclidean algorithm. | 1 |
| 6472 | Find Greatest Common Divisor of 210 and 385, using Euclidean algorithm. | 1 |
| 6473 | Find Greatest Common Divisor of 2375 and 362, using prime factorization. | 1 |
| 6474 | Find Greatest Common Divisor of 87 and 30, using prime factorization. | 1 |
| 6475 | Find Greatest Common Divisor of 87 and 30, using Euclidean algorithm. | 1 |
| 6476 | Find Greatest Common Divisor of 12, 34 and 18, using prime factorization. | 1 |
| 6477 | Find Greatest Common Divisor of 10 and 0, using prime factorization. | 1 |
| 6478 | Find Greatest Common Divisor of 10503 and 1, using prime factorization. | 1 |
| 6479 | Find Greatest Common Divisor of 1 and 34, using prime factorization. | 1 |
| 6480 | Find Greatest Common Divisor of 463 and 786, using prime factorization. | 1 |
| 6481 | Find Greatest Common Divisor of 464 and 787, using prime factorization. | 1 |
| 6482 | Find Greatest Common Divisor of 464 and 786, using prime factorization. | 1 |
| 6483 | Find Greatest Common Divisor of 69 and 372, using prime factorization. | 1 |
| 6484 | Find Greatest Common Divisor of 180 and 96, using prime factorization. | 1 |
| 6485 | Find Greatest Common Divisor of 25 and 65, using prime factorization. | 1 |
| 6486 | Find Greatest Common Divisor of 48 and 56, using prime factorization. | 1 |
| 6487 | Find Greatest Common Divisor of 321 and 427, using prime factorization. | 1 |
| 6488 | Find Greatest Common Divisor of 894 and 8888, using prime factorization. | 1 |
| 6489 | Find Greatest Common Divisor of 11, 17, 5 and 10, using prime factorization. | 1 |
| 6490 | Find Greatest Common Divisor of 790 and 380, using Euclidean algorithm. | 1 |
| 6491 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, by listing out the factors. | 1 |
| 6492 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using repeated division. | 1 |
| 6493 | Find Greatest Common Divisor of 334 and 233, using Euclidean algorithm. | 1 |
| 6494 | Find Greatest Common Divisor of 889 and 246, using repeated division. | 1 |
| 6495 | Find Greatest Common Divisor of 230 and 136, using Euclidean algorithm. | 1 |
| 6496 | Find Greatest Common Divisor of 279 and 250, using Euclidean algorithm. | 1 |
| 6497 | Find Greatest Common Divisor of 77 and 40, using prime factorization. | 1 |
| 6498 | Find Greatest Common Divisor of 1597 and 5702887, using Euclidean algorithm. | 1 |
| 6499 | Find Greatest Common Divisor of 30, 50 and 45, using prime factorization. | 1 |
| 6500 | Find Greatest Common Divisor of 495. | 1 |
