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 26513 and 32321, using Euclidean algorithm. | 2 |
| 4452 | Find Greatest Common Divisor of 415 and 142, using Euclidean algorithm. | 2 |
| 4453 | Find Greatest Common Divisor of 471 and 562, using Euclidean algorithm. | 2 |
| 4454 | Find Greatest Common Divisor of 295 and 504, using Euclidean algorithm. | 2 |
| 4455 | Find Greatest Common Divisor of 387 and 129, using Euclidean algorithm. | 2 |
| 4456 | Find Greatest Common Divisor of 359 and 125, using prime factorization. | 2 |
| 4457 | Find Greatest Common Divisor of 1320 and 1065, using prime factorization. | 2 |
| 4458 | Find Greatest Common Divisor of 24 and 15, using Euclidean algorithm. | 2 |
| 4459 | Find Greatest Common Divisor of 17 and 11, using prime factorization. | 2 |
| 4460 | Find Greatest Common Divisor of 147 and 288, using prime factorization. | 2 |
| 4461 | Find Greatest Common Divisor of 147 and 288, using repeated division. | 2 |
| 4462 | Find Greatest Common Divisor of 689 and 489, using prime factorization. | 2 |
| 4463 | Find Greatest Common Divisor of 249 and 147, using prime factorization. | 2 |
| 4464 | Find Greatest Common Divisor of 39 and 162, using prime factorization. | 2 |
| 4465 | Find Greatest Common Divisor of 39 and 162, using Euclidean algorithm. | 2 |
| 4466 | Find Greatest Common Divisor of 6120 and 3000, using Euclidean algorithm. | 2 |
| 4467 | Find Greatest Common Divisor of 725 and 236, using Euclidean algorithm. | 2 |
| 4468 | Find Greatest Common Divisor of 3578 and 9512, using repeated division. | 2 |
| 4469 | Find Greatest Common Divisor of 366 and 36, using prime factorization. | 2 |
| 4470 | Find Greatest Common Divisor of 366 and 36, using Euclidean algorithm. | 2 |
| 4471 | Find Greatest Common Divisor of 100 and 321, using prime factorization. | 2 |
| 4472 | Find Greatest Common Divisor of 27 and 100, using prime factorization. | 2 |
| 4473 | Find Greatest Common Divisor of 1007 and 97000000, using prime factorization. | 2 |
| 4474 | Find Greatest Common Divisor of 5140998993 and 97000000, using prime factorization. | 2 |
| 4475 | Find Greatest Common Divisor of 70 and 120, using prime factorization. | 2 |
| 4476 | Find Greatest Common Divisor of 70 and 120, using repeated division. | 2 |
| 4477 | Find Greatest Common Divisor of 168 and 504, using repeated division. | 2 |
| 4478 | Find Greatest Common Divisor of 180 and 600, using Euclidean algorithm. | 2 |
| 4479 | Find Greatest Common Divisor of 60 and 84, using Euclidean algorithm. | 2 |
| 4480 | Find Greatest Common Divisor of 234 and 470, using Euclidean algorithm. | 2 |
| 4481 | Find Greatest Common Divisor of 84 and 180, using Euclidean algorithm. | 2 |
| 4482 | Find Greatest Common Divisor of 64 and 160, using Euclidean algorithm. | 2 |
| 4483 | Find Greatest Common Divisor of 308 and 504, using Euclidean algorithm. | 2 |
| 4484 | Find Greatest Common Divisor of 1890 and 45, using Euclidean algorithm. | 2 |
| 4485 | Find Greatest Common Divisor of 1890 and 450, using Euclidean algorithm. | 2 |
| 4486 | Find Greatest Common Divisor of 696 and 432, using Euclidean algorithm. | 2 |
| 4487 | Find Greatest Common Divisor of 105 and 231, using Euclidean algorithm. | 2 |
| 4488 | Find Greatest Common Divisor of 273 and 595, using Euclidean algorithm. | 2 |
| 4489 | Find Greatest Common Divisor of 18 and 50, using prime factorization. | 2 |
| 4490 | Find Greatest Common Divisor of 93 and 22, using prime factorization. | 2 |
| 4491 | Find Greatest Common Divisor of 39 and 22, using prime factorization. | 2 |
| 4492 | Find Greatest Common Divisor of 99 and 40, using prime factorization. | 2 |
| 4493 | Find Greatest Common Divisor of 6, 9 and 12, using prime factorization. | 2 |
| 4494 | Find Greatest Common Divisor of 14400 and 5040, using prime factorization. | 2 |
| 4495 | Find Greatest Common Divisor of 54321 and 12345, using prime factorization. | 2 |
| 4496 | Find Greatest Common Divisor of 54321 and 12345, using Euclidean algorithm. | 2 |
| 4497 | Find Greatest Common Divisor of 5, 6 and 92, using prime factorization. | 2 |
| 4498 | Find Greatest Common Divisor of 398 and 294, using prime factorization. | 2 |
| 4499 | Find Greatest Common Divisor of 398 and 294, using Euclidean algorithm. | 2 |
| 4500 | Find Greatest Common Divisor of 976 and 174, using prime factorization. | 2 |