GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1301 | Find Greatest Common Divisor of 657 and 143, using Euclidean algorithm. | 2 |
1302 | Find Greatest Common Divisor of 13 and 16, by listing out the factors. | 2 |
1303 | Find Greatest Common Divisor of 13 and 16, using prime factorization. | 2 |
1304 | Find Greatest Common Divisor of 13 and 16, using repeated division. | 2 |
1305 | Find Greatest Common Divisor of 13 and 16, using Euclidean algorithm. | 2 |
1306 | Find Greatest Common Divisor of 16 and 31, using prime factorization. | 2 |
1307 | Find Greatest Common Divisor of 16 and 31, by listing out the factors. | 2 |
1308 | Find Greatest Common Divisor of 102 and 221, using prime factorization. | 2 |
1309 | Find Greatest Common Divisor of 102, 170 and 255, using repeated division. | 2 |
1310 | Find Greatest Common Divisor of 102, 170 and 255, by listing out the factors. | 2 |
1311 | Find Greatest Common Divisor of 28, 32 and 48, using prime factorization. | 2 |
1312 | Find Greatest Common Divisor of 165 and 53, using Euclidean algorithm. | 2 |
1313 | Find Greatest Common Divisor of 165 and 53, using prime factorization. | 2 |
1314 | Find Greatest Common Divisor of 19, 29, 35, 36, 44 and 16, using prime factorization. | 2 |
1315 | Find Greatest Common Divisor of 19, 29, 35, 36, 44 and 16, by listing out the factors. | 2 |
1316 | Find Greatest Common Divisor of 442 and 272, using Euclidean algorithm. | 2 |
1317 | Find Greatest Common Divisor of 267 and 165, using Euclidean algorithm. | 2 |
1318 | Find Greatest Common Divisor of 536 and 216, using Euclidean algorithm. | 2 |
1319 | Find Greatest Common Divisor of 5, 70, 1 and 84, using prime factorization. | 2 |
1320 | Find Greatest Common Divisor of 1, 2, 12, 30, 33 and 6, using prime factorization. | 2 |
1321 | Find Greatest Common Divisor of 1, 2, 12, 30, 33 and 6, by listing out the factors. | 2 |
1322 | Find Greatest Common Divisor of 98304 and 162, using prime factorization. | 2 |
1323 | Find Greatest Common Divisor of 498304 and 162000, using prime factorization. | 2 |
1324 | Find Greatest Common Divisor of 195 and 340, using Euclidean algorithm. | 2 |
1325 | Find Greatest Common Divisor of 196 and 340, using Euclidean algorithm. | 2 |
1326 | Find Greatest Common Divisor of 196 and 249, using Euclidean algorithm. | 2 |
1327 | Find Greatest Common Divisor of 196 and 250, using Euclidean algorithm. | 2 |
1328 | Find Greatest Common Divisor of 196 and 262, using Euclidean algorithm. | 2 |
1329 | Find Greatest Common Divisor of 210 and 23, using prime factorization. | 2 |
1330 | Find Greatest Common Divisor of 210, 230, 250 and 270, using prime factorization. | 2 |
1331 | Find Greatest Common Divisor of 154 and 7, using Euclidean algorithm. | 2 |
1332 | Find Greatest Common Divisor of 201 and 10, using Euclidean algorithm. | 2 |
1333 | Find Greatest Common Divisor of 3566 and 3444, using prime factorization. | 2 |
1334 | Find Greatest Common Divisor of 1540 and 10, using Euclidean algorithm. | 2 |
1335 | Find Greatest Common Divisor of 3556 and 3444, using prime factorization. | 2 |
1336 | Find Greatest Common Divisor of 750 and 5, using Euclidean algorithm. | 2 |
1337 | Find Greatest Common Divisor of 154 and 7, using repeated division. | 2 |
1338 | Find Greatest Common Divisor of 73556 and 3444, using repeated division. | 2 |
1339 | Find Greatest Common Divisor of 60 and 36, using Euclidean algorithm. | 2 |
1340 | Find Greatest Common Divisor of 60 and 36, by listing out the factors. | 2 |
1341 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, by listing out the factors. | 2 |
1342 | Find Greatest Common Divisor of 1080, 1260 and 3150, using prime factorization. | 2 |
1343 | Find Greatest Common Divisor of 34 and 52, using prime factorization. | 2 |
1344 | Find Greatest Common Divisor of 34 and 52, using Euclidean algorithm. | 2 |
1345 | Find Greatest Common Divisor of 1 and 3, using Euclidean algorithm. | 2 |
1346 | Find Greatest Common Divisor of 828 and 945, using Euclidean algorithm. | 2 |
1347 | Find Greatest Common Divisor of 8, 13, 39, 42 and 48, using prime factorization. | 2 |
1348 | Find Greatest Common Divisor of 8, 13, 39, 42, 48 and 11, by listing out the factors. | 2 |
1349 | Find Greatest Common Divisor of 8, 13, 39, 42, 48 and 11, using prime factorization. | 2 |
1350 | Find Greatest Common Divisor of 23 and 177, using prime factorization. | 2 |