GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1251 | Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm. | 6 |
| 1252 | Find Greatest Common Divisor of 2486625522 and 41582215163, using prime factorization. | 6 |
| 1253 | Find Greatest Common Divisor of 45 and 36, using Euclidean algorithm. | 6 |
| 1254 | Find Greatest Common Divisor of 7 and 9, using prime factorization. | 6 |
| 1255 | Find Greatest Common Divisor of 123456 and 789, using prime factorization. | 6 |
| 1256 | Find Greatest Common Divisor of 93149832 and 73482, using Euclidean algorithm. | 6 |
| 1257 | Find Greatest Common Divisor of 1424 and 3084, using Euclidean algorithm. | 6 |
| 1258 | Find Greatest Common Divisor of 4788 and 31256, using Euclidean algorithm. | 6 |
| 1259 | Find Greatest Common Divisor of 12378 and 3054, using prime factorization. | 6 |
| 1260 | Find Greatest Common Divisor of 12378 and 3054, using Euclidean algorithm. | 6 |
| 1261 | Find Greatest Common Divisor of 17 and 33, using Euclidean algorithm. | 6 |
| 1262 | Find Greatest Common Divisor of 414 and 662, using prime factorization. | 6 |
| 1263 | Find Greatest Common Divisor of 6 and 36, using prime factorization. | 6 |
| 1264 | Find Greatest Common Divisor of 150, 360 and 900, using prime factorization. | 6 |
| 1265 | Find Greatest Common Divisor of 459 and 122, using prime factorization. | 6 |
| 1266 | Find Greatest Common Divisor of 19 and 160, using prime factorization. | 6 |
| 1267 | Find Greatest Common Divisor of 42 and 14, using prime factorization. | 6 |
| 1268 | Find Greatest Common Divisor of 119 and 272, using Euclidean algorithm. | 6 |
| 1269 | Find Greatest Common Divisor of 32 and 640, using Euclidean algorithm. | 6 |
| 1270 | Find Greatest Common Divisor of 504 and 385, using Euclidean algorithm. | 6 |
| 1271 | Find Greatest Common Divisor of 48 and 60, using Euclidean algorithm. | 6 |
| 1272 | Find Greatest Common Divisor of 11111 and 111111, using Euclidean algorithm. | 6 |
| 1273 | Find Greatest Common Divisor of 3, 5 and 7, using prime factorization. | 6 |
| 1274 | Find Greatest Common Divisor of 504 and 270, using Euclidean algorithm. | 6 |
| 1275 | Find Greatest Common Divisor of 4 and 5, using prime factorization. | 6 |
| 1276 | Find Greatest Common Divisor of 17 and 3120, using prime factorization. | 6 |
| 1277 | Find Greatest Common Divisor of 4131 and 2431, using Euclidean algorithm. | 6 |
| 1278 | Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm. | 6 |
| 1279 | Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm. | 6 |
| 1280 | Find Greatest Common Divisor of 35 and 192, using prime factorization. | 6 |
| 1281 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using prime factorization. | 6 |
| 1282 | Find Greatest Common Divisor of 160 and 7, using prime factorization. | 6 |
| 1283 | Find Greatest Common Divisor of 272 and 1479, using Euclidean algorithm. | 6 |
| 1284 | Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm. | 6 |
| 1285 | Find Greatest Common Divisor of 973 and 301, using prime factorization. | 6 |
| 1286 | Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization. | 6 |
| 1287 | Find Greatest Common Divisor of 58 and 72, using prime factorization. | 6 |
| 1288 | Find Greatest Common Divisor of 15, 18 and 56, using prime factorization. | 6 |
| 1289 | Find Greatest Common Divisor of 56 and 70, using prime factorization. | 6 |
| 1290 | Find Greatest Common Divisor of 21 and 10, using prime factorization. | 6 |
| 1291 | Find Greatest Common Divisor of 15210 and 10210, using Euclidean algorithm. | 6 |
| 1292 | Find Greatest Common Divisor of 15290 and 10290, using Euclidean algorithm. | 6 |
| 1293 | Find Greatest Common Divisor of 1297 and 26, by listing out the factors. | 6 |
| 1294 | Find Greatest Common Divisor of 108 and 10, using Euclidean algorithm. | 6 |
| 1295 | Find Greatest Common Divisor of 986 and 289, using Euclidean algorithm. | 6 |
| 1296 | Find Greatest Common Divisor of 11 and 72, using Euclidean algorithm. | 6 |
| 1297 | Find Greatest Common Divisor of 30 and 13, using prime factorization. | 6 |
| 1298 | Find Greatest Common Divisor of 8, 9 and 45, using prime factorization. | 6 |
| 1299 | Find Greatest Common Divisor of 29640 and 179, by listing out the factors. | 6 |
| 1300 | Find Greatest Common Divisor of 1607. | 6 |