GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6401 | Find Greatest Common Divisor of 133, 55 and 39, using prime factorization. | 1 |
| 6402 | Find Greatest Common Divisor of 91, 209 and 10, using prime factorization. | 1 |
| 6403 | Find Greatest Common Divisor of 210 and 495, using prime factorization. | 1 |
| 6404 | Find Greatest Common Divisor of 9 and 38, using prime factorization. | 1 |
| 6405 | Find Greatest Common Divisor of 153 and 114, using Euclidean algorithm. | 1 |
| 6406 | Find Greatest Common Divisor of 10236 and 244, using prime factorization. | 1 |
| 6407 | Find Greatest Common Divisor of 199 and 991, using prime factorization. | 1 |
| 6408 | Find Greatest Common Divisor of 62839955 and 500000, using Euclidean algorithm. | 1 |
| 6409 | Find Greatest Common Divisor of 875 and 1000, by listing out the factors. | 1 |
| 6410 | Find Greatest Common Divisor of 875 and 1000, using repeated division. | 1 |
| 6411 | Find Greatest Common Divisor of 850 and 1000, using repeated division. | 1 |
| 6412 | Find Greatest Common Divisor of 14828 and 24486, using Euclidean algorithm. | 1 |
| 6413 | Find Greatest Common Divisor of 69 and 115, using prime factorization. | 1 |
| 6414 | Find Greatest Common Divisor of 720 and 1280, using prime factorization. | 1 |
| 6415 | Find Greatest Common Divisor of 505 and 1815, using prime factorization. | 1 |
| 6416 | Find Greatest Common Divisor of 4393 and 4181, using prime factorization. | 1 |
| 6417 | Find Greatest Common Divisor of 2447 and 4181, using prime factorization. | 1 |
| 6418 | Find Greatest Common Divisor of 6641 and 4181, using prime factorization. | 1 |
| 6419 | Find Greatest Common Divisor of 397 and 4181, using prime factorization. | 1 |
| 6420 | Find Greatest Common Divisor of 148 and 59, using Euclidean algorithm. | 1 |
| 6421 | Find Greatest Common Divisor of 2970 and 1260, using prime factorization. | 1 |
| 6422 | Find Greatest Common Divisor of 176 and 20, using prime factorization. | 1 |
| 6423 | Find Greatest Common Divisor of 190 and 24, using prime factorization. | 1 |
| 6424 | Find Greatest Common Divisor of 29 and 80, using Euclidean algorithm. | 1 |
| 6425 | Find Greatest Common Divisor of 8935 and 15, by listing out the factors. | 1 |
| 6426 | Find Greatest Common Divisor of 192 and 8, using Euclidean algorithm. | 1 |
| 6427 | Find Greatest Common Divisor of 192 and 3, using Euclidean algorithm. | 1 |
| 6428 | Find Greatest Common Divisor of 192 and 9, using Euclidean algorithm. | 1 |
| 6429 | Find Greatest Common Divisor of 192 and 7, using prime factorization. | 1 |
| 6430 | Find Greatest Common Divisor of 192 and 11, using prime factorization. | 1 |
| 6431 | Find Greatest Common Divisor of 9223372036854775807. | 1 |
| 6432 | Find Greatest Common Divisor of 72 and 45, using prime factorization. | 1 |
| 6433 | Find Greatest Common Divisor of 252 and 291, using Euclidean algorithm. | 1 |
| 6434 | Find Greatest Common Divisor of 117 and 845, using Euclidean algorithm. | 1 |
| 6435 | Find Greatest Common Divisor of 5387 and 133, using prime factorization. | 1 |
| 6436 | Find Greatest Common Divisor of 5387 and 133, using Euclidean algorithm. | 1 |
| 6437 | Find Greatest Common Divisor of 17 and 11, using Euclidean algorithm. | 1 |
| 6438 | Find Greatest Common Divisor of 223 and 48, using prime factorization. | 1 |
| 6439 | Find Greatest Common Divisor of 111111 and 11111, using Euclidean algorithm. | 1 |
| 6440 | Find Greatest Common Divisor of 192 and 19, using Euclidean algorithm. | 1 |
| 6441 | Find Greatest Common Divisor of 32 and 623, using Euclidean algorithm. | 1 |
| 6442 | Find Greatest Common Divisor of 32 and 263, using Euclidean algorithm. | 1 |
| 6443 | Find Greatest Common Divisor of 446 and 269, using Euclidean algorithm. | 1 |
| 6444 | Find Greatest Common Divisor of 12211 and 10422, using Euclidean algorithm. | 1 |
| 6445 | Find Greatest Common Divisor of 786 and 123, using Euclidean algorithm. | 1 |
| 6446 | Find Greatest Common Divisor of 2, 4, 3, 2, 5, 2, 2, 3, 5 and 2, using prime factorization. | 1 |
| 6447 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using prime factorization. | 1 |
| 6448 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, by listing out the factors. | 1 |
| 6449 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using Euclidean algorithm. | 1 |
| 6450 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using repeated division. | 1 |
