GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7001 | Find Greatest Common Divisor of 622 and 42, using prime factorization. | 1 |
| 7002 | Find Greatest Common Divisor of 51 and 30, using prime factorization. | 1 |
| 7003 | Find Greatest Common Divisor of 129 and 3, using prime factorization. | 1 |
| 7004 | Find Greatest Common Divisor of 58 and 76, using prime factorization. | 1 |
| 7005 | Find Greatest Common Divisor of 5 and 500, using prime factorization. | 1 |
| 7006 | Find Greatest Common Divisor of 225 and 50, using prime factorization. | 1 |
| 7007 | Find Greatest Common Divisor of 122 and 2, using prime factorization. | 1 |
| 7008 | Find Greatest Common Divisor of 2 and 96, using prime factorization. | 1 |
| 7009 | Find Greatest Common Divisor of 84 and 8, using prime factorization. | 1 |
| 7010 | Find Greatest Common Divisor of 100 and 8, using prime factorization. | 1 |
| 7011 | Find Greatest Common Divisor of 3, 184, 4, 776, 7 and 960, using prime factorization. | 1 |
| 7012 | Find Greatest Common Divisor of 283 and 172, using prime factorization. | 1 |
| 7013 | Find Greatest Common Divisor of 283 and 172, using Euclidean algorithm. | 1 |
| 7014 | Find Greatest Common Divisor of 2026 and 251, using Euclidean algorithm. | 1 |
| 7015 | Find Greatest Common Divisor of 2064 and 251, using Euclidean algorithm. | 1 |
| 7016 | Find Greatest Common Divisor of 251 and 73, using Euclidean algorithm. | 1 |
| 7017 | Find Greatest Common Divisor of 251 and 75, using Euclidean algorithm. | 1 |
| 7018 | Find Greatest Common Divisor of 461 and 57, using Euclidean algorithm. | 1 |
| 7019 | Find Greatest Common Divisor of 462 and 58, using Euclidean algorithm. | 1 |
| 7020 | Find Greatest Common Divisor of 394 and 58, using Euclidean algorithm. | 1 |
| 7021 | Find Greatest Common Divisor of 399 and 58, using Euclidean algorithm. | 1 |
| 7022 | Find Greatest Common Divisor of 399 and 57, using Euclidean algorithm. | 1 |
| 7023 | Find Greatest Common Divisor of 613 and 97, using Euclidean algorithm. | 1 |
| 7024 | Find Greatest Common Divisor of 513 and 81, using Euclidean algorithm. | 1 |
| 7025 | Find Greatest Common Divisor of 513 and 83, using Euclidean algorithm. | 1 |
| 7026 | Find Greatest Common Divisor of 519 and 83, using Euclidean algorithm. | 1 |
| 7027 | Find Greatest Common Divisor of 581 and 26, using Euclidean algorithm. | 1 |
| 7028 | Find Greatest Common Divisor of 581 and 29, using Euclidean algorithm. | 1 |
| 7029 | Find Greatest Common Divisor of 581 and 57, using Euclidean algorithm. | 1 |
| 7030 | Find Greatest Common Divisor of 581 and 47, using Euclidean algorithm. | 1 |
| 7031 | Find Greatest Common Divisor of 581 and 97, using Euclidean algorithm. | 1 |
| 7032 | Find Greatest Common Divisor of 588 and 92, using Euclidean algorithm. | 1 |
| 7033 | Find Greatest Common Divisor of 418 and 92, using Euclidean algorithm. | 1 |
| 7034 | Find Greatest Common Divisor of 416 and 92, using Euclidean algorithm. | 1 |
| 7035 | Find Greatest Common Divisor of 516 and 94, using Euclidean algorithm. | 1 |
| 7036 | Find Greatest Common Divisor of 518 and 194, using Euclidean algorithm. | 1 |
| 7037 | Find Greatest Common Divisor of 518 and 172, using Euclidean algorithm. | 1 |
| 7038 | Find Greatest Common Divisor of 598 and 172, using Euclidean algorithm. | 1 |
| 7039 | Find Greatest Common Divisor of 1071 and 577, using Euclidean algorithm. | 1 |
| 7040 | Find Greatest Common Divisor of 1071 and 588, using Euclidean algorithm. | 1 |
| 7041 | Find Greatest Common Divisor of 128 and 34, using prime factorization. | 1 |
| 7042 | Find Greatest Common Divisor of 128 and 54, using Euclidean algorithm. | 1 |
| 7043 | Find Greatest Common Divisor of 875 and 288, using prime factorization. | 1 |
| 7044 | Find Greatest Common Divisor of 345 and 234, using repeated division. | 1 |
| 7045 | Find Greatest Common Divisor of 8466 and 7684, using prime factorization. | 1 |
