GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
3701 | Find Greatest Common Divisor of 682 and 496, using Euclidean algorithm. | 1 |
3702 | Find Greatest Common Divisor of 682 and 496, using repeated division. | 1 |
3703 | Find Greatest Common Divisor of 682 and 496, by listing out the factors. | 1 |
3704 | Find Greatest Common Divisor of 35 and 14, using Euclidean algorithm. | 1 |
3705 | Find Greatest Common Divisor of 1716 and 1260, using repeated division. | 1 |
3706 | Find Greatest Common Divisor of 513 and 347, using repeated division. | 1 |
3707 | Find Greatest Common Divisor of 3 and 352, using Euclidean algorithm. | 1 |
3708 | Find Greatest Common Divisor of 30193 and 6831139, using Euclidean algorithm. | 1 |
3709 | Find Greatest Common Divisor of 10 and 26, using prime factorization. | 1 |
3710 | Find Greatest Common Divisor of 13 and 26, using prime factorization. | 1 |
3711 | Find Greatest Common Divisor of 13 and 160, using prime factorization. | 1 |
3712 | Find Greatest Common Divisor of 9, 6, 8, 5, 2, 11, 8, 8, 7 and 6, using prime factorization. | 1 |
3713 | Find Greatest Common Divisor of 3187024 and 5723, using Euclidean algorithm. | 1 |
3714 | Find Greatest Common Divisor of 5723 and 5036, using Euclidean algorithm. | 1 |
3715 | Find Greatest Common Divisor of 125 and 728, using prime factorization. | 1 |
3716 | Find Greatest Common Divisor of 216 and 68, using prime factorization. | 1 |
3717 | Find Greatest Common Divisor of 3210 and 1108, using Euclidean algorithm. | 1 |
3718 | Find Greatest Common Divisor of 105 and 33, using Euclidean algorithm. | 1 |
3719 | Find Greatest Common Divisor of 2, 2, 2, 5, 2, 3, 2, 2 and 1, using prime factorization. | 1 |
3720 | Find Greatest Common Divisor of 280 and 117, by listing out the factors. | 1 |
3721 | Find Greatest Common Divisor of 7496 and 2464, using prime factorization. | 1 |
3722 | Find Greatest Common Divisor of 1243 and 23, using Euclidean algorithm. | 1 |
3723 | Find Greatest Common Divisor of 124 and 23, using Euclidean algorithm. | 1 |
3724 | Find Greatest Common Divisor of 5 and 72, using repeated division. | 1 |
3725 | Find Greatest Common Divisor of 1000 and 1, using Euclidean algorithm. | 1 |
3726 | Find Greatest Common Divisor of 7, 4, 3 and 2, using prime factorization. | 1 |
3727 | Find Greatest Common Divisor of 42 and 35, using prime factorization. | 1 |
3728 | Find Greatest Common Divisor of 3810 and 417, using Euclidean algorithm. | 1 |
3729 | Find Greatest Common Divisor of 4424 and 864, using Euclidean algorithm. | 1 |
3730 | Find Greatest Common Divisor of 330 and 360, using Euclidean algorithm. | 1 |
3731 | Find Greatest Common Divisor of 240 and 2450, using Euclidean algorithm. | 1 |
3732 | Find Greatest Common Divisor of 332 and 128, using prime factorization. | 1 |
3733 | Find Greatest Common Divisor of 231 and 775, using Euclidean algorithm. | 1 |
3734 | Find Greatest Common Divisor of 3, 2 and 10, using prime factorization. | 1 |
3735 | Find Greatest Common Divisor of 10, 0, 0 and 0, using repeated division. | 1 |
3736 | Find Greatest Common Divisor of 447 and 466, using prime factorization. | 1 |
3737 | Find Greatest Common Divisor of 4284 and 8219, using Euclidean algorithm. | 1 |
3738 | Find Greatest Common Divisor of 125 and 11, using repeated division. | 1 |
3739 | Find Greatest Common Divisor of 15 and 120, using prime factorization. | 1 |
3740 | Find Greatest Common Divisor of 10001 and 100083, using prime factorization. | 1 |
3741 | Find Greatest Common Divisor of 10001 and 100083, using Euclidean algorithm. | 1 |
3742 | Find Greatest Common Divisor of 10254 and 789, using repeated division. | 1 |
3743 | Find Greatest Common Divisor of 10254 and 789, using prime factorization. | 1 |
3744 | Find Greatest Common Divisor of 10254 and 789, using Euclidean algorithm. | 1 |
3745 | Find Greatest Common Divisor of 26 and 87, using prime factorization. | 1 |
3746 | Find Greatest Common Divisor of 22500, 33600 and 26064, using prime factorization. | 1 |
3747 | Find Greatest Common Divisor of 500, 330 and 384, using prime factorization. | 1 |
3748 | Find Greatest Common Divisor of 24 and 69, using prime factorization. | 1 |
3749 | Find Greatest Common Divisor of 0, 25 and 100, using prime factorization. | 1 |
3750 | Find Greatest Common Divisor of 0 and 43, using Euclidean algorithm. | 1 |