GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4451 | Find Greatest Common Divisor of 99 and 40, using prime factorization. | 2 |
| 4452 | Find Greatest Common Divisor of 14400 and 5040, using prime factorization. | 2 |
| 4453 | Find Greatest Common Divisor of 54321 and 12345, using prime factorization. | 2 |
| 4454 | Find Greatest Common Divisor of 54321 and 12345, using Euclidean algorithm. | 2 |
| 4455 | Find Greatest Common Divisor of 5, 6 and 92, using prime factorization. | 2 |
| 4456 | Find Greatest Common Divisor of 398 and 294, using prime factorization. | 2 |
| 4457 | Find Greatest Common Divisor of 398 and 294, using Euclidean algorithm. | 2 |
| 4458 | Find Greatest Common Divisor of 976 and 174, using prime factorization. | 2 |
| 4459 | Find Greatest Common Divisor of 4655 and 12075, using prime factorization. | 2 |
| 4460 | Find Greatest Common Divisor of 4655 and 12075, using repeated division. | 2 |
| 4461 | Find Greatest Common Divisor of 4, 21 and 60, using prime factorization. | 2 |
| 4462 | Find Greatest Common Divisor of 15 and 22, using prime factorization. | 2 |
| 4463 | Find Greatest Common Divisor of 20, 15 and 5, using prime factorization. | 2 |
| 4464 | Find Greatest Common Divisor of 3, 6 and 7, using prime factorization. | 2 |
| 4465 | Find Greatest Common Divisor of 345 and 369, using prime factorization. | 2 |
| 4466 | Find Greatest Common Divisor of 369 and 345, using repeated division. | 2 |
| 4467 | Find Greatest Common Divisor of 369 and 345, using Euclidean algorithm. | 2 |
| 4468 | Find Greatest Common Divisor of 1 and 100, using Euclidean algorithm. | 2 |
| 4469 | Find Greatest Common Divisor of 9, 15 and 12, using prime factorization. | 2 |
| 4470 | Find Greatest Common Divisor of 8217949832 and 8181353375, using prime factorization. | 2 |
| 4471 | Find Greatest Common Divisor of 290184 and 351, using prime factorization. | 2 |
| 4472 | Find Greatest Common Divisor of 1111 and 11, using Euclidean algorithm. | 2 |
| 4473 | Find Greatest Common Divisor of 12, 116, 56 and 764, using prime factorization. | 2 |
| 4474 | Find Greatest Common Divisor of 13, 7 and 72, using prime factorization. | 2 |
| 4475 | Find Greatest Common Divisor of 12870 and 2618, using Euclidean algorithm. | 2 |
| 4476 | Find Greatest Common Divisor of 91 and 287, using prime factorization. | 2 |
| 4477 | Find Greatest Common Divisor of 12, 21 and 28, using prime factorization. | 2 |
| 4478 | Find Greatest Common Divisor of 15, 18 and 16, using prime factorization. | 2 |
| 4479 | Find Greatest Common Divisor of 102 and 222, using Euclidean algorithm. | 2 |
| 4480 | Find Greatest Common Divisor of 2048 and 100124, using repeated division. | 2 |
| 4481 | Find Greatest Common Divisor of 72 and 54, using prime factorization. | 2 |
| 4482 | Find Greatest Common Divisor of 18, 45 and 60, using prime factorization. | 2 |
| 4483 | Find Greatest Common Divisor of 712. | 2 |
| 4484 | Find Greatest Common Divisor of 111 and 1986, using prime factorization. | 2 |
| 4485 | Find Greatest Common Divisor of 19 and 141, using prime factorization. | 2 |
| 4486 | Find Greatest Common Divisor of 390 and 720, using Euclidean algorithm. | 2 |
| 4487 | Find Greatest Common Divisor of 289 and 160, using prime factorization. | 2 |
| 4488 | Find Greatest Common Divisor of 31256 and 4788, using Euclidean algorithm. | 2 |
| 4489 | Find Greatest Common Divisor of 1, 2 and 3, using Euclidean algorithm. | 2 |
| 4490 | Find Greatest Common Divisor of 252 and 180, using prime factorization. | 2 |
| 4491 | Find Greatest Common Divisor of 60 and 45, using prime factorization. | 2 |
| 4492 | Find Greatest Common Divisor of 64, 48 and 16, using prime factorization. | 2 |
| 4493 | Find Greatest Common Divisor of 5, 15 and 25, by listing out the factors. | 2 |
| 4494 | Find Greatest Common Divisor of 860 and 240, using Euclidean algorithm. | 2 |
| 4495 | Find Greatest Common Divisor of 23 and 67, using prime factorization. | 2 |
| 4496 | Find Greatest Common Divisor of 180 and 192, using repeated division. | 2 |
| 4497 | Find Greatest Common Divisor of 180 and 192, using Euclidean algorithm. | 2 |
| 4498 | Find Greatest Common Divisor of 180 and 192, by listing out the factors. | 2 |
| 4499 | Find Greatest Common Divisor of 11 and 24, using Euclidean algorithm. | 2 |
| 4500 | Find Greatest Common Divisor of 9, 2, 2, 9, 2 and 2, using Euclidean algorithm. | 2 |