GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3651 | Find Greatest Common Divisor of 4, 3, 8, 2, 20, 24, 2, 3, 18, 2, 46 and 30, using prime factorization. | 1 |
| 3652 | Find Greatest Common Divisor of 49 and 620, using Euclidean algorithm. | 1 |
| 3653 | Find Greatest Common Divisor of 91 and 267, using Euclidean algorithm. | 1 |
| 3654 | Find Greatest Common Divisor of 18, 12 and 24, using prime factorization. | 1 |
| 3655 | Find Greatest Common Divisor of 3 and 26, using Euclidean algorithm. | 1 |
| 3656 | Find Greatest Common Divisor of 60 and 17, using Euclidean algorithm. | 1 |
| 3657 | Find Greatest Common Divisor of 23 and 18, using prime factorization. | 1 |
| 3658 | Find Greatest Common Divisor of 8496 and 5234, using Euclidean algorithm. | 1 |
| 3659 | Find Greatest Common Divisor of 239 and 5, using Euclidean algorithm. | 1 |
| 3660 | Find Greatest Common Divisor of 3567986 and 61063, using prime factorization. | 1 |
| 3661 | Find Greatest Common Divisor of 30 and 8, using Euclidean algorithm. | 1 |
| 3662 | Find Greatest Common Divisor of 311 and 1679, using prime factorization. | 1 |
| 3663 | Find Greatest Common Divisor of 97 and 256, using prime factorization. | 1 |
| 3664 | Find Greatest Common Divisor of 10, 20, 6 and 30, using prime factorization. | 1 |
| 3665 | Find Greatest Common Divisor of 2024 and 1054, using prime factorization. | 1 |
| 3666 | Find Greatest Common Divisor of 2024 and 1054, using Euclidean algorithm. | 1 |
| 3667 | Find Greatest Common Divisor of 252 and 356, using Euclidean algorithm. | 1 |
| 3668 | Find Greatest Common Divisor of 1219936 and 642401, using prime factorization. | 1 |
| 3669 | Find Greatest Common Divisor of 2, 100, 1, 2, 91 and 1, using Euclidean algorithm. | 1 |
| 3670 | Find Greatest Common Divisor of 56 and 7, using prime factorization. | 1 |
| 3671 | Find Greatest Common Divisor of 32 and 72, using repeated division. | 1 |
| 3672 | Find Greatest Common Divisor of 11 and 72, using prime factorization. | 1 |
| 3673 | Find Greatest Common Divisor of 24, 60 and 45, using prime factorization. | 1 |
| 3674 | Find Greatest Common Divisor of 1001 and 11, using Euclidean algorithm. | 1 |
| 3675 | Find Greatest Common Divisor of 663 and 5168, using Euclidean algorithm. | 1 |
| 3676 | Find Greatest Common Divisor of 2468 and 1357, using Euclidean algorithm. | 1 |
| 3677 | Find Greatest Common Divisor of 733103 and 91637, using Euclidean algorithm. | 1 |
| 3678 | Find Greatest Common Divisor of 17 and 3233, using Euclidean algorithm. | 1 |
| 3679 | Find Greatest Common Divisor of 360 and 48, using Euclidean algorithm. | 1 |
| 3680 | Find Greatest Common Divisor of 360 and 483, using Euclidean algorithm. | 1 |
| 3681 | Find Greatest Common Divisor of 1258 and 527, using Euclidean algorithm. | 1 |
| 3682 | Find Greatest Common Divisor of 3. | 1 |
| 3683 | Find Greatest Common Divisor of 3 and 14, using Euclidean algorithm. | 1 |
| 3684 | Find Greatest Common Divisor of 8, 5, 16, 706456 and 8, using Euclidean algorithm. | 1 |
| 3685 | Find Greatest Common Divisor of 19. | 1 |
| 3686 | Find Greatest Common Divisor of 223. | 1 |
| 3687 | Find Greatest Common Divisor of 1 and 47, using prime factorization. | 1 |
| 3688 | Find Greatest Common Divisor of 185, 111111 and 111111111111, using prime factorization. | 1 |
| 3689 | Find Greatest Common Divisor of 16 and 3, using prime factorization. | 1 |
| 3690 | Find Greatest Common Divisor of 12 and 120, using prime factorization. | 1 |
| 3691 | Find Greatest Common Divisor of 13 and 2760, using Euclidean algorithm. | 1 |
| 3692 | Find Greatest Common Divisor of 13 and 2760, using prime factorization. | 1 |
| 3693 | Find Greatest Common Divisor of 357 and 221, using Euclidean algorithm. | 1 |
| 3694 | Find Greatest Common Divisor of 143 and 374, using Euclidean algorithm. | 1 |
| 3695 | Find Greatest Common Divisor of 6 and 33, using prime factorization. | 1 |
| 3696 | Find Greatest Common Divisor of 6 and 33, using Euclidean algorithm. | 1 |
| 3697 | Find Greatest Common Divisor of 1632 and 1187, using prime factorization. | 1 |
| 3698 | Find Greatest Common Divisor of 1632 and 1187, using Euclidean algorithm. | 1 |
| 3699 | Find Greatest Common Divisor of 1, 3, 1 and 10, using prime factorization. | 1 |
| 3700 | Find Greatest Common Divisor of 243 and 198, using Euclidean algorithm. | 1 |
