GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7351 | Find Greatest Common Divisor of 35 and 41, using prime factorization. | 1 |
| 7352 | Find Greatest Common Divisor of 140 and 164, using prime factorization. | 1 |
| 7353 | Find Greatest Common Divisor of 72345 and 4321, using Euclidean algorithm. | 1 |
| 7354 | Find Greatest Common Divisor of 643, 210 and 162, using prime factorization. | 1 |
| 7355 | Find Greatest Common Divisor of 2592000, 840000 and 648000, using prime factorization. | 1 |
| 7356 | Find Greatest Common Divisor of 1759 and 550, using Euclidean algorithm. | 1 |
| 7357 | Find Greatest Common Divisor of 128 and 69, using Euclidean algorithm. | 1 |
| 7358 | Find Greatest Common Divisor of 1080 and 3150, using prime factorization. | 1 |
| 7359 | Find Greatest Common Divisor of 6 and 3, using repeated division. | 1 |
| 7360 | Find Greatest Common Divisor of 11111 and 111111, using repeated division. | 1 |
| 7361 | Find Greatest Common Divisor of 8 and 12, by listing out the factors. | 1 |
| 7362 | Find Greatest Common Divisor of 1296 and 1935, using prime factorization. | 1 |
| 7363 | Find Greatest Common Divisor of 11200 and 7, using prime factorization. | 1 |
| 7364 | Find Greatest Common Divisor of 11200 and 3, by listing out the factors. | 1 |
| 7365 | Find Greatest Common Divisor of 14, 44 and 15, using prime factorization. | 1 |
| 7366 | Find Greatest Common Divisor of 60, 12 and 94, using prime factorization. | 1 |
| 7367 | Find Greatest Common Divisor of 39, 25 and 12, using prime factorization. | 1 |
| 7368 | Find Greatest Common Divisor of 86, 1 and 62, using prime factorization. | 1 |
| 7369 | Find Greatest Common Divisor of 69, 86 and 16, using prime factorization. | 1 |
| 7370 | Find Greatest Common Divisor of 86, 21 and 26, using prime factorization. | 1 |
| 7371 | Find Greatest Common Divisor of 60, 92 and 91, using prime factorization. | 1 |
| 7372 | Find Greatest Common Divisor of 1, 34 and 99, using prime factorization. | 1 |
| 7373 | Find Greatest Common Divisor of 35, 87 and 82, using prime factorization. | 1 |
| 7374 | Find Greatest Common Divisor of 68, 77 and 80, using prime factorization. | 1 |
| 7375 | Find Greatest Common Divisor of 77, 93 and 7, using prime factorization. | 1 |
| 7376 | Find Greatest Common Divisor of 41, 80 and 16, using prime factorization. | 1 |
| 7377 | Find Greatest Common Divisor of 91, 65 and 80, using prime factorization. | 1 |
| 7378 | Find Greatest Common Divisor of 65, 16 and 69, using prime factorization. | 1 |
| 7379 | Find Greatest Common Divisor of 16, 10 and 62, using prime factorization. | 1 |
| 7380 | Find Greatest Common Divisor of 13, 94 and 56, using prime factorization. | 1 |
| 7381 | Find Greatest Common Divisor of 257590. | 1 |
| 7382 | Find Greatest Common Divisor of 29, 27 and 63, using prime factorization. | 1 |
| 7383 | Find Greatest Common Divisor of 75, 63 and 50, using prime factorization. | 1 |
| 7384 | Find Greatest Common Divisor of 45, 83 and 79, using repeated division. | 1 |
| 7385 | Find Greatest Common Divisor of 45, 83 and 79, by listing out the factors. | 1 |
| 7386 | Find Greatest Common Divisor of 75 and 50, using Euclidean algorithm. | 1 |
| 7387 | Find Greatest Common Divisor of 90 and 53, using Euclidean algorithm. | 1 |
| 7388 | Find Greatest Common Divisor of 82 and 72, using Euclidean algorithm. | 1 |
| 7389 | Find Greatest Common Divisor of 46 and 32, using Euclidean algorithm. | 1 |
| 7390 | Find Greatest Common Divisor of 52 and 83, using Euclidean algorithm. | 1 |
| 7391 | Find Greatest Common Divisor of 81 and 64, using Euclidean algorithm. | 1 |
| 7392 | Find Greatest Common Divisor of 2 and 67, using Euclidean algorithm. | 1 |
| 7393 | Find Greatest Common Divisor of 55 and 33, using Euclidean algorithm. | 1 |
| 7394 | Find Greatest Common Divisor of 59 and 27, using Euclidean algorithm. | 1 |
| 7395 | Find Greatest Common Divisor of 16 and 72, using Euclidean algorithm. | 1 |
| 7396 | Find Greatest Common Divisor of 72 and 51, using Euclidean algorithm. | 1 |
| 7397 | Find Greatest Common Divisor of 30 and 75, using Euclidean algorithm. | 1 |
| 7398 | Find Greatest Common Divisor of 73 and 60, using Euclidean algorithm. | 1 |
| 7399 | Find Greatest Common Divisor of 38 and 15, using Euclidean algorithm. | 1 |
| 7400 | Find Greatest Common Divisor of 24 and 44, using Euclidean algorithm. | 1 |
