GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5201 | Find Greatest Common Divisor of 78 and 32, using prime factorization. | 1 |
| 5202 | Find Greatest Common Divisor of 1261 and 611, using prime factorization. | 1 |
| 5203 | Find Greatest Common Divisor of 7939 and 437325, using repeated division. | 1 |
| 5204 | Find Greatest Common Divisor of 21250 and 16250, using prime factorization. | 1 |
| 5205 | Find Greatest Common Divisor of 3 and 6, using prime factorization. | 1 |
| 5206 | Find Greatest Common Divisor of 900, 666 and 198, using prime factorization. | 1 |
| 5207 | Find Greatest Common Divisor of 600, 288 and 132, using prime factorization. | 1 |
| 5208 | Find Greatest Common Divisor of 696, 148 and 199, using prime factorization. | 1 |
| 5209 | Find Greatest Common Divisor of 696, 148 and 198, using prime factorization. | 1 |
| 5210 | Find Greatest Common Divisor of 696, 148 and 196, using prime factorization. | 1 |
| 5211 | Find Greatest Common Divisor of 694, 148 and 196, using prime factorization. | 1 |
| 5212 | Find Greatest Common Divisor of 112, 270 and 252, using prime factorization. | 1 |
| 5213 | Find Greatest Common Divisor of 112, 189 and 252, using prime factorization. | 1 |
| 5214 | Find Greatest Common Divisor of 112, 378 and 252, using prime factorization. | 1 |
| 5215 | Find Greatest Common Divisor of 336, 378 and 252, using prime factorization. | 1 |
| 5216 | Find Greatest Common Divisor of 17 and 84, using prime factorization. | 1 |
| 5217 | Find Greatest Common Divisor of 17 and 84, using Euclidean algorithm. | 1 |
| 5218 | Find Greatest Common Divisor of 2025 and 1089, using repeated division. | 1 |
| 5219 | Find Greatest Common Divisor of 36 and 144, using prime factorization. | 1 |
| 5220 | Find Greatest Common Divisor of 2022 and 2, using prime factorization. | 1 |
| 5221 | Find Greatest Common Divisor of 250484713 and 250421789, using prime factorization. | 1 |
| 5222 | Find Greatest Common Divisor of 891 and 41, using Euclidean algorithm. | 1 |
| 5223 | Find Greatest Common Divisor of 5865 and 20, using Euclidean algorithm. | 1 |
| 5224 | Find Greatest Common Divisor of 108 and 12, using Euclidean algorithm. | 1 |
| 5225 | Find Greatest Common Divisor of 273 and 15, using Euclidean algorithm. | 1 |
| 5226 | Find Greatest Common Divisor of 1500 and 50, using prime factorization. | 1 |
| 5227 | Find Greatest Common Divisor of 400 and 85, using prime factorization. | 1 |
| 5228 | Find Greatest Common Divisor of 50, 180 and 168, using prime factorization. | 1 |
| 5229 | Find Greatest Common Divisor of 22 and 9615, using prime factorization. | 1 |
| 5230 | Find Greatest Common Divisor of 47 and 59, using Euclidean algorithm. | 1 |
| 5231 | Find Greatest Common Divisor of 8051 and 4040, by listing out the factors. | 1 |
| 5232 | Find Greatest Common Divisor of 168, 420 and 588, using Euclidean algorithm. | 1 |
| 5233 | Find Greatest Common Divisor of 924 and 252, using prime factorization. | 1 |
| 5234 | Find Greatest Common Divisor of 183 and 279, using repeated division. | 1 |
| 5235 | Find Greatest Common Divisor of 192 and 288, using repeated division. | 1 |
| 5236 | Find Greatest Common Divisor of 1134 and 1386, using repeated division. | 1 |
| 5237 | Find Greatest Common Divisor of 5 and 23, using prime factorization. | 1 |
| 5238 | Find Greatest Common Divisor of 252 and 432, using repeated division. | 1 |
| 5239 | Find Greatest Common Divisor of 144, 216 and 360, using repeated division. | 1 |
| 5240 | Find Greatest Common Divisor of 980 and 1876, using repeated division. | 1 |
| 5241 | Find Greatest Common Divisor of 177 and 163, using prime factorization. | 1 |
| 5242 | Find Greatest Common Divisor of 30, 36 and 45, using repeated division. | 1 |
| 5243 | Find Greatest Common Divisor of 0 and 13, using prime factorization. | 1 |
| 5244 | Find Greatest Common Divisor of 629 and 335, using Euclidean algorithm. | 1 |
| 5245 | Find Greatest Common Divisor of 101, 103, 100 and 102, using prime factorization. | 1 |
| 5246 | Find Greatest Common Divisor of 14 and 56, using prime factorization. | 1 |
| 5247 | Find Greatest Common Divisor of 408 and 672, using Euclidean algorithm. | 1 |
| 5248 | Find Greatest Common Divisor of 647 and 924, using Euclidean algorithm. | 1 |
| 5249 | Find Greatest Common Divisor of 432 and 1800, using prime factorization. | 1 |
| 5250 | Find Greatest Common Divisor of 200 and 31, using Euclidean algorithm. | 1 |
