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 28, 48 and 60, using prime factorization. | 1 |
| 5202 | Find Greatest Common Divisor of 33, 44 and 133, using prime factorization. | 1 |
| 5203 | Find Greatest Common Divisor of 132, 44 and 33, using prime factorization. | 1 |
| 5204 | Find Greatest Common Divisor of 47 and 13, using prime factorization. | 1 |
| 5205 | Find Greatest Common Divisor of 2142 and 11298, using prime factorization. | 1 |
| 5206 | Find Greatest Common Divisor of 2 and 24, using prime factorization. | 1 |
| 5207 | Find Greatest Common Divisor of 7 and 24, using prime factorization. | 1 |
| 5208 | Find Greatest Common Divisor of 418 and 253, using prime factorization. | 1 |
| 5209 | Find Greatest Common Divisor of 27182 and 3141, using Euclidean algorithm. | 1 |
| 5210 | Find Greatest Common Divisor of 22 and 28, using prime factorization. | 1 |
| 5211 | Find Greatest Common Divisor of 12, 5, 35 and 55, using prime factorization. | 1 |
| 5212 | Find Greatest Common Divisor of 97 and 126, using Euclidean algorithm. | 1 |
| 5213 | Find Greatest Common Divisor of 2 and 3, using Euclidean algorithm. | 1 |
| 5214 | Find Greatest Common Divisor of 2 and 48, using Euclidean algorithm. | 1 |
| 5215 | Find Greatest Common Divisor of 2 and 17, using prime factorization. | 1 |
| 5216 | Find Greatest Common Divisor of 2 and 17, using Euclidean algorithm. | 1 |
| 5217 | Find Greatest Common Divisor of 144 and 233, using Euclidean algorithm. | 1 |
| 5218 | Find Greatest Common Divisor of 91 and 63, using Euclidean algorithm. | 1 |
| 5219 | Find Greatest Common Divisor of 91 and 63, using prime factorization. | 1 |
| 5220 | Find Greatest Common Divisor of 91 and 63, using repeated division. | 1 |
| 5221 | Find Greatest Common Divisor of 91 and 63, by listing out the factors. | 1 |
| 5222 | Find Greatest Common Divisor of 16 and 24, using repeated division. | 1 |
| 5223 | Find Greatest Common Divisor of 3036. | 1 |
| 5224 | Find Greatest Common Divisor of 32768 and 272, using Euclidean algorithm. | 1 |
| 5225 | Find Greatest Common Divisor of 900 and 201, using prime factorization. | 1 |
| 5226 | Find Greatest Common Divisor of 84 and 12, using prime factorization. | 1 |
| 5227 | Find Greatest Common Divisor of 360 and 420, using prime factorization. | 1 |
| 5228 | Find Greatest Common Divisor of 32 and 24, using prime factorization. | 1 |
| 5229 | Find Greatest Common Divisor of 675 and 99, using prime factorization. | 1 |
| 5230 | Find Greatest Common Divisor of 34496 and 1936, using prime factorization. | 1 |
| 5231 | Find Greatest Common Divisor of 999 and 998, using Euclidean algorithm. | 1 |
| 5232 | Find Greatest Common Divisor of 12075 and 4655, using repeated division. | 1 |
| 5233 | Find Greatest Common Divisor of 43336 and 332, using repeated division. | 1 |
| 5234 | Find Greatest Common Divisor of 14 and 17, using prime factorization. | 1 |
| 5235 | Find Greatest Common Divisor of 297 and 100, using Euclidean algorithm. | 1 |
| 5236 | Find Greatest Common Divisor of 735 and 225, using Euclidean algorithm. | 1 |
| 5237 | Find Greatest Common Divisor of 49 and 15, using prime factorization. | 1 |
| 5238 | Find Greatest Common Divisor of 42432 and 42334, using Euclidean algorithm. | 1 |
| 5239 | Find Greatest Common Divisor of 349 and 1758, using prime factorization. | 1 |
| 5240 | Find Greatest Common Divisor of 2587 and 4345, using prime factorization. | 1 |
| 5241 | Find Greatest Common Divisor of 756 and 2587, using prime factorization. | 1 |
| 5242 | Find Greatest Common Divisor of 13. | 1 |
| 5243 | Find Greatest Common Divisor of 234 and 156, using repeated division. | 1 |
| 5244 | Find Greatest Common Divisor of 960 and 9000, using prime factorization. | 1 |
| 5245 | Find Greatest Common Divisor of 72 and 333, using Euclidean algorithm. | 1 |
| 5246 | Find Greatest Common Divisor of 102 and 785, using Euclidean algorithm. | 1 |
| 5247 | Find Greatest Common Divisor of 96, 2, 11, 29, 39 and 49, using Euclidean algorithm. | 1 |
| 5248 | Find Greatest Common Divisor of 43 and 57, using Euclidean algorithm. | 1 |
| 5249 | Find Greatest Common Divisor of 7, 4 and 6, using prime factorization. | 1 |
| 5250 | Find Greatest Common Divisor of 480 and 512, using prime factorization. | 1 |