GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6301 | Find Greatest Common Divisor of 46 and 64, using prime factorization. | 1 |
| 6302 | Find Greatest Common Divisor of 890 and 525, using prime factorization. | 1 |
| 6303 | Find Greatest Common Divisor of 18 and 22, using prime factorization. | 1 |
| 6304 | Find Greatest Common Divisor of 1 and 8, using repeated division. | 1 |
| 6305 | Find Greatest Common Divisor of 115 and 184, using repeated division. | 1 |
| 6306 | Find Greatest Common Divisor of 165 and 285, using prime factorization. | 1 |
| 6307 | Find Greatest Common Divisor of 165 and 285, using Euclidean algorithm. | 1 |
| 6308 | Find Greatest Common Divisor of 91, 64 and 87, using repeated division. | 1 |
| 6309 | Find Greatest Common Divisor of 28 and 38, using prime factorization. | 1 |
| 6310 | Find Greatest Common Divisor of 28 and 38, using repeated division. | 1 |
| 6311 | Find Greatest Common Divisor of 28 and 38, using Euclidean algorithm. | 1 |
| 6312 | Find Greatest Common Divisor of 54 and 68, using prime factorization. | 1 |
| 6313 | Find Greatest Common Divisor of 2000 and 3000, using prime factorization. | 1 |
| 6314 | Find Greatest Common Divisor of 34 and 18, using prime factorization. | 1 |
| 6315 | Find Greatest Common Divisor of 378 and 140, using prime factorization. | 1 |
| 6316 | Find Greatest Common Divisor of 378 and 140, using repeated division. | 1 |
| 6317 | Find Greatest Common Divisor of 31 and 12, using prime factorization. | 1 |
| 6318 | Find Greatest Common Divisor of 10 and 30, using Euclidean algorithm. | 1 |
| 6319 | Find Greatest Common Divisor of 42 and 18, using Euclidean algorithm. | 1 |
| 6320 | Find Greatest Common Divisor of 110 and 2511, by listing out the factors. | 1 |
| 6321 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, using prime factorization. | 1 |
| 6322 | Find Greatest Common Divisor of 616 and 32, using prime factorization. | 1 |
| 6323 | Find Greatest Common Divisor of 2282 and 420, using prime factorization. | 1 |
| 6324 | Find Greatest Common Divisor of 48153687 and 165849, using prime factorization. | 1 |
| 6325 | Find Greatest Common Divisor of 2, 50, 1, 2, 60 and 1, using prime factorization. | 1 |
| 6326 | Find Greatest Common Divisor of 23, 17, 23 and 31, using prime factorization. | 1 |
| 6327 | Find Greatest Common Divisor of 7, 5, 4, 3, 1, 8, 5, 5, 3, 2, 2 and 2, using Euclidean algorithm. | 1 |
| 6328 | Find Greatest Common Divisor of 160 and 1, using prime factorization. | 1 |
| 6329 | Find Greatest Common Divisor of 2915 and 1445, using repeated division. | 1 |
| 6330 | Find Greatest Common Divisor of 147 and 91, using Euclidean algorithm. | 1 |
| 6331 | Find Greatest Common Divisor of 130 and 99, using Euclidean algorithm. | 1 |
| 6332 | Find Greatest Common Divisor of 5, 9, 2 and 3, using Euclidean algorithm. | 1 |
| 6333 | Find Greatest Common Divisor of 52 and 104, using prime factorization. | 1 |
| 6334 | Find Greatest Common Divisor of 3 and 111, using prime factorization. | 1 |
| 6335 | Find Greatest Common Divisor of 2 and 111, using prime factorization. | 1 |
| 6336 | Find Greatest Common Divisor of 1547 and 3536, using prime factorization. | 1 |
| 6337 | Find Greatest Common Divisor of 1547 and 3543, using Euclidean algorithm. | 1 |
| 6338 | Find Greatest Common Divisor of 23, 10, 23 and 7, using prime factorization. | 1 |
| 6339 | Find Greatest Common Divisor of 5 and 10, using prime factorization. | 1 |
| 6340 | Find Greatest Common Divisor of 36 and 49, using prime factorization. | 1 |
| 6341 | Find Greatest Common Divisor of 72 and 124, using prime factorization. | 1 |
| 6342 | Find Greatest Common Divisor of 3850 and 1162, using Euclidean algorithm. | 1 |
| 6343 | Find Greatest Common Divisor of 4 and 6, using prime factorization. | 1 |
| 6344 | Find Greatest Common Divisor of 1013, 11143 and 112443, using Euclidean algorithm. | 1 |
| 6345 | Find Greatest Common Divisor of 1013, 11143 and 112443, using prime factorization. | 1 |
| 6346 | Find Greatest Common Divisor of 1013, 11143 and 112443, using repeated division. | 1 |
| 6347 | Find Greatest Common Divisor of 1013, 11143 and 112443, by listing out the factors. | 1 |
| 6348 | Find Greatest Common Divisor of 1013 and 11143, using Euclidean algorithm. | 1 |
| 6349 | Find Greatest Common Divisor of 196 and 245, using Euclidean algorithm. | 1 |
| 6350 | Find Greatest Common Divisor of 73556 and 3444, using Euclidean algorithm. | 1 |
