GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3451 | Find Greatest Common Divisor of 25, 125, 2 and 2, using prime factorization. | 2 |
| 3452 | Find Greatest Common Divisor of 356 and 13, using Euclidean algorithm. | 2 |
| 3453 | Find Greatest Common Divisor of 30 and 25, using prime factorization. | 2 |
| 3454 | Find Greatest Common Divisor of 1701 and 400, using Euclidean algorithm. | 2 |
| 3455 | Find Greatest Common Divisor of 85 and 136, using prime factorization. | 2 |
| 3456 | Find Greatest Common Divisor of 65 and 104, using prime factorization. | 2 |
| 3457 | Find Greatest Common Divisor of 67, 653, 577, 567, 441, 417, 457, 378, 306, 558 and 387, using prime factorization. | 2 |
| 3458 | Find Greatest Common Divisor of 24 and 168, using prime factorization. | 2 |
| 3459 | Find Greatest Common Divisor of 87 and 145, using prime factorization. | 2 |
| 3460 | Find Greatest Common Divisor of 3, 3, 2, 3, 2, 2, 5 and 6, using Euclidean algorithm. | 2 |
| 3461 | Find Greatest Common Divisor of 192 and 7, using Euclidean algorithm. | 2 |
| 3462 | Find Greatest Common Divisor of 2 and 63, using prime factorization. | 2 |
| 3463 | Find Greatest Common Divisor of 630 and 30, using prime factorization. | 2 |
| 3464 | Find Greatest Common Divisor of 1 and 37, using prime factorization. | 2 |
| 3465 | Find Greatest Common Divisor of 2 and 37, using prime factorization. | 2 |
| 3466 | Find Greatest Common Divisor of 124 and 136, using prime factorization. | 2 |
| 3467 | Find Greatest Common Divisor of 1758 and 337, using Euclidean algorithm. | 2 |
| 3468 | Find Greatest Common Divisor of 443 and 269, using Euclidean algorithm. | 2 |
| 3469 | Find Greatest Common Divisor of 20 and 16, using Euclidean algorithm. | 2 |
| 3470 | Find Greatest Common Divisor of 132 and 209, using Euclidean algorithm. | 2 |
| 3471 | Find Greatest Common Divisor of 84 and 343, using prime factorization. | 2 |
| 3472 | Find Greatest Common Divisor of 150 and 51, using Euclidean algorithm. | 2 |
| 3473 | Find Greatest Common Divisor of 26 and 84, using prime factorization. | 2 |
| 3474 | Find Greatest Common Divisor of 5231 and 5232, using prime factorization. | 2 |
| 3475 | Find Greatest Common Divisor of 8602, 10353 and 2618, using prime factorization. | 2 |
| 3476 | Find Greatest Common Divisor of 956, 988, 3063, 981, 1897, 1013, 1963 and 1966, by listing out the factors. | 2 |
| 3477 | Find Greatest Common Divisor of 256 and 1259, using prime factorization. | 2 |
| 3478 | Find Greatest Common Divisor of 1 and 889079, using Euclidean algorithm. | 2 |
| 3479 | Find Greatest Common Divisor of 64 and 889079, using Euclidean algorithm. | 2 |
| 3480 | Find Greatest Common Divisor of 3587 and 59, using prime factorization. | 2 |
| 3481 | Find Greatest Common Divisor of 3587 and 591, using prime factorization. | 2 |
| 3482 | Find Greatest Common Divisor of 3587 and 593, using prime factorization. | 2 |
| 3483 | Find Greatest Common Divisor of 3587 and 695, using prime factorization. | 2 |
| 3484 | Find Greatest Common Divisor of 3587 and 697, using prime factorization. | 2 |
| 3485 | Find Greatest Common Divisor of 3599 and 697, using prime factorization. | 2 |
| 3486 | Find Greatest Common Divisor of 3499 and 697, using Euclidean algorithm. | 2 |
| 3487 | Find Greatest Common Divisor of 5981 and 697, using Euclidean algorithm. | 2 |
| 3488 | Find Greatest Common Divisor of 5981 and 732, using Euclidean algorithm. | 2 |
| 3489 | Find Greatest Common Divisor of 6183 and 1518, using Euclidean algorithm. | 2 |
| 3490 | Find Greatest Common Divisor of 8974 and 1518, using Euclidean algorithm. | 2 |
| 3491 | Find Greatest Common Divisor of 8429 and 1518, using Euclidean algorithm. | 2 |
| 3492 | Find Greatest Common Divisor of 8428 and 1518, using Euclidean algorithm. | 2 |
| 3493 | Find Greatest Common Divisor of 7268 and 1518, using Euclidean algorithm. | 2 |
| 3494 | Find Greatest Common Divisor of 7266 and 1518, using Euclidean algorithm. | 2 |
| 3495 | Find Greatest Common Divisor of 10050 and 24000, using prime factorization. | 2 |
| 3496 | Find Greatest Common Divisor of 1479 and 377, using Euclidean algorithm. | 2 |
| 3497 | Find Greatest Common Divisor of 1133904590 and 4294967297, using prime factorization. | 2 |
| 3498 | Find Greatest Common Divisor of 59280 and 4294967297, using prime factorization. | 2 |
| 3499 | Find Greatest Common Divisor of 59052 and 4294967297, using prime factorization. | 2 |
| 3500 | Find Greatest Common Divisor of 3515956305 and 4294967297, using prime factorization. | 2 |