GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6151 | Find Greatest Common Divisor of 56 and 7, using prime factorization. | 1 |
| 6152 | Find Greatest Common Divisor of 32 and 72, using repeated division. | 1 |
| 6153 | Find Greatest Common Divisor of 24, 60 and 45, using prime factorization. | 1 |
| 6154 | Find Greatest Common Divisor of 17 and 3233, using Euclidean algorithm. | 1 |
| 6155 | Find Greatest Common Divisor of 360 and 48, using Euclidean algorithm. | 1 |
| 6156 | Find Greatest Common Divisor of 360 and 483, using Euclidean algorithm. | 1 |
| 6157 | Find Greatest Common Divisor of 1258 and 527, using Euclidean algorithm. | 1 |
| 6158 | Find Greatest Common Divisor of 3. | 1 |
| 6159 | Find Greatest Common Divisor of 8, 5, 16, 706456 and 8, using Euclidean algorithm. | 1 |
| 6160 | Find Greatest Common Divisor of 19. | 1 |
| 6161 | Find Greatest Common Divisor of 223. | 1 |
| 6162 | Find Greatest Common Divisor of 1 and 47, using prime factorization. | 1 |
| 6163 | Find Greatest Common Divisor of 185, 111111 and 111111111111, using prime factorization. | 1 |
| 6164 | Find Greatest Common Divisor of 16 and 3, using prime factorization. | 1 |
| 6165 | Find Greatest Common Divisor of 12 and 120, using prime factorization. | 1 |
| 6166 | Find Greatest Common Divisor of 13 and 2760, using Euclidean algorithm. | 1 |
| 6167 | Find Greatest Common Divisor of 13 and 2760, using prime factorization. | 1 |
| 6168 | Find Greatest Common Divisor of 357 and 221, using Euclidean algorithm. | 1 |
| 6169 | Find Greatest Common Divisor of 143 and 374, using Euclidean algorithm. | 1 |
| 6170 | Find Greatest Common Divisor of 6 and 33, using Euclidean algorithm. | 1 |
| 6171 | Find Greatest Common Divisor of 1632 and 1187, using prime factorization. | 1 |
| 6172 | Find Greatest Common Divisor of 1632 and 1187, using Euclidean algorithm. | 1 |
| 6173 | Find Greatest Common Divisor of 1, 3, 1 and 10, using prime factorization. | 1 |
| 6174 | Find Greatest Common Divisor of 243 and 198, using Euclidean algorithm. | 1 |
| 6175 | Find Greatest Common Divisor of 682 and 496, using prime factorization. | 1 |
| 6176 | Find Greatest Common Divisor of 682 and 496, using Euclidean algorithm. | 1 |
| 6177 | Find Greatest Common Divisor of 682 and 496, using repeated division. | 1 |
| 6178 | Find Greatest Common Divisor of 682 and 496, by listing out the factors. | 1 |
| 6179 | Find Greatest Common Divisor of 1716 and 1260, using repeated division. | 1 |
| 6180 | Find Greatest Common Divisor of 513 and 347, using repeated division. | 1 |
| 6181 | Find Greatest Common Divisor of 3 and 352, using Euclidean algorithm. | 1 |
| 6182 | Find Greatest Common Divisor of 30193 and 6831139, using Euclidean algorithm. | 1 |
| 6183 | Find Greatest Common Divisor of 13 and 160, using prime factorization. | 1 |
| 6184 | Find Greatest Common Divisor of 9, 6, 8, 5, 2, 11, 8, 8, 7 and 6, using prime factorization. | 1 |
| 6185 | Find Greatest Common Divisor of 3187024 and 5723, using Euclidean algorithm. | 1 |
| 6186 | Find Greatest Common Divisor of 5723 and 5036, using Euclidean algorithm. | 1 |
| 6187 | Find Greatest Common Divisor of 125 and 728, using prime factorization. | 1 |
| 6188 | Find Greatest Common Divisor of 216 and 68, using prime factorization. | 1 |
| 6189 | Find Greatest Common Divisor of 3210 and 1108, using Euclidean algorithm. | 1 |
| 6190 | Find Greatest Common Divisor of 105 and 33, using Euclidean algorithm. | 1 |
| 6191 | Find Greatest Common Divisor of 2, 2, 2, 5, 2, 3, 2, 2 and 1, using prime factorization. | 1 |
| 6192 | Find Greatest Common Divisor of 280 and 117, by listing out the factors. | 1 |
| 6193 | Find Greatest Common Divisor of 7496 and 2464, using prime factorization. | 1 |
| 6194 | Find Greatest Common Divisor of 1243 and 23, using Euclidean algorithm. | 1 |
| 6195 | Find Greatest Common Divisor of 124 and 23, using Euclidean algorithm. | 1 |
| 6196 | Find Greatest Common Divisor of 5 and 72, using repeated division. | 1 |
| 6197 | Find Greatest Common Divisor of 1000 and 1, using Euclidean algorithm. | 1 |
| 6198 | Find Greatest Common Divisor of 7, 4, 3 and 2, using prime factorization. | 1 |
| 6199 | Find Greatest Common Divisor of 42 and 35, using prime factorization. | 1 |
| 6200 | Find Greatest Common Divisor of 3810 and 417, using Euclidean algorithm. | 1 |
