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 12345. | 2 |
| 4202 | Find Greatest Common Divisor of 132 and 250, using prime factorization. | 2 |
| 4203 | Find Greatest Common Divisor of 56 and 999, using Euclidean algorithm. | 2 |
| 4204 | Find Greatest Common Divisor of 85 and 7225, using Euclidean algorithm. | 2 |
| 4205 | Find Greatest Common Divisor of 81, 2, 8, 9 and 1, using prime factorization. | 2 |
| 4206 | Find Greatest Common Divisor of 670 and 5000, using prime factorization. | 2 |
| 4207 | Find Greatest Common Divisor of 98 and 1200, using prime factorization. | 2 |
| 4208 | Find Greatest Common Divisor of 98 and 1120, using prime factorization. | 2 |
| 4209 | Find Greatest Common Divisor of 60, 4 and 8, by listing out the factors. | 2 |
| 4210 | Find Greatest Common Divisor of 30 and 40, by listing out the factors. | 2 |
| 4211 | Find Greatest Common Divisor of 8 and 10, by listing out the factors. | 2 |
| 4212 | Find Greatest Common Divisor of 8 and 10, using repeated division. | 2 |
| 4213 | Find Greatest Common Divisor of 18 and 45, using prime factorization. | 2 |
| 4214 | Find Greatest Common Divisor of 124 and 360, using Euclidean algorithm. | 2 |
| 4215 | Find Greatest Common Divisor of 108 and 144, using Euclidean algorithm. | 2 |
| 4216 | Find Greatest Common Divisor of 2349 and 1537, using Euclidean algorithm. | 2 |
| 4217 | Find Greatest Common Divisor of 12 and 53, using repeated division. | 2 |
| 4218 | Find Greatest Common Divisor of 12 and 53, using Euclidean algorithm. | 2 |
| 4219 | Find Greatest Common Divisor of 6, 89, 8 and 1, using prime factorization. | 2 |
| 4220 | Find Greatest Common Divisor of 7469 and 2463, using prime factorization. | 2 |
| 4221 | Find Greatest Common Divisor of 1147 and 899, using Euclidean algorithm. | 2 |
| 4222 | Find Greatest Common Divisor of 1147 and 889, using Euclidean algorithm. | 2 |
| 4223 | Find Greatest Common Divisor of 84 and 378, using prime factorization. | 2 |
| 4224 | Find Greatest Common Divisor of 216 and 324, using prime factorization. | 2 |
| 4225 | Find Greatest Common Divisor of 662 and 414, using prime factorization. | 2 |
| 4226 | Find Greatest Common Divisor of 384 and 2750, using prime factorization. | 2 |
| 4227 | Find Greatest Common Divisor of 243. | 2 |
| 4228 | Find Greatest Common Divisor of 220 and 8900, using prime factorization. | 2 |
| 4229 | Find Greatest Common Divisor of 1, 9, 1 and 3, using prime factorization. | 2 |
| 4230 | Find Greatest Common Divisor of 1, 8, 1 and 2, using prime factorization. | 2 |
| 4231 | Find Greatest Common Divisor of 36, 81 and 2, using prime factorization. | 2 |
| 4232 | Find Greatest Common Divisor of 4801 and 500, using Euclidean algorithm. | 2 |
| 4233 | Find Greatest Common Divisor of 3120. | 2 |
| 4234 | Find Greatest Common Divisor of 130 and 115, by listing out the factors. | 2 |
| 4235 | Find Greatest Common Divisor of 156 and 68, using Euclidean algorithm. | 2 |
| 4236 | Find Greatest Common Divisor of 156 and 68, using prime factorization. | 2 |
| 4237 | Find Greatest Common Divisor of 84 and 1264, using Euclidean algorithm. | 2 |
| 4238 | Find Greatest Common Divisor of 0, 1 and 7, using Euclidean algorithm. | 2 |
| 4239 | Find Greatest Common Divisor of 0, 1 and 7, using prime factorization. | 2 |
| 4240 | Find Greatest Common Divisor of 13 and 23, using prime factorization. | 2 |
| 4241 | Find Greatest Common Divisor of 1638 and 4096, using prime factorization. | 2 |
| 4242 | Find Greatest Common Divisor of 400 and 600, using prime factorization. | 2 |
| 4243 | Find Greatest Common Divisor of 60800 and 60200, using repeated division. | 2 |
| 4244 | Find Greatest Common Divisor of 60800 and 60200, using Euclidean algorithm. | 2 |
| 4245 | Find Greatest Common Divisor of 28 and 294, using prime factorization. | 2 |
| 4246 | Find Greatest Common Divisor of 3587 and 1819, using repeated division. | 2 |
| 4247 | Find Greatest Common Divisor of 244 and 117, using Euclidean algorithm. | 2 |
| 4248 | Find Greatest Common Divisor of 4001, 1312 and 458, using Euclidean algorithm. | 2 |
| 4249 | Find Greatest Common Divisor of 68, 12, 8, 4 and 0, by listing out the factors. | 2 |
| 4250 | Find Greatest Common Divisor of 68, 12, 8, 4 and 0, using repeated division. | 2 |