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 1 and 7, using Euclidean algorithm. | 2 |
| 3152 | Find Greatest Common Divisor of 132 and 100, using prime factorization. | 2 |
| 3153 | Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm. | 2 |
| 3154 | Find Greatest Common Divisor of 1513 and 120, using prime factorization. | 2 |
| 3155 | Find Greatest Common Divisor of 99 and 81, using prime factorization. | 2 |
| 3156 | Find Greatest Common Divisor of 5616 and 54756, using prime factorization. | 2 |
| 3157 | Find Greatest Common Divisor of 111 and 201, using Euclidean algorithm. | 2 |
| 3158 | Find Greatest Common Divisor of 3, 1 and 1, using Euclidean algorithm. | 2 |
| 3159 | Find Greatest Common Divisor of 16 and 35, using Euclidean algorithm. | 2 |
| 3160 | Find Greatest Common Divisor of 32, 56 and 78, using repeated division. | 2 |
| 3161 | Find Greatest Common Divisor of 2907 and 105, using prime factorization. | 2 |
| 3162 | Find Greatest Common Divisor of 1330 and 42, using Euclidean algorithm. | 2 |
| 3163 | Find Greatest Common Divisor of 24, 12 and 36, using prime factorization. | 2 |
| 3164 | Find Greatest Common Divisor of 12327 and 2409, using Euclidean algorithm. | 2 |
| 3165 | Find Greatest Common Divisor of 2486625522 and 41582215163, by listing out the factors. | 2 |
| 3166 | Find Greatest Common Divisor of 492, 1353 and 615, using prime factorization. | 2 |
| 3167 | Find Greatest Common Divisor of 5400 and 2412, using Euclidean algorithm. | 2 |
| 3168 | Find Greatest Common Divisor of 6789, 1356 and 2460, using prime factorization. | 2 |
| 3169 | Find Greatest Common Divisor of 1342 and 5733, using prime factorization. | 2 |
| 3170 | Find Greatest Common Divisor of 75 and 240, using prime factorization. | 2 |
| 3171 | Find Greatest Common Divisor of 589432167. | 2 |
| 3172 | Find Greatest Common Divisor of 589432167. | 2 |
| 3173 | Find Greatest Common Divisor of 7, 5 and 6, using prime factorization. | 2 |
| 3174 | Find Greatest Common Divisor of 520 and 660, using prime factorization. | 2 |
| 3175 | Find Greatest Common Divisor of 101 and 3267, using Euclidean algorithm. | 2 |
| 3176 | Find Greatest Common Divisor of 9357 and 5864, using prime factorization. | 2 |
| 3177 | Find Greatest Common Divisor of 1, 9, 2, 4, 4 and 30, using prime factorization. | 2 |
| 3178 | Find Greatest Common Divisor of 1235 and 765, using Euclidean algorithm. | 2 |
| 3179 | Find Greatest Common Divisor of 16 and 63, using prime factorization. | 2 |
| 3180 | Find Greatest Common Divisor of 112 and 128, using prime factorization. | 2 |
| 3181 | Find Greatest Common Divisor of 144 and 300, using prime factorization. | 2 |
| 3182 | Find Greatest Common Divisor of 4409 and 519, using prime factorization. | 2 |
| 3183 | Find Greatest Common Divisor of 459 and 663, using prime factorization. | 2 |
| 3184 | Find Greatest Common Divisor of 12, 8 and 6, using prime factorization. | 2 |
| 3185 | Find Greatest Common Divisor of 1999 and 1090909, using Euclidean algorithm. | 2 |
| 3186 | Find Greatest Common Divisor of 638 and 5002, using prime factorization. | 2 |
| 3187 | Find Greatest Common Divisor of 972 and 783, using Euclidean algorithm. | 2 |
| 3188 | Find Greatest Common Divisor of 48, 180 and 270, using Euclidean algorithm. | 2 |
| 3189 | Find Greatest Common Divisor of 2520 and 6300, using Euclidean algorithm. | 2 |
| 3190 | Find Greatest Common Divisor of 2516 and 1125, using prime factorization. | 2 |
| 3191 | Find Greatest Common Divisor of 2516 and 1125, using Euclidean algorithm. | 2 |
| 3192 | Find Greatest Common Divisor of 14860 and 4424, using Euclidean algorithm. | 2 |
| 3193 | Find Greatest Common Divisor of 84 and 68, using Euclidean algorithm. | 2 |
| 3194 | Find Greatest Common Divisor of 243 and 368, using prime factorization. | 2 |
| 3195 | Find Greatest Common Divisor of 512 and 384, using repeated division. | 2 |
| 3196 | Find Greatest Common Divisor of 6, 12 and 20, using prime factorization. | 2 |
| 3197 | Find Greatest Common Divisor of 3, 5, 7, 9 and 11, using Euclidean algorithm. | 2 |
| 3198 | Find Greatest Common Divisor of 3, 5, 7, 9 and 11, by listing out the factors. | 2 |
| 3199 | Find Greatest Common Divisor of 728. | 2 |
| 3200 | Find Greatest Common Divisor of 324, 756 and 480, using prime factorization. | 2 |