GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3301 | Find Greatest Common Divisor of 2, 6, 12, 20 and 30, using prime factorization. | 2 |
| 3302 | Find Greatest Common Divisor of 51, 68 and 85, using prime factorization. | 2 |
| 3303 | Find Greatest Common Divisor of 8, 18 and 30, using repeated division. | 2 |
| 3304 | Find Greatest Common Divisor of 5544 and 6600, using Euclidean algorithm. | 2 |
| 3305 | Find Greatest Common Divisor of 33 and 16, using prime factorization. | 2 |
| 3306 | Find Greatest Common Divisor of 128 and 164, using prime factorization. | 2 |
| 3307 | Find Greatest Common Divisor of 328, 769, 541, 986, 215 and 734, using prime factorization. | 2 |
| 3308 | Find Greatest Common Divisor of 2151 and 863, using repeated division. | 2 |
| 3309 | Find Greatest Common Divisor of 26513 and 32321, using prime factorization. | 2 |
| 3310 | Find Greatest Common Divisor of 217 and 583, using Euclidean algorithm. | 2 |
| 3311 | Find Greatest Common Divisor of 15 and 2, using prime factorization. | 2 |
| 3312 | Find Greatest Common Divisor of 486 and 153, using Euclidean algorithm. | 2 |
| 3313 | Find Greatest Common Divisor of 238. | 2 |
| 3314 | Find Greatest Common Divisor of 12, 120, 30 and 42, using prime factorization. | 2 |
| 3315 | Find Greatest Common Divisor of 195 and 455, using prime factorization. | 2 |
| 3316 | Find Greatest Common Divisor of 155590302 and 4200021066, using Euclidean algorithm. | 2 |
| 3317 | Find Greatest Common Divisor of 5859 and 1232, using Euclidean algorithm. | 2 |
| 3318 | Find Greatest Common Divisor of 5859 and 1232, using prime factorization. | 2 |
| 3319 | Find Greatest Common Divisor of 1372 and 4536, using prime factorization. | 2 |
| 3320 | Find Greatest Common Divisor of 1372 and 4536, using Euclidean algorithm. | 2 |
| 3321 | Find Greatest Common Divisor of 4148 and 7684, using Euclidean algorithm. | 2 |
| 3322 | Find Greatest Common Divisor of 7293 and 3640, using Euclidean algorithm. | 2 |
| 3323 | Find Greatest Common Divisor of 27 and 36, using repeated division. | 2 |
| 3324 | Find Greatest Common Divisor of 55, 65, 201 and 3, using prime factorization. | 2 |
| 3325 | Find Greatest Common Divisor of 782221. | 2 |
| 3326 | Find Greatest Common Divisor of 800 and 72, using prime factorization. | 2 |
| 3327 | Find Greatest Common Divisor of 2025 and 1109, using Euclidean algorithm. | 2 |
| 3328 | Find Greatest Common Divisor of 212 and 338, using prime factorization. | 2 |
| 3329 | Find Greatest Common Divisor of 90 and 385, using prime factorization. | 2 |
| 3330 | Find Greatest Common Divisor of 82 and 76, using prime factorization. | 2 |
| 3331 | Find Greatest Common Divisor of 358 and 309, using repeated division. | 2 |
| 3332 | Find Greatest Common Divisor of 1812 and 2134, using prime factorization. | 2 |
| 3333 | Find Greatest Common Divisor of 142766 and 1729, using prime factorization. | 2 |
| 3334 | Find Greatest Common Divisor of 1638 and 4675, using prime factorization. | 2 |
| 3335 | Find Greatest Common Divisor of 4158 and 7056, using prime factorization. | 2 |
| 3336 | Find Greatest Common Divisor of 7394592 and 264817800, using prime factorization. | 2 |
| 3337 | Find Greatest Common Divisor of 1377, 1701 and 9477, using prime factorization. | 2 |
| 3338 | Find Greatest Common Divisor of 3963, 6933 and 9633, using prime factorization. | 2 |
| 3339 | Find Greatest Common Divisor of 111100 and 3, using prime factorization. | 2 |
| 3340 | Find Greatest Common Divisor of 344444 and 34444, using prime factorization. | 2 |
| 3341 | Find Greatest Common Divisor of 5436 and 675, using Euclidean algorithm. | 2 |
| 3342 | Find Greatest Common Divisor of 199 and 266, using Euclidean algorithm. | 2 |
| 3343 | Find Greatest Common Divisor of 1870 and 264, using Euclidean algorithm. | 2 |
| 3344 | Find Greatest Common Divisor of 1870 and 261, using Euclidean algorithm. | 2 |
| 3345 | Find Greatest Common Divisor of 1879 and 460, using Euclidean algorithm. | 2 |
| 3346 | Find Greatest Common Divisor of 1872 and 460, using Euclidean algorithm. | 2 |
| 3347 | Find Greatest Common Divisor of 1274 and 460, using Euclidean algorithm. | 2 |
| 3348 | Find Greatest Common Divisor of 1214 and 460, using Euclidean algorithm. | 2 |
| 3349 | Find Greatest Common Divisor of 200 and 1001, using prime factorization. | 2 |
| 3350 | Find Greatest Common Divisor of 17 and 26892, by listing out the factors. | 2 |