GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6351 | Find Greatest Common Divisor of 2, 25, 2 and 16, using prime factorization. | 1 |
| 6352 | Find Greatest Common Divisor of 48, 64 and 100, using prime factorization. | 1 |
| 6353 | Find Greatest Common Divisor of 790 and 169, using prime factorization. | 1 |
| 6354 | Find Greatest Common Divisor of 324 and 68, using Euclidean algorithm. | 1 |
| 6355 | Find Greatest Common Divisor of 12345 and 5040, using Euclidean algorithm. | 1 |
| 6356 | Find Greatest Common Divisor of 85672, 242 and 40, using Euclidean algorithm. | 1 |
| 6357 | Find Greatest Common Divisor of 750 and 900, using prime factorization. | 1 |
| 6358 | Find Greatest Common Divisor of 750 and 900, using Euclidean algorithm. | 1 |
| 6359 | Find Greatest Common Divisor of 4294 and 8023, using prime factorization. | 1 |
| 6360 | Find Greatest Common Divisor of 765 and 364, using Euclidean algorithm. | 1 |
| 6361 | Find Greatest Common Divisor of 888 and 11, using Euclidean algorithm. | 1 |
| 6362 | Find Greatest Common Divisor of 240 and 108, using prime factorization. | 1 |
| 6363 | Find Greatest Common Divisor of 1492 and 1066, using prime factorization. | 1 |
| 6364 | Find Greatest Common Divisor of 4999 and 1109, using Euclidean algorithm. | 1 |
| 6365 | Find Greatest Common Divisor of 83 and 47, using Euclidean algorithm. | 1 |
| 6366 | Find Greatest Common Divisor of 1732 and 5733, using prime factorization. | 1 |
| 6367 | Find Greatest Common Divisor of 17 and 220, using Euclidean algorithm. | 1 |
| 6368 | Find Greatest Common Divisor of 59840 and 85327, using prime factorization. | 1 |
| 6369 | Find Greatest Common Divisor of 85327 and 59840, using repeated division. | 1 |
| 6370 | Find Greatest Common Divisor of 240 and 180, using prime factorization. | 1 |
| 6371 | Find Greatest Common Divisor of 240 and 180, using repeated division. | 1 |
| 6372 | Find Greatest Common Divisor of 99, 198, 288 and 512, using repeated division. | 1 |
| 6373 | Find Greatest Common Divisor of 86 and 192, using prime factorization. | 1 |
| 6374 | Find Greatest Common Divisor of 7 and 5561, using Euclidean algorithm. | 1 |
| 6375 | Find Greatest Common Divisor of 81, 12 and 42, using prime factorization. | 1 |
| 6376 | Find Greatest Common Divisor of 7, 16 and 25, using prime factorization. | 1 |
| 6377 | Find Greatest Common Divisor of 6, 12 and 13, using prime factorization. | 1 |
| 6378 | Find Greatest Common Divisor of 10, 23 and 58, using prime factorization. | 1 |
| 6379 | Find Greatest Common Divisor of 27 and 15, using Euclidean algorithm. | 1 |
| 6380 | Find Greatest Common Divisor of 220 and 231, using prime factorization. | 1 |
| 6381 | Find Greatest Common Divisor of 16 and 56, using prime factorization. | 1 |
| 6382 | Find Greatest Common Divisor of 79981981272 and 8023, using Euclidean algorithm. | 1 |
| 6383 | Find Greatest Common Divisor of 2187 and 27, using prime factorization. | 1 |
| 6384 | Find Greatest Common Divisor of 15 and 11, using Euclidean algorithm. | 1 |
| 6385 | Find Greatest Common Divisor of 654160 and 51480, using prime factorization. | 1 |
| 6386 | Find Greatest Common Divisor of 60, 75 and 90, using repeated division. | 1 |
| 6387 | Find Greatest Common Divisor of 48, 92 and 140, using prime factorization. | 1 |
| 6388 | Find Greatest Common Divisor of 231 and 1575, using prime factorization. | 1 |
| 6389 | Find Greatest Common Divisor of 12344 and 15712, using Euclidean algorithm. | 1 |
| 6390 | Find Greatest Common Divisor of 28 and 35, by listing out the factors. | 1 |
| 6391 | Find Greatest Common Divisor of 216. | 1 |
| 6392 | Find Greatest Common Divisor of 60, 4 and 53, using prime factorization. | 1 |
| 6393 | Find Greatest Common Divisor of 120, 9 and 6, using prime factorization. | 1 |
| 6394 | Find Greatest Common Divisor of 256 and 248, using prime factorization. | 1 |
| 6395 | Find Greatest Common Divisor of 333 and 106, using Euclidean algorithm. | 1 |
| 6396 | Find Greatest Common Divisor of 233 and 144, using Euclidean algorithm. | 1 |
| 6397 | Find Greatest Common Divisor of 45 and 35, using Euclidean algorithm. | 1 |
| 6398 | Find Greatest Common Divisor of 55 and 35, using Euclidean algorithm. | 1 |
| 6399 | Find Greatest Common Divisor of 55 and 25, using Euclidean algorithm. | 1 |
| 6400 | Find Greatest Common Divisor of 40 and 25, using prime factorization. | 1 |
