GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4201 | Find Greatest Common Divisor of 168, 420 and 588, using repeated division. | 2 |
| 4202 | Find Greatest Common Divisor of 576, 672 and 1632, using repeated division. | 2 |
| 4203 | Find Greatest Common Divisor of 65 and 37, using Euclidean algorithm. | 2 |
| 4204 | Find Greatest Common Divisor of 10, 12 and 14, using prime factorization. | 2 |
| 4205 | Find Greatest Common Divisor of 360 and 504, using repeated division. | 2 |
| 4206 | Find Greatest Common Divisor of 162 and 297, using repeated division. | 2 |
| 4207 | Find Greatest Common Divisor of 60, 132 and 168, using repeated division. | 2 |
| 4208 | Find Greatest Common Divisor of 234 and 261, using repeated division. | 2 |
| 4209 | Find Greatest Common Divisor of 420, 560 and 630, using repeated division. | 2 |
| 4210 | Find Greatest Common Divisor of 1105 and 780, using Euclidean algorithm. | 2 |
| 4211 | Find Greatest Common Divisor of 2806 and 1702, using prime factorization. | 2 |
| 4212 | Find Greatest Common Divisor of 4200 and 1008, using prime factorization. | 2 |
| 4213 | Find Greatest Common Divisor of 7936259 and 16593996, using prime factorization. | 2 |
| 4214 | Find Greatest Common Divisor of 345 and 912, using Euclidean algorithm. | 2 |
| 4215 | Find Greatest Common Divisor of 392 and 23, using Euclidean algorithm. | 2 |
| 4216 | Find Greatest Common Divisor of 3921 and 23, using Euclidean algorithm. | 2 |
| 4217 | Find Greatest Common Divisor of 3921 and 238, using Euclidean algorithm. | 2 |
| 4218 | Find Greatest Common Divisor of 3921 and 538, using Euclidean algorithm. | 2 |
| 4219 | Find Greatest Common Divisor of 3621 and 938, using Euclidean algorithm. | 2 |
| 4220 | Find Greatest Common Divisor of 3621 and 1938, using Euclidean algorithm. | 2 |
| 4221 | Find Greatest Common Divisor of 623 and 51, using Euclidean algorithm. | 2 |
| 4222 | Find Greatest Common Divisor of 623 and 59, using Euclidean algorithm. | 2 |
| 4223 | Find Greatest Common Divisor of 623 and 98, using Euclidean algorithm. | 2 |
| 4224 | Find Greatest Common Divisor of 317. | 2 |
| 4225 | Find Greatest Common Divisor of 36 and 56, using repeated division. | 2 |
| 4226 | Find Greatest Common Divisor of 34 and 62, using repeated division. | 2 |
| 4227 | Find Greatest Common Divisor of 34 and 66, using repeated division. | 2 |
| 4228 | Find Greatest Common Divisor of 34 and 70, using repeated division. | 2 |
| 4229 | Find Greatest Common Divisor of 34 and 700, using repeated division. | 2 |
| 4230 | Find Greatest Common Divisor of 34 and 708, using repeated division. | 2 |
| 4231 | Find Greatest Common Divisor of 34 and 718, using repeated division. | 2 |
| 4232 | Find Greatest Common Divisor of 54 and 36, using repeated division. | 2 |
| 4233 | Find Greatest Common Divisor of 54 and 36, using Euclidean algorithm. | 2 |
| 4234 | Find Greatest Common Divisor of 56 and 36, using Euclidean algorithm. | 2 |
| 4235 | Find Greatest Common Divisor of 30690 and 93093, using prime factorization. | 2 |
| 4236 | Find Greatest Common Divisor of 30690 and 93093, using Euclidean algorithm. | 2 |
| 4237 | Find Greatest Common Divisor of 378 and 858, using prime factorization. | 2 |
| 4238 | Find Greatest Common Divisor of 36 and 248, using Euclidean algorithm. | 2 |
| 4239 | Find Greatest Common Divisor of 5, 17, 23, 14 and 83, using prime factorization. | 2 |
| 4240 | Find Greatest Common Divisor of 5, 17, 23, 14 and 83, using Euclidean algorithm. | 2 |
| 4241 | Find Greatest Common Divisor of 3991 and 285, using prime factorization. | 2 |
| 4242 | Find Greatest Common Divisor of 3991 and 285, using Euclidean algorithm. | 2 |
| 4243 | Find Greatest Common Divisor of 3991 and 328, using Euclidean algorithm. | 2 |
| 4244 | Find Greatest Common Divisor of 9 and 512, using prime factorization. | 2 |
| 4245 | Find Greatest Common Divisor of 169 and 6, using Euclidean algorithm. | 2 |
| 4246 | Find Greatest Common Divisor of 223 and 11, using Euclidean algorithm. | 2 |
| 4247 | Find Greatest Common Divisor of 52 and 30, using Euclidean algorithm. | 2 |
| 4248 | Find Greatest Common Divisor of 1625 and 975, using repeated division. | 2 |
| 4249 | Find Greatest Common Divisor of 1625 and 975, using prime factorization. | 2 |
| 4250 | Find Greatest Common Divisor of 3 and 40, using Euclidean algorithm. | 2 |