GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1301 | Find Greatest Common Divisor of 17 and 276, using prime factorization. | 2 |
1302 | Find Greatest Common Divisor of 12, 15, 24 and 72, using repeated division. | 2 |
1303 | Find Greatest Common Divisor of 36, 72 and 108, using repeated division. | 2 |
1304 | Find Greatest Common Divisor of 159 and 45, using prime factorization. | 2 |
1305 | Find Greatest Common Divisor of 671 and 77, using Euclidean algorithm. | 2 |
1306 | Find Greatest Common Divisor of 120 and 150, using prime factorization. | 2 |
1307 | Find Greatest Common Divisor of 78 and 859, using Euclidean algorithm. | 2 |
1308 | Find Greatest Common Divisor of 25. | 2 |
1309 | Find Greatest Common Divisor of 25979. | 2 |
1310 | Find Greatest Common Divisor of 143 and 227, using prime factorization. | 2 |
1311 | Find Greatest Common Divisor of 143 and 227, using repeated division. | 2 |
1312 | Find Greatest Common Divisor of 728, 1196 and 2132, using repeated division. | 2 |
1313 | Find Greatest Common Divisor of 973 and 301, using prime factorization. | 2 |
1314 | Find Greatest Common Divisor of 21, 28 and 49, by listing out the factors. | 2 |
1315 | Find Greatest Common Divisor of 18 and 201, using Euclidean algorithm. | 2 |
1316 | Find Greatest Common Divisor of 2613 and 2171, using prime factorization. | 2 |
1317 | Find Greatest Common Divisor of 0 and 10, using prime factorization. | 2 |
1318 | Find Greatest Common Divisor of 6, 45 and 108, using prime factorization. | 2 |
1319 | Find Greatest Common Divisor of 34, 15 and 132, using prime factorization. | 2 |
1320 | Find Greatest Common Divisor of 192 and 1, using prime factorization. | 2 |
1321 | Find Greatest Common Divisor of 192 and 5, using prime factorization. | 2 |
1322 | Find Greatest Common Divisor of 19 and 199, using prime factorization. | 2 |
1323 | Find Greatest Common Divisor of 576, 432 and 1008, using prime factorization. | 2 |
1324 | Find Greatest Common Divisor of 294, 441 and 735, using prime factorization. | 2 |
1325 | Find Greatest Common Divisor of 117, 91 and 65, using prime factorization. | 2 |
1326 | Find Greatest Common Divisor of 450, 600 and 750, using prime factorization. | 2 |
1327 | Find Greatest Common Divisor of 242, 484 and 363, using prime factorization. | 2 |
1328 | Find Greatest Common Divisor of 80 and 144, using repeated division. | 2 |
1329 | Find Greatest Common Divisor of 85 and 6, using prime factorization. | 2 |
1330 | Find Greatest Common Divisor of 85 and 10, using prime factorization. | 2 |
1331 | Find Greatest Common Divisor of 871 and 27, using Euclidean algorithm. | 2 |
1332 | Find Greatest Common Divisor of 48 and 30, using Euclidean algorithm. | 2 |
1333 | Find Greatest Common Divisor of 140 and 15, using prime factorization. | 2 |
1334 | Find Greatest Common Divisor of 2160 and 2204, using prime factorization. | 2 |
1335 | Find Greatest Common Divisor of 13 and 41, using Euclidean algorithm. | 2 |
1336 | Find Greatest Common Divisor of 84, 36 and 75, using prime factorization. | 2 |
1337 | Find Greatest Common Divisor of 213 and 466, using prime factorization. | 2 |
1338 | Find Greatest Common Divisor of 312 and 418, using Euclidean algorithm. | 2 |
1339 | Find Greatest Common Divisor of 38. | 2 |
1340 | Find Greatest Common Divisor of 9, 12 and 4, using prime factorization. | 2 |
1341 | Find Greatest Common Divisor of 1, 2, 5 and 7, using prime factorization. | 2 |
1342 | Find Greatest Common Divisor of 2024. | 2 |
1343 | Find Greatest Common Divisor of 214. | 2 |
1344 | Find Greatest Common Divisor of 214 and 210, using prime factorization. | 2 |
1345 | Find Greatest Common Divisor of 378, 588 and 252, using prime factorization. | 2 |
1346 | Find Greatest Common Divisor of 16, 28, 32, 37, 45, 1 and 11, using Euclidean algorithm. | 2 |
1347 | Find Greatest Common Divisor of 10 and 25, using Euclidean algorithm. | 2 |
1348 | Find Greatest Common Divisor of 13, 7 and 72, using prime factorization. | 2 |
1349 | Find Greatest Common Divisor of 1340 and 1340, using prime factorization. | 2 |
1350 | Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm. | 2 |