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 510, 680 and 850, using prime factorization. | 1 |
| 6402 | Find Greatest Common Divisor of 660 and 1441, using Euclidean algorithm. | 1 |
| 6403 | Find Greatest Common Divisor of 1584 and 4968, using Euclidean algorithm. | 1 |
| 6404 | Find Greatest Common Divisor of 6, 2, 4 and 5, using prime factorization. | 1 |
| 6405 | Find Greatest Common Divisor of 110 and 2511, using prime factorization. | 1 |
| 6406 | Find Greatest Common Divisor of 180 and 252, using Euclidean algorithm. | 1 |
| 6407 | Find Greatest Common Divisor of 7 and 540, using prime factorization. | 1 |
| 6408 | Find Greatest Common Divisor of 3 and 589, using prime factorization. | 1 |
| 6409 | Find Greatest Common Divisor of 3299 and 647, using Euclidean algorithm. | 1 |
| 6410 | Find Greatest Common Divisor of 17 and 23, using Euclidean algorithm. | 1 |
| 6411 | Find Greatest Common Divisor of 21 and 31, using Euclidean algorithm. | 1 |
| 6412 | Find Greatest Common Divisor of 435, 667 and 1073, using repeated division. | 1 |
| 6413 | Find Greatest Common Divisor of 12409 and 23883, using Euclidean algorithm. | 1 |
| 6414 | Find Greatest Common Divisor of 49, 15 and 132, using prime factorization. | 1 |
| 6415 | Find Greatest Common Divisor of 47 and 97, using prime factorization. | 1 |
| 6416 | Find Greatest Common Divisor of 6, 45 and 109, using prime factorization. | 1 |
| 6417 | Find Greatest Common Divisor of 11 and 14, using prime factorization. | 1 |
| 6418 | Find Greatest Common Divisor of 242, 363 and 484, using prime factorization. | 1 |
| 6419 | Find Greatest Common Divisor of 950, 2090 and 1330, using prime factorization. | 1 |
| 6420 | Find Greatest Common Divisor of 34 and 935, using repeated division. | 1 |
| 6421 | Find Greatest Common Divisor of 609 and 1566, using prime factorization. | 1 |
| 6422 | Find Greatest Common Divisor of 112 and 144, using repeated division. | 1 |
| 6423 | Find Greatest Common Divisor of 112 and 144, using Euclidean algorithm. | 1 |
| 6424 | Find Greatest Common Divisor of 112 and 144, by listing out the factors. | 1 |
| 6425 | Find Greatest Common Divisor of 80 and 144, by listing out the factors. | 1 |
| 6426 | Find Greatest Common Divisor of 85 and 6, using Euclidean algorithm. | 1 |
| 6427 | Find Greatest Common Divisor of 361 and 580, using prime factorization. | 1 |
| 6428 | Find Greatest Common Divisor of 30 and 160, using prime factorization. | 1 |
| 6429 | Find Greatest Common Divisor of 31 and 160, using prime factorization. | 1 |
| 6430 | Find Greatest Common Divisor of 500 and 1000, using prime factorization. | 1 |
| 6431 | Find Greatest Common Divisor of 16 and 20, using repeated division. | 1 |
| 6432 | Find Greatest Common Divisor of 48 and 31, using Euclidean algorithm. | 1 |
| 6433 | Find Greatest Common Divisor of 121 and 7, using Euclidean algorithm. | 1 |
| 6434 | Find Greatest Common Divisor of 2160 and 2204, using Euclidean algorithm. | 1 |
| 6435 | Find Greatest Common Divisor of 231 and 1000, using Euclidean algorithm. | 1 |
| 6436 | Find Greatest Common Divisor of 12, 24, 42 and 60, using prime factorization. | 1 |
| 6437 | Find Greatest Common Divisor of 84, 36 and 75, using repeated division. | 1 |
| 6438 | Find Greatest Common Divisor of 213 and 466, using Euclidean algorithm. | 1 |
| 6439 | Find Greatest Common Divisor of 26453952 and 19, by listing out the factors. | 1 |
| 6440 | Find Greatest Common Divisor of 26453952 and 19, using Euclidean algorithm. | 1 |
| 6441 | Find Greatest Common Divisor of 91 and 26, using Euclidean algorithm. | 1 |
| 6442 | Find Greatest Common Divisor of 840. | 1 |
| 6443 | Find Greatest Common Divisor of 160 and 200, using prime factorization. | 1 |
| 6444 | Find Greatest Common Divisor of 3, 4, 7 and 2, using Euclidean algorithm. | 1 |
| 6445 | Find Greatest Common Divisor of 16, 28, 32, 37, 45, 1 and 11, using prime factorization. | 1 |
| 6446 | Find Greatest Common Divisor of 16 and 32, using Euclidean algorithm. | 1 |
| 6447 | Find Greatest Common Divisor of 16 and 37, using Euclidean algorithm. | 1 |
| 6448 | Find Greatest Common Divisor of 16 and 45, using Euclidean algorithm. | 1 |
| 6449 | Find Greatest Common Divisor of 16 and 1, using Euclidean algorithm. | 1 |
| 6450 | Find Greatest Common Divisor of 16 and 11, using Euclidean algorithm. | 1 |
