GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6051 | Find Greatest Common Divisor of 4378 and 2722, using prime factorization. | 1 |
| 6052 | Find Greatest Common Divisor of 42 and 154, using prime factorization. | 1 |
| 6053 | Find Greatest Common Divisor of 2722 and 2462, using prime factorization. | 1 |
| 6054 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using prime factorization. | 1 |
| 6055 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using Euclidean algorithm. | 1 |
| 6056 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using repeated division. | 1 |
| 6057 | Find Greatest Common Divisor of 1235 and 765, by listing out the factors. | 1 |
| 6058 | Find Greatest Common Divisor of 1 and 60, using prime factorization. | 1 |
| 6059 | Find Greatest Common Divisor of 1 and 60, using Euclidean algorithm. | 1 |
| 6060 | Find Greatest Common Divisor of 8000 and 3600, using Euclidean algorithm. | 1 |
| 6061 | Find Greatest Common Divisor of 50 and 20, using prime factorization. | 1 |
| 6062 | Find Greatest Common Divisor of 210, 355 and 690, using prime factorization. | 1 |
| 6063 | Find Greatest Common Divisor of 1260 and 10500, using Euclidean algorithm. | 1 |
| 6064 | Find Greatest Common Divisor of 2516 and 1125, using repeated division. | 1 |
| 6065 | Find Greatest Common Divisor of 60 and 3, by listing out the factors. | 1 |
| 6066 | Find Greatest Common Divisor of 19, 7, 29 and 7, using prime factorization. | 1 |
| 6067 | Find Greatest Common Divisor of 1243 and 26, using Euclidean algorithm. | 1 |
| 6068 | Find Greatest Common Divisor of 24, 45 and 72, using prime factorization. | 1 |
| 6069 | Find Greatest Common Divisor of 56, 78 and 90, using prime factorization. | 1 |
| 6070 | Find Greatest Common Divisor of 29 and 20, using prime factorization. | 1 |
| 6071 | Find Greatest Common Divisor of 5238 and 2425, using prime factorization. | 1 |
| 6072 | Find Greatest Common Divisor of 95, 57 and 23, using prime factorization. | 1 |
| 6073 | Find Greatest Common Divisor of 10, 20, 30, 40 and 50, using prime factorization. | 1 |
| 6074 | Find Greatest Common Divisor of 37 and 13, using prime factorization. | 1 |
| 6075 | Find Greatest Common Divisor of 299 and 256, using Euclidean algorithm. | 1 |
| 6076 | Find Greatest Common Divisor of 123987456 and 87, using prime factorization. | 1 |
| 6077 | Find Greatest Common Divisor of 1176 and 483, using prime factorization. | 1 |
| 6078 | Find Greatest Common Divisor of 2772 and 1912, using repeated division. | 1 |
| 6079 | Find Greatest Common Divisor of 2772 and 1912, using Euclidean algorithm. | 1 |
| 6080 | Find Greatest Common Divisor of 2772 and 4138, using prime factorization. | 1 |
| 6081 | Find Greatest Common Divisor of 2772 and 4148, using prime factorization. | 1 |
| 6082 | Find Greatest Common Divisor of 4144 and 2736, using prime factorization. | 1 |
| 6083 | Find Greatest Common Divisor of 1920 and 2772, using prime factorization. | 1 |
| 6084 | Find Greatest Common Divisor of 1920 and 2768, using prime factorization. | 1 |
| 6085 | Find Greatest Common Divisor of 6064 and 2768, using prime factorization. | 1 |
| 6086 | Find Greatest Common Divisor of 1029 and 420, using prime factorization. | 1 |
| 6087 | Find Greatest Common Divisor of 54 and 90, using Euclidean algorithm. | 1 |
| 6088 | Find Greatest Common Divisor of 289 and 248, using Euclidean algorithm. | 1 |
| 6089 | Find Greatest Common Divisor of 367500 and 43401015, using prime factorization. | 1 |
| 6090 | Find Greatest Common Divisor of 63 and 77, using Euclidean algorithm. | 1 |
| 6091 | Find Greatest Common Divisor of 123 and 82, using Euclidean algorithm. | 1 |
| 6092 | Find Greatest Common Divisor of 10, 8, 12 and 4, using Euclidean algorithm. | 1 |
| 6093 | Find Greatest Common Divisor of 5, 3 and 1, using prime factorization. | 1 |
| 6094 | Find Greatest Common Divisor of 143 and 111, using prime factorization. | 1 |
| 6095 | Find Greatest Common Divisor of 26 and 18, using Euclidean algorithm. | 1 |
| 6096 | Find Greatest Common Divisor of 52 and 16, using Euclidean algorithm. | 1 |
| 6097 | Find Greatest Common Divisor of 52 and 18, using Euclidean algorithm. | 1 |
| 6098 | Find Greatest Common Divisor of 486 and 52, using Euclidean algorithm. | 1 |
| 6099 | Find Greatest Common Divisor of 928 and 1220, using repeated division. | 1 |
| 6100 | Find Greatest Common Divisor of 2520 and 154, using prime factorization. | 1 |
