GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2901 | Find Greatest Common Divisor of 10 and 20, using repeated division. | 2 |
| 2902 | Find Greatest Common Divisor of 36 and 4509, using prime factorization. | 2 |
| 2903 | Find Greatest Common Divisor of 5264 and 15472, using prime factorization. | 2 |
| 2904 | Find Greatest Common Divisor of 24, 25 and 50, using prime factorization. | 2 |
| 2905 | Find Greatest Common Divisor of 2, 6, 4962, 113, 98, 122, 113, 113, 4962, 4962, 49, 48, 113, 106, 113, 112 and 113, using prime factorization. | 2 |
| 2906 | Find Greatest Common Divisor of 215 and 180, using prime factorization. | 2 |
| 2907 | Find Greatest Common Divisor of 25, 65 and 80, using prime factorization. | 2 |
| 2908 | Find Greatest Common Divisor of 6 and 54, using prime factorization. | 2 |
| 2909 | Find Greatest Common Divisor of 25 and 7, using prime factorization. | 2 |
| 2910 | Find Greatest Common Divisor of 100 and 6, using prime factorization. | 2 |
| 2911 | Find Greatest Common Divisor of 81 and 9, using prime factorization. | 2 |
| 2912 | Find Greatest Common Divisor of 300 and 10, using prime factorization. | 2 |
| 2913 | Find Greatest Common Divisor of 150 and 5, using prime factorization. | 2 |
| 2914 | Find Greatest Common Divisor of 3120. | 2 |
| 2915 | Find Greatest Common Divisor of 4410 and 15450, using prime factorization. | 2 |
| 2916 | Find Greatest Common Divisor of 56 and 42, using repeated division. | 2 |
| 2917 | Find Greatest Common Divisor of 973 and 301, using Euclidean algorithm. | 2 |
| 2918 | Find Greatest Common Divisor of 12 and 67, using Euclidean algorithm. | 2 |
| 2919 | Find Greatest Common Divisor of 90 and 56, using prime factorization. | 2 |
| 2920 | Find Greatest Common Divisor of 84, 126 and 21, using prime factorization. | 2 |
| 2921 | Find Greatest Common Divisor of 35831808 and 33, using prime factorization. | 2 |
| 2922 | Find Greatest Common Divisor of 160 and 5, using prime factorization. | 2 |
| 2923 | Find Greatest Common Divisor of 65025 and 16, using prime factorization. | 2 |
| 2924 | Find Greatest Common Divisor of 65025 and 16, by listing out the factors. | 2 |
| 2925 | Find Greatest Common Divisor of 698 and 8, using prime factorization. | 2 |
| 2926 | Find Greatest Common Divisor of 838. | 2 |
| 2927 | Find Greatest Common Divisor of 206 and 16, using prime factorization. | 2 |
| 2928 | Find Greatest Common Divisor of 225324 and 202851, using Euclidean algorithm. | 2 |
| 2929 | Find Greatest Common Divisor of 55 and 100, using prime factorization. | 2 |
| 2930 | Find Greatest Common Divisor of 18 and 96, using prime factorization. | 2 |
| 2931 | Find Greatest Common Divisor of 3 and 13, using prime factorization. | 2 |
| 2932 | Find Greatest Common Divisor of 12870 and 2618, using Euclidean algorithm. | 2 |
| 2933 | Find Greatest Common Divisor of 91 and 287, using prime factorization. | 2 |
| 2934 | Find Greatest Common Divisor of 12, 21 and 28, using prime factorization. | 2 |
| 2935 | Find Greatest Common Divisor of 15, 18 and 16, using prime factorization. | 2 |
| 2936 | Find Greatest Common Divisor of 102 and 222, using Euclidean algorithm. | 2 |
| 2937 | Find Greatest Common Divisor of 2048 and 100124, using repeated division. | 2 |
| 2938 | Find Greatest Common Divisor of 72 and 54, using prime factorization. | 2 |
| 2939 | Find Greatest Common Divisor of 18, 45 and 60, using prime factorization. | 2 |
| 2940 | Find Greatest Common Divisor of 712. | 2 |
| 2941 | Find Greatest Common Divisor of 111 and 1986, using prime factorization. | 2 |
| 2942 | Find Greatest Common Divisor of 19 and 141, using prime factorization. | 2 |
| 2943 | Find Greatest Common Divisor of 390 and 720, using Euclidean algorithm. | 2 |
| 2944 | Find Greatest Common Divisor of 289 and 160, using prime factorization. | 2 |
| 2945 | Find Greatest Common Divisor of 31256 and 4788, using Euclidean algorithm. | 2 |
| 2946 | Find Greatest Common Divisor of 1, 2 and 3, using Euclidean algorithm. | 2 |
| 2947 | Find Greatest Common Divisor of 252 and 180, using prime factorization. | 2 |
| 2948 | Find Greatest Common Divisor of 60 and 45, using prime factorization. | 2 |
| 2949 | Find Greatest Common Divisor of 64, 48 and 16, using prime factorization. | 2 |
| 2950 | Find Greatest Common Divisor of 5, 15 and 25, by listing out the factors. | 2 |