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 14 and 35, using Euclidean algorithm. | 1 |
| 5202 | Find Greatest Common Divisor of 25 and 40, using Euclidean algorithm. | 1 |
| 5203 | Find Greatest Common Divisor of 81 and 37, using Euclidean algorithm. | 1 |
| 5204 | Find Greatest Common Divisor of 452 and 6004, using prime factorization. | 1 |
| 5205 | Find Greatest Common Divisor of 270 and 292, using prime factorization. | 1 |
| 5206 | Find Greatest Common Divisor of 111111 and 11111, using prime factorization. | 1 |
| 5207 | Find Greatest Common Divisor of 504 and 7, using prime factorization. | 1 |
| 5208 | Find Greatest Common Divisor of 56 and 9, using prime factorization. | 1 |
| 5209 | Find Greatest Common Divisor of 504 and 5, using prime factorization. | 1 |
| 5210 | Find Greatest Common Divisor of 2520 and 499, using prime factorization. | 1 |
| 5211 | Find Greatest Common Divisor of 684 and 28, using Euclidean algorithm. | 1 |
| 5212 | Find Greatest Common Divisor of 224 and 44, using Euclidean algorithm. | 1 |
| 5213 | Find Greatest Common Divisor of 228 and 44, using Euclidean algorithm. | 1 |
| 5214 | Find Greatest Common Divisor of 18 and 35, using prime factorization. | 1 |
| 5215 | Find Greatest Common Divisor of 18 and 35, using repeated division. | 1 |
| 5216 | Find Greatest Common Divisor of 30 and 35, using repeated division. | 1 |
| 5217 | Find Greatest Common Divisor of 30 and 35, using Euclidean algorithm. | 1 |
| 5218 | Find Greatest Common Divisor of 18 and 35, using Euclidean algorithm. | 1 |
| 5219 | Find Greatest Common Divisor of 76290 and 26880, using prime factorization. | 1 |
| 5220 | Find Greatest Common Divisor of 2023. | 1 |
| 5221 | Find Greatest Common Divisor of 2023 and 4046, using prime factorization. | 1 |
| 5222 | Find Greatest Common Divisor of 1003 and 2006, using prime factorization. | 1 |
| 5223 | Find Greatest Common Divisor of 12 and 28, using Euclidean algorithm. | 1 |
| 5224 | Find Greatest Common Divisor of 224 and 256, using Euclidean algorithm. | 1 |
| 5225 | Find Greatest Common Divisor of 580 and 252, using prime factorization. | 1 |
| 5226 | Find Greatest Common Divisor of 2603 and 2423, using prime factorization. | 1 |
| 5227 | Find Greatest Common Divisor of 2036 and 2423, using prime factorization. | 1 |
| 5228 | Find Greatest Common Divisor of 3062 and 2423, using prime factorization. | 1 |
| 5229 | Find Greatest Common Divisor of 3026 and 243, using prime factorization. | 1 |
| 5230 | Find Greatest Common Divisor of 679 and 2019, using prime factorization. | 1 |
| 5231 | Find Greatest Common Divisor of 673 and 2019, using prime factorization. | 1 |
| 5232 | Find Greatest Common Divisor of 2025 and 1588, using Euclidean algorithm. | 1 |
| 5233 | Find Greatest Common Divisor of 8456 and 448, using prime factorization. | 1 |
| 5234 | Find Greatest Common Divisor of 3026 and 258, using Euclidean algorithm. | 1 |
| 5235 | Find Greatest Common Divisor of 4879465 and 894563, using prime factorization. | 1 |
| 5236 | Find Greatest Common Divisor of 4879464 and 894562, using prime factorization. | 1 |
| 5237 | Find Greatest Common Divisor of 4879464 and 894544, using prime factorization. | 1 |
| 5238 | Find Greatest Common Divisor of 84 and 24, using Euclidean algorithm. | 1 |
| 5239 | Find Greatest Common Divisor of 78 and 117, using prime factorization. | 1 |
| 5240 | Find Greatest Common Divisor of 64 and 864, using prime factorization. | 1 |
| 5241 | Find Greatest Common Divisor of 75 and 126, using prime factorization. | 1 |
| 5242 | Find Greatest Common Divisor of 192 and 26, using prime factorization. | 1 |
| 5243 | Find Greatest Common Divisor of 132223 and 11011, using Euclidean algorithm. | 1 |
| 5244 | Find Greatest Common Divisor of 192 and 24, using prime factorization. | 1 |
| 5245 | Find Greatest Common Divisor of 52920 and 66528, using prime factorization. | 1 |
| 5246 | Find Greatest Common Divisor of 70 and 56, using prime factorization. | 1 |
| 5247 | Find Greatest Common Divisor of 130 and 26, using Euclidean algorithm. | 1 |
| 5248 | Find Greatest Common Divisor of 822 and 436, using prime factorization. | 1 |
| 5249 | Find Greatest Common Divisor of 1123 and 932, using prime factorization. | 1 |
| 5250 | Find Greatest Common Divisor of 1174 and 559, using prime factorization. | 1 |