GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6151 | Find Greatest Common Divisor of 6508 and 3465, using prime factorization. | 1 |
| 6152 | Find Greatest Common Divisor of 4148 and 7864, using Euclidean algorithm. | 1 |
| 6153 | Find Greatest Common Divisor of 36, 54, 90, 126, 9223372036854775807 and 968349, using prime factorization. | 1 |
| 6154 | Find Greatest Common Divisor of 36, 54, 90, 126 and 9912499122, using prime factorization. | 1 |
| 6155 | Find Greatest Common Divisor of 13 and 52, using repeated division. | 1 |
| 6156 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization. | 1 |
| 6157 | Find Greatest Common Divisor of 1256 and 140, using Euclidean algorithm. | 1 |
| 6158 | Find Greatest Common Divisor of 32, 8 and 56, using prime factorization. | 1 |
| 6159 | Find Greatest Common Divisor of 32, 8 and 56, using Euclidean algorithm. | 1 |
| 6160 | Find Greatest Common Divisor of 32, 8 and 56, using repeated division. | 1 |
| 6161 | Find Greatest Common Divisor of 15, 28 and 50, using prime factorization. | 1 |
| 6162 | Find Greatest Common Divisor of 5 and 63, using prime factorization. | 1 |
| 6163 | Find Greatest Common Divisor of 54 and 24, using Euclidean algorithm. | 1 |
| 6164 | Find Greatest Common Divisor of 177 and 137688, using prime factorization. | 1 |
| 6165 | Find Greatest Common Divisor of 177 and 137688, using repeated division. | 1 |
| 6166 | Find Greatest Common Divisor of 60 and 667, using prime factorization. | 1 |
| 6167 | Find Greatest Common Divisor of 35 and 15, using Euclidean algorithm. | 1 |
| 6168 | Find Greatest Common Divisor of 77 and 23, using Euclidean algorithm. | 1 |
| 6169 | Find Greatest Common Divisor of 210 and 84, using Euclidean algorithm. | 1 |
| 6170 | Find Greatest Common Divisor of 1421 and 1519, using prime factorization. | 1 |
| 6171 | Find Greatest Common Divisor of 54 and 32, using prime factorization. | 1 |
| 6172 | Find Greatest Common Divisor of 82. | 1 |
| 6173 | Find Greatest Common Divisor of 620 and 140, using prime factorization. | 1 |
| 6174 | Find Greatest Common Divisor of 50 and 32, using prime factorization. | 1 |
| 6175 | Find Greatest Common Divisor of 1529 and 14038, using prime factorization. | 1 |
| 6176 | Find Greatest Common Divisor of 1529 and 14039, using prime factorization. | 1 |
| 6177 | Find Greatest Common Divisor of 123 and 277, using prime factorization. | 1 |
| 6178 | Find Greatest Common Divisor of 358 and 309, using prime factorization. | 1 |
| 6179 | Find Greatest Common Divisor of 358 and 308, using repeated division. | 1 |
| 6180 | Find Greatest Common Divisor of 2020 and 456, using Euclidean algorithm. | 1 |
| 6181 | Find Greatest Common Divisor of 2020 and 458, using Euclidean algorithm. | 1 |
| 6182 | Find Greatest Common Divisor of 378 and 256, using prime factorization. | 1 |
| 6183 | Find Greatest Common Divisor of 4601 and 2021, using prime factorization. | 1 |
| 6184 | Find Greatest Common Divisor of 4601 and 2021, using Euclidean algorithm. | 1 |
| 6185 | Find Greatest Common Divisor of 371 and 127, using Euclidean algorithm. | 1 |
| 6186 | Find Greatest Common Divisor of 373 and 127, using Euclidean algorithm. | 1 |
| 6187 | Find Greatest Common Divisor of 232804 and 208754, using Euclidean algorithm. | 1 |
| 6188 | Find Greatest Common Divisor of 232804, 208754 and 575498, using prime factorization. | 1 |
| 6189 | Find Greatest Common Divisor of 4200, 5400 and 6660, using prime factorization. | 1 |
| 6190 | Find Greatest Common Divisor of 542832, 184756 and 360864, using prime factorization. | 1 |
| 6191 | Find Greatest Common Divisor of 90008, 320000 and 420768, using prime factorization. | 1 |
| 6192 | Find Greatest Common Divisor of 35 and 55, using prime factorization. | 1 |
| 6193 | Find Greatest Common Divisor of 5436 and 675, using repeated division. | 1 |
| 6194 | Find Greatest Common Divisor of 199 and 23, using Euclidean algorithm. | 1 |
| 6195 | Find Greatest Common Divisor of 199 and 25, using Euclidean algorithm. | 1 |
| 6196 | Find Greatest Common Divisor of 199 and 17, using Euclidean algorithm. | 1 |
| 6197 | Find Greatest Common Divisor of 1870 and 266, using Euclidean algorithm. | 1 |
| 6198 | Find Greatest Common Divisor of 1870 and 263, using Euclidean algorithm. | 1 |
| 6199 | Find Greatest Common Divisor of 1870 and 260, using Euclidean algorithm. | 1 |
| 6200 | Find Greatest Common Divisor of 1870 and 361, using Euclidean algorithm. | 1 |
