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 681 and 43, using prime factorization. | 1 |
| 3452 | Find Greatest Common Divisor of 681 and 43, using Euclidean algorithm. | 1 |
| 3453 | Find Greatest Common Divisor of 10672 and 4147, by listing out the factors. | 1 |
| 3454 | Find Greatest Common Divisor of 12 and 42, using prime factorization. | 1 |
| 3455 | Find Greatest Common Divisor of 1610 and 667, using Euclidean algorithm. | 1 |
| 3456 | Find Greatest Common Divisor of 115 and 46, using Euclidean algorithm. | 1 |
| 3457 | Find Greatest Common Divisor of 250, 148 and 316, using prime factorization. | 1 |
| 3458 | Find Greatest Common Divisor of 524 and 148, using prime factorization. | 1 |
| 3459 | Find Greatest Common Divisor of 630 and 1260, using repeated division. | 1 |
| 3460 | Find Greatest Common Divisor of 324, 378 and 1890, using repeated division. | 1 |
| 3461 | Find Greatest Common Divisor of 115 and 644, using repeated division. | 1 |
| 3462 | Find Greatest Common Divisor of 216 and 234, using Euclidean algorithm. | 1 |
| 3463 | Find Greatest Common Divisor of 84 and 36, using prime factorization. | 1 |
| 3464 | Find Greatest Common Divisor of 1794 and 2346, using prime factorization. | 1 |
| 3465 | Find Greatest Common Divisor of 557 and 239, using Euclidean algorithm. | 1 |
| 3466 | Find Greatest Common Divisor of 11, 3, 7 and 2, using prime factorization. | 1 |
| 3467 | Find Greatest Common Divisor of 29106 and 5382, using Euclidean algorithm. | 1 |
| 3468 | Find Greatest Common Divisor of 26 and 39, using prime factorization. | 1 |
| 3469 | Find Greatest Common Divisor of 28260 and 5148, using Euclidean algorithm. | 1 |
| 3470 | Find Greatest Common Divisor of 28539 and 5088, using Euclidean algorithm. | 1 |
| 3471 | Find Greatest Common Divisor of 13 and 3, using Euclidean algorithm. | 1 |
| 3472 | Find Greatest Common Divisor of 18 and 6, using Euclidean algorithm. | 1 |
| 3473 | Find Greatest Common Divisor of 4 and 20, by listing out the factors. | 1 |
| 3474 | Find Greatest Common Divisor of 317 and 525, using prime factorization. | 1 |
| 3475 | Find Greatest Common Divisor of 289 and 377, using Euclidean algorithm. | 1 |
| 3476 | Find Greatest Common Divisor of 750, 242 and 9, using prime factorization. | 1 |
| 3477 | Find Greatest Common Divisor of 1 and 1, using prime factorization. | 1 |
| 3478 | Find Greatest Common Divisor of 25 and 17, using Euclidean algorithm. | 1 |
| 3479 | Find Greatest Common Divisor of 9800, 420 and 2520, by listing out the factors. | 1 |
| 3480 | Find Greatest Common Divisor of 18, 12 and 24, using repeated division. | 1 |
| 3481 | Find Greatest Common Divisor of 8925 and 76576500, using prime factorization. | 1 |
| 3482 | Find Greatest Common Divisor of 169, 28, 16, 8, 160, 28, 292, 108, 56, 68, 72, 28, 124, 52 and 264, using prime factorization. | 1 |
| 3483 | Find Greatest Common Divisor of 35, 88, 16, 260, 92, 140, 100, 80, 80 and 344, using prime factorization. | 1 |
| 3484 | Find Greatest Common Divisor of 314 and 159, using Euclidean algorithm. | 1 |
| 3485 | Find Greatest Common Divisor of 504 and 295, using Euclidean algorithm. | 1 |
| 3486 | Find Greatest Common Divisor of 3 and 11, using Euclidean algorithm. | 1 |
| 3487 | Find Greatest Common Divisor of 11 and 3, using Euclidean algorithm. | 1 |
| 3488 | Find Greatest Common Divisor of 97 and 7000, by listing out the factors. | 1 |
| 3489 | Find Greatest Common Divisor of 37, 13 and 11, using prime factorization. | 1 |
| 3490 | Find Greatest Common Divisor of 56 and 128, using prime factorization. | 1 |
| 3491 | Find Greatest Common Divisor of 123 and 321, using prime factorization. | 1 |
| 3492 | Find Greatest Common Divisor of 406 and 945, by listing out the factors. | 1 |
| 3493 | Find Greatest Common Divisor of 170 and 122, using Euclidean algorithm. | 1 |
| 3494 | Find Greatest Common Divisor of 170 and 122, using prime factorization. | 1 |
| 3495 | Find Greatest Common Divisor of 12378 and 467, using prime factorization. | 1 |
| 3496 | Find Greatest Common Divisor of 1110 and 0, using prime factorization. | 1 |
| 3497 | Find Greatest Common Divisor of 57 and 0, using Euclidean algorithm. | 1 |
| 3498 | Find Greatest Common Divisor of 36542 and 22022, using prime factorization. | 1 |
| 3499 | Find Greatest Common Divisor of 147 and 70, using prime factorization. | 1 |
| 3500 | Find Greatest Common Divisor of 10 and 409, using prime factorization. | 1 |
