GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4401 | Find Greatest Common Divisor of 7268 and 1518, using Euclidean algorithm. | 2 |
| 4402 | Find Greatest Common Divisor of 7266 and 1518, using Euclidean algorithm. | 2 |
| 4403 | Find Greatest Common Divisor of 10050 and 24000, using prime factorization. | 2 |
| 4404 | Find Greatest Common Divisor of 1479 and 377, using Euclidean algorithm. | 2 |
| 4405 | Find Greatest Common Divisor of 1133904590 and 4294967297, using prime factorization. | 2 |
| 4406 | Find Greatest Common Divisor of 59280 and 4294967297, using prime factorization. | 2 |
| 4407 | Find Greatest Common Divisor of 59052 and 4294967297, using prime factorization. | 2 |
| 4408 | Find Greatest Common Divisor of 3515956305 and 4294967297, using prime factorization. | 2 |
| 4409 | Find Greatest Common Divisor of 3515956308 and 4294967297, using prime factorization. | 2 |
| 4410 | Find Greatest Common Divisor of 3515956080 and 4294967297, using prime factorization. | 2 |
| 4411 | Find Greatest Common Divisor of 1114067873 and 4294967297, using prime factorization. | 2 |
| 4412 | Find Greatest Common Divisor of 2401888435 and 4294967297, using prime factorization. | 2 |
| 4413 | Find Greatest Common Divisor of 210, 385 and 560, using Euclidean algorithm. | 1 |
| 4414 | Find Greatest Common Divisor of 210 and 385, using Euclidean algorithm. | 1 |
| 4415 | Find Greatest Common Divisor of 2375 and 362, using prime factorization. | 1 |
| 4416 | Find Greatest Common Divisor of 87 and 30, using prime factorization. | 1 |
| 4417 | Find Greatest Common Divisor of 87 and 30, using Euclidean algorithm. | 1 |
| 4418 | Find Greatest Common Divisor of 12, 34 and 18, using prime factorization. | 1 |
| 4419 | Find Greatest Common Divisor of 10 and 0, using prime factorization. | 1 |
| 4420 | Find Greatest Common Divisor of 10503 and 1, using prime factorization. | 1 |
| 4421 | Find Greatest Common Divisor of 1 and 34, using prime factorization. | 1 |
| 4422 | Find Greatest Common Divisor of 463 and 786, using prime factorization. | 1 |
| 4423 | Find Greatest Common Divisor of 464 and 787, using prime factorization. | 1 |
| 4424 | Find Greatest Common Divisor of 464 and 786, using prime factorization. | 1 |
| 4425 | Find Greatest Common Divisor of 69 and 372, using prime factorization. | 1 |
| 4426 | Find Greatest Common Divisor of 180 and 96, using prime factorization. | 1 |
| 4427 | Find Greatest Common Divisor of 25 and 65, using prime factorization. | 1 |
| 4428 | Find Greatest Common Divisor of 48 and 56, using prime factorization. | 1 |
| 4429 | Find Greatest Common Divisor of 321 and 427, using prime factorization. | 1 |
| 4430 | Find Greatest Common Divisor of 894 and 8888, using prime factorization. | 1 |
| 4431 | Find Greatest Common Divisor of 11, 17, 5 and 10, using prime factorization. | 1 |
| 4432 | Find Greatest Common Divisor of 790 and 380, using Euclidean algorithm. | 1 |
| 4433 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, by listing out the factors. | 1 |
| 4434 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using repeated division. | 1 |
| 4435 | Find Greatest Common Divisor of 334 and 233, using Euclidean algorithm. | 1 |
| 4436 | Find Greatest Common Divisor of 889 and 246, using repeated division. | 1 |
| 4437 | Find Greatest Common Divisor of 230 and 136, using Euclidean algorithm. | 1 |
| 4438 | Find Greatest Common Divisor of 279 and 250, using Euclidean algorithm. | 1 |
| 4439 | Find Greatest Common Divisor of 77 and 40, using prime factorization. | 1 |
| 4440 | Find Greatest Common Divisor of 1597 and 5702887, using Euclidean algorithm. | 1 |
| 4441 | Find Greatest Common Divisor of 30, 50 and 45, using prime factorization. | 1 |
| 4442 | Find Greatest Common Divisor of 495. | 1 |
| 4443 | Find Greatest Common Divisor of 10497600 and 4840, using prime factorization. | 1 |
| 4444 | Find Greatest Common Divisor of 587 and 345, using prime factorization. | 1 |
| 4445 | Find Greatest Common Divisor of 587 and 345, using Euclidean algorithm. | 1 |
| 4446 | Find Greatest Common Divisor of 288 and 29, using Euclidean algorithm. | 1 |
| 4447 | Find Greatest Common Divisor of 3672 and 595, using prime factorization. | 1 |
| 4448 | Find Greatest Common Divisor of 412 and 88, using prime factorization. | 1 |
| 4449 | Find Greatest Common Divisor of 1100 and 4231, using Euclidean algorithm. | 1 |
| 4450 | Find Greatest Common Divisor of 80 and 340, using prime factorization. | 1 |
