GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6001 | Find Greatest Common Divisor of 334 and 233, using Euclidean algorithm. | 1 |
| 6002 | Find Greatest Common Divisor of 889 and 246, using repeated division. | 1 |
| 6003 | Find Greatest Common Divisor of 230 and 136, using Euclidean algorithm. | 1 |
| 6004 | Find Greatest Common Divisor of 279 and 250, using Euclidean algorithm. | 1 |
| 6005 | Find Greatest Common Divisor of 77 and 40, using prime factorization. | 1 |
| 6006 | Find Greatest Common Divisor of 1597 and 5702887, using Euclidean algorithm. | 1 |
| 6007 | Find Greatest Common Divisor of 30, 50 and 45, using prime factorization. | 1 |
| 6008 | Find Greatest Common Divisor of 495. | 1 |
| 6009 | Find Greatest Common Divisor of 10497600 and 4840, using prime factorization. | 1 |
| 6010 | Find Greatest Common Divisor of 587 and 345, using prime factorization. | 1 |
| 6011 | Find Greatest Common Divisor of 587 and 345, using Euclidean algorithm. | 1 |
| 6012 | Find Greatest Common Divisor of 288 and 29, using Euclidean algorithm. | 1 |
| 6013 | Find Greatest Common Divisor of 3672 and 595, using prime factorization. | 1 |
| 6014 | Find Greatest Common Divisor of 412 and 88, using prime factorization. | 1 |
| 6015 | Find Greatest Common Divisor of 1100 and 4231, using Euclidean algorithm. | 1 |
| 6016 | Find Greatest Common Divisor of 80 and 340, using prime factorization. | 1 |
| 6017 | Find Greatest Common Divisor of 5 and 12, using prime factorization. | 1 |
| 6018 | Find Greatest Common Divisor of 410, 1394 and 3034, using prime factorization. | 1 |
| 6019 | Find Greatest Common Divisor of 20 and 32, using Euclidean algorithm. | 1 |
| 6020 | Find Greatest Common Divisor of 16 and 35, using repeated division. | 1 |
| 6021 | Find Greatest Common Divisor of 16 and 35, by listing out the factors. | 1 |
| 6022 | Find Greatest Common Divisor of 114 and 522, using prime factorization. | 1 |
| 6023 | Find Greatest Common Divisor of 11, 7, 3 and 2, using prime factorization. | 1 |
| 6024 | Find Greatest Common Divisor of 10 and 2520, using Euclidean algorithm. | 1 |
| 6025 | Find Greatest Common Divisor of 8, 32 and 64, using prime factorization. | 1 |
| 6026 | Find Greatest Common Divisor of 8, 32 and 64, using repeated division. | 1 |
| 6027 | Find Greatest Common Divisor of 32, 56 and 78, using prime factorization. | 1 |
| 6028 | Find Greatest Common Divisor of 24, 12 and 36, using repeated division. | 1 |
| 6029 | Find Greatest Common Divisor of 334. | 1 |
| 6030 | Find Greatest Common Divisor of 12327 and 2409, using prime factorization. | 1 |
| 6031 | Find Greatest Common Divisor of 75 and 405, using prime factorization. | 1 |
| 6032 | Find Greatest Common Divisor of 7 and 16, using prime factorization. | 1 |
| 6033 | Find Greatest Common Divisor of 248625 and 415822, using prime factorization. | 1 |
| 6034 | Find Greatest Common Divisor of 295822 and 128625, using prime factorization. | 1 |
| 6035 | Find Greatest Common Divisor of 2486625522 and 41582215163, using Euclidean algorithm. | 1 |
| 6036 | Find Greatest Common Divisor of 248662 and 415822, by listing out the factors. | 1 |
| 6037 | Find Greatest Common Divisor of 248657 and 415822, using repeated division. | 1 |
| 6038 | Find Greatest Common Divisor of 2189 and 121, using Euclidean algorithm. | 1 |
| 6039 | Find Greatest Common Divisor of 1911 and 825, using Euclidean algorithm. | 1 |
| 6040 | Find Greatest Common Divisor of 1911 and 825, using prime factorization. | 1 |
| 6041 | Find Greatest Common Divisor of 4, 5, 7, 5, 11 and 25, using prime factorization. | 1 |
| 6042 | Find Greatest Common Divisor of 9 and 35000, using prime factorization. | 1 |
| 6043 | Find Greatest Common Divisor of 4, 0 and 808, using prime factorization. | 1 |
| 6044 | Find Greatest Common Divisor of 1760 and 2080, using prime factorization. | 1 |
| 6045 | Find Greatest Common Divisor of 10 and 4, using Euclidean algorithm. | 1 |
| 6046 | Find Greatest Common Divisor of 12 and 33, using Euclidean algorithm. | 1 |
| 6047 | Find Greatest Common Divisor of 388, 576 and 7164, using Euclidean algorithm. | 1 |
| 6048 | Find Greatest Common Divisor of 388, 576 and 7164, by listing out the factors. | 1 |
| 6049 | Find Greatest Common Divisor of 101 and 3267, using prime factorization. | 1 |
| 6050 | Find Greatest Common Divisor of 101 and 3267, using repeated division. | 1 |
