GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 8351 | Find Greatest Common Divisor of 361 and 580, using prime factorization. | 1 |
| 8352 | Find Greatest Common Divisor of 30 and 160, using prime factorization. | 1 |
| 8353 | Find Greatest Common Divisor of 31 and 160, using prime factorization. | 1 |
| 8354 | Find Greatest Common Divisor of 500 and 1000, using prime factorization. | 1 |
| 8355 | Find Greatest Common Divisor of 16 and 20, using repeated division. | 1 |
| 8356 | Find Greatest Common Divisor of 48 and 31, using Euclidean algorithm. | 1 |
| 8357 | Find Greatest Common Divisor of 121 and 7, using Euclidean algorithm. | 1 |
| 8358 | Find Greatest Common Divisor of 2160 and 2204, using Euclidean algorithm. | 1 |
| 8359 | Find Greatest Common Divisor of 231 and 1000, using Euclidean algorithm. | 1 |
| 8360 | Find Greatest Common Divisor of 12, 24, 42 and 60, using prime factorization. | 1 |
| 8361 | Find Greatest Common Divisor of 84, 36 and 75, using repeated division. | 1 |
| 8362 | Find Greatest Common Divisor of 213 and 466, using Euclidean algorithm. | 1 |
| 8363 | Find Greatest Common Divisor of 26453952 and 19, by listing out the factors. | 1 |
| 8364 | Find Greatest Common Divisor of 26453952 and 19, using Euclidean algorithm. | 1 |
| 8365 | Find Greatest Common Divisor of 91 and 26, using Euclidean algorithm. | 1 |
| 8366 | Find Greatest Common Divisor of 840. | 1 |
| 8367 | Find Greatest Common Divisor of 160 and 200, using prime factorization. | 1 |
| 8368 | Find Greatest Common Divisor of 3, 4, 7 and 2, using Euclidean algorithm. | 1 |
| 8369 | Find Greatest Common Divisor of 16, 28, 32, 37, 45, 1 and 11, using prime factorization. | 1 |
| 8370 | Find Greatest Common Divisor of 16 and 32, using Euclidean algorithm. | 1 |
| 8371 | Find Greatest Common Divisor of 16 and 37, using Euclidean algorithm. | 1 |
| 8372 | Find Greatest Common Divisor of 16 and 45, using Euclidean algorithm. | 1 |
| 8373 | Find Greatest Common Divisor of 16 and 1, using Euclidean algorithm. | 1 |
| 8374 | Find Greatest Common Divisor of 16 and 11, using Euclidean algorithm. | 1 |
| 8375 | Find Greatest Common Divisor of 15 and 20, using Euclidean algorithm. | 1 |
| 8376 | Find Greatest Common Divisor of 15 and 33, using Euclidean algorithm. | 1 |
| 8377 | Find Greatest Common Divisor of 15 and 36, using Euclidean algorithm. | 1 |
| 8378 | Find Greatest Common Divisor of 15 and 46, using Euclidean algorithm. | 1 |
| 8379 | Find Greatest Common Divisor of 15 and 8, using Euclidean algorithm. | 1 |
| 8380 | Find Greatest Common Divisor of 15 and 22, using Euclidean algorithm. | 1 |
| 8381 | Find Greatest Common Divisor of 15 and 23, using Euclidean algorithm. | 1 |
| 8382 | Find Greatest Common Divisor of 15 and 24, using Euclidean algorithm. | 1 |
| 8383 | Find Greatest Common Divisor of 15 and 25, using Euclidean algorithm. | 1 |
| 8384 | Find Greatest Common Divisor of 15 and 26, using Euclidean algorithm. | 1 |
| 8385 | Find Greatest Common Divisor of 15 and 27, using Euclidean algorithm. | 1 |
| 8386 | Find Greatest Common Divisor of 10 and 21, using Euclidean algorithm. | 1 |
| 8387 | Find Greatest Common Divisor of 10 and 22, using Euclidean algorithm. | 1 |
| 8388 | Find Greatest Common Divisor of 10 and 23, using Euclidean algorithm. | 1 |
| 8389 | Find Greatest Common Divisor of 10 and 24, using Euclidean algorithm. | 1 |
| 8390 | Find Greatest Common Divisor of 10 and 26, using Euclidean algorithm. | 1 |
| 8391 | Find Greatest Common Divisor of 10 and 27, using Euclidean algorithm. | 1 |
| 8392 | Find Greatest Common Divisor of 10 and 28, using Euclidean algorithm. | 1 |
| 8393 | Find Greatest Common Divisor of 11 and 20, using Euclidean algorithm. | 1 |
| 8394 | Find Greatest Common Divisor of 11 and 28, using Euclidean algorithm. | 1 |
