GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3151 | Find Greatest Common Divisor of 30 and 18, using Euclidean algorithm. | 2 |
| 3152 | Find Greatest Common Divisor of 48 and 2, using Euclidean algorithm. | 2 |
| 3153 | Find Greatest Common Divisor of 48 and 22, using Euclidean algorithm. | 2 |
| 3154 | Find Greatest Common Divisor of 87 and 54, using Euclidean algorithm. | 2 |
| 3155 | Find Greatest Common Divisor of 28 and 95, using Euclidean algorithm. | 2 |
| 3156 | Find Greatest Common Divisor of 33 and 84, using Euclidean algorithm. | 2 |
| 3157 | Find Greatest Common Divisor of 95 and 22, using Euclidean algorithm. | 2 |
| 3158 | Find Greatest Common Divisor of 80 and 24, using Euclidean algorithm. | 2 |
| 3159 | Find Greatest Common Divisor of 88 and 84, using Euclidean algorithm. | 2 |
| 3160 | Find Greatest Common Divisor of 76 and 84, using Euclidean algorithm. | 2 |
| 3161 | Find Greatest Common Divisor of 42 and 41, using Euclidean algorithm. | 2 |
| 3162 | Find Greatest Common Divisor of 34 and 57, using Euclidean algorithm. | 2 |
| 3163 | Find Greatest Common Divisor of 93 and 66, using Euclidean algorithm. | 2 |
| 3164 | Find Greatest Common Divisor of 57 and 78, using Euclidean algorithm. | 2 |
| 3165 | Find Greatest Common Divisor of 19 and 3, using Euclidean algorithm. | 2 |
| 3166 | Find Greatest Common Divisor of 13 and 93, using Euclidean algorithm. | 2 |
| 3167 | Find Greatest Common Divisor of 44 and 67, using Euclidean algorithm. | 2 |
| 3168 | Find Greatest Common Divisor of 23 and 88, using Euclidean algorithm. | 2 |
| 3169 | Find Greatest Common Divisor of 47 and 81, using Euclidean algorithm. | 2 |
| 3170 | Find Greatest Common Divisor of 64 and 2, using Euclidean algorithm. | 2 |
| 3171 | Find Greatest Common Divisor of 31 and 31, using Euclidean algorithm. | 2 |
| 3172 | Find Greatest Common Divisor of 96 and 46, using Euclidean algorithm. | 2 |
| 3173 | Find Greatest Common Divisor of 88 and 60, using Euclidean algorithm. | 2 |
| 3174 | Find Greatest Common Divisor of 81 and 2, using Euclidean algorithm. | 2 |
| 3175 | Find Greatest Common Divisor of 2 and 62, using Euclidean algorithm. | 2 |
| 3176 | Find Greatest Common Divisor of 446492299 and 186378511, using prime factorization. | 2 |
| 3177 | Find Greatest Common Divisor of 33 and 45, using Euclidean algorithm. | 2 |
| 3178 | Find Greatest Common Divisor of 44 and 95, using Euclidean algorithm. | 2 |
| 3179 | Find Greatest Common Divisor of 44 and 70, using Euclidean algorithm. | 2 |
| 3180 | Find Greatest Common Divisor of 62 and 83, using Euclidean algorithm. | 2 |
| 3181 | Find Greatest Common Divisor of 16 and 64, using Euclidean algorithm. | 2 |
| 3182 | Find Greatest Common Divisor of 17 and 8, using Euclidean algorithm. | 2 |
| 3183 | Find Greatest Common Divisor of 83 and 99, using Euclidean algorithm. | 2 |
| 3184 | Find Greatest Common Divisor of 40 and 50, using Euclidean algorithm. | 2 |
| 3185 | Find Greatest Common Divisor of 99 and 59, using Euclidean algorithm. | 2 |
| 3186 | Find Greatest Common Divisor of 92 and 27, using Euclidean algorithm. | 2 |
| 3187 | Find Greatest Common Divisor of 59 and 66, using Euclidean algorithm. | 2 |
| 3188 | Find Greatest Common Divisor of 14 and 2, using Euclidean algorithm. | 2 |
| 3189 | Find Greatest Common Divisor of 87 and 94, using Euclidean algorithm. | 2 |
| 3190 | Find Greatest Common Divisor of 97 and 63, using Euclidean algorithm. | 2 |
| 3191 | Find Greatest Common Divisor of 27 and 79, using Euclidean algorithm. | 2 |
| 3192 | Find Greatest Common Divisor of 59 and 64, using Euclidean algorithm. | 2 |
| 3193 | Find Greatest Common Divisor of 63 and 16, using Euclidean algorithm. | 2 |
| 3194 | Find Greatest Common Divisor of 39 and 15, using Euclidean algorithm. | 2 |
| 3195 | Find Greatest Common Divisor of 7 and 91, using Euclidean algorithm. | 2 |
| 3196 | Find Greatest Common Divisor of 33 and 94, using Euclidean algorithm. | 2 |
| 3197 | Find Greatest Common Divisor of 16 and 24, using Euclidean algorithm. | 2 |
| 3198 | Find Greatest Common Divisor of 858 and 325, using prime factorization. | 2 |
| 3199 | Find Greatest Common Divisor of 117 and 65, using Euclidean algorithm. | 2 |
| 3200 | Find Greatest Common Divisor of 68 and 41, using Euclidean algorithm. | 2 |