GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3851 | Find Greatest Common Divisor of 10 and 11, using Euclidean algorithm. | 2 |
| 3852 | Find Greatest Common Divisor of 5871420 and 299, using prime factorization. | 2 |
| 3853 | Find Greatest Common Divisor of 330 and 1140, using prime factorization. | 2 |
| 3854 | Find Greatest Common Divisor of 2701 and 2737, using Euclidean algorithm. | 2 |
| 3855 | Find Greatest Common Divisor of 56, 94 and 128, using prime factorization. | 2 |
| 3856 | Find Greatest Common Divisor of 56, 92 and 124, using repeated division. | 2 |
| 3857 | Find Greatest Common Divisor of 750 and 960, using repeated division. | 2 |
| 3858 | Find Greatest Common Divisor of 152 and 276, using prime factorization. | 2 |
| 3859 | Find Greatest Common Divisor of 332 and 128, using Euclidean algorithm. | 2 |
| 3860 | Find Greatest Common Divisor of 49, 210 and 350, using prime factorization. | 2 |
| 3861 | Find Greatest Common Divisor of 24, 138, 24 and 138, using prime factorization. | 2 |
| 3862 | Find Greatest Common Divisor of 512 and 186, using prime factorization. | 2 |
| 3863 | Find Greatest Common Divisor of 296, 703 and 814, using prime factorization. | 2 |
| 3864 | Find Greatest Common Divisor of 296, 703 and 814, by listing out the factors. | 2 |
| 3865 | Find Greatest Common Divisor of 231 and 7757, using prime factorization. | 2 |
| 3866 | Find Greatest Common Divisor of 5880420 and 229, using Euclidean algorithm. | 2 |
| 3867 | Find Greatest Common Divisor of 103 and 91, using Euclidean algorithm. | 2 |
| 3868 | Find Greatest Common Divisor of 800 and 1025, using prime factorization. | 2 |
| 3869 | Find Greatest Common Divisor of 106 and 63, using prime factorization. | 2 |
| 3870 | Find Greatest Common Divisor of 4284 and 8219, using prime factorization. | 2 |
| 3871 | Find Greatest Common Divisor of 5786423. | 2 |
| 3872 | Find Greatest Common Divisor of 120. | 2 |
| 3873 | Find Greatest Common Divisor of 125 and 11, using prime factorization. | 2 |
| 3874 | Find Greatest Common Divisor of 125 and 11, using Euclidean algorithm. | 2 |
| 3875 | Find Greatest Common Divisor of 1632. | 2 |
| 3876 | Find Greatest Common Divisor of 93 and 42, using prime factorization. | 2 |
| 3877 | Find Greatest Common Divisor of 49 and 900, using prime factorization. | 2 |
| 3878 | Find Greatest Common Divisor of 123456 and 678, using Euclidean algorithm. | 2 |
| 3879 | Find Greatest Common Divisor of 951, 744, 516, 487, 808, 808, 676, 328, 940 and 470, using prime factorization. | 2 |
| 3880 | Find Greatest Common Divisor of 19 and 99, using prime factorization. | 2 |
| 3881 | Find Greatest Common Divisor of 912 and 1210, using prime factorization. | 2 |
| 3882 | Find Greatest Common Divisor of 1 and 1000, using prime factorization. | 2 |
| 3883 | Find Greatest Common Divisor of 2 and 1001, using prime factorization. | 2 |
| 3884 | Find Greatest Common Divisor of 2 and 1002, using prime factorization. | 2 |
| 3885 | Find Greatest Common Divisor of 61730. | 2 |
| 3886 | Find Greatest Common Divisor of 147 and 630, using repeated division. | 2 |
| 3887 | Find Greatest Common Divisor of 6, 55 and 128, using prime factorization. | 2 |
| 3888 | Find Greatest Common Divisor of 24, 30 and 36, using prime factorization. | 2 |
| 3889 | Find Greatest Common Divisor of 24 and 69, using repeated division. | 2 |
| 3890 | Find Greatest Common Divisor of 652 and 32, using Euclidean algorithm. | 2 |
| 3891 | Find Greatest Common Divisor of 42 and 65, using prime factorization. | 2 |
| 3892 | Find Greatest Common Divisor of 54 and 144, using prime factorization. | 2 |
| 3893 | Find Greatest Common Divisor of 8, 16 and 20, using prime factorization. | 2 |
| 3894 | Find Greatest Common Divisor of 12, 18 and 21, using prime factorization. | 2 |
| 3895 | Find Greatest Common Divisor of 180, 2 and 210, using prime factorization. | 2 |
| 3896 | Find Greatest Common Divisor of 3, 2, 2 and 2, using prime factorization. | 2 |
| 3897 | Find Greatest Common Divisor of 0 and 43, using prime factorization. | 2 |
| 3898 | Find Greatest Common Divisor of 34336550 and 120400, using Euclidean algorithm. | 2 |
| 3899 | Find Greatest Common Divisor of 44 and 85, using Euclidean algorithm. | 2 |
| 3900 | Find Greatest Common Divisor of 19 and 45, using Euclidean algorithm. | 2 |