GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1351 | Find Greatest Common Divisor of 48 and 22, using Euclidean algorithm. | 2 |
1352 | Find Greatest Common Divisor of 2349 and 1537, using Euclidean algorithm. | 2 |
1353 | Find Greatest Common Divisor of 1172 and 88, using prime factorization. | 2 |
1354 | Find Greatest Common Divisor of 6435 and 768, using prime factorization. | 2 |
1355 | Find Greatest Common Divisor of 398 and 294, using prime factorization. | 2 |
1356 | Find Greatest Common Divisor of 1188 and 385, using Euclidean algorithm. | 2 |
1357 | Find Greatest Common Divisor of 8, 56 and 64, using prime factorization. | 2 |
1358 | Find Greatest Common Divisor of 32 and 60, using prime factorization. | 2 |
1359 | Find Greatest Common Divisor of 12 and 53, using repeated division. | 2 |
1360 | Find Greatest Common Divisor of 100 and 150, using prime factorization. | 2 |
1361 | Find Greatest Common Divisor of 84 and 96, using prime factorization. | 2 |
1362 | Find Greatest Common Divisor of 24, 45 and 5, using repeated division. | 2 |
1363 | Find Greatest Common Divisor of 3 and 84, using prime factorization. | 2 |
1364 | Find Greatest Common Divisor of 65 and 28, using prime factorization. | 2 |
1365 | Find Greatest Common Divisor of 87 and 54, using Euclidean algorithm. | 2 |
1366 | Find Greatest Common Divisor of 12 and 53, using Euclidean algorithm. | 2 |
1367 | Find Greatest Common Divisor of 1111 and 1111, using prime factorization. | 2 |
1368 | Find Greatest Common Divisor of 387 and 129, using Euclidean algorithm. | 2 |
1369 | Find Greatest Common Divisor of 398 and 294, using Euclidean algorithm. | 2 |
1370 | Find Greatest Common Divisor of 385 and 1188, using Euclidean algorithm. | 2 |
1371 | Find Greatest Common Divisor of 16 and 63, using prime factorization. | 2 |
1372 | Find Greatest Common Divisor of 38. | 2 |
1373 | Find Greatest Common Divisor of 28 and 95, using Euclidean algorithm. | 2 |
1374 | Find Greatest Common Divisor of 32 and 60, by listing out the factors. | 2 |
1375 | Find Greatest Common Divisor of 54 and 252, using prime factorization. | 2 |
1376 | Find Greatest Common Divisor of 100 and 101, using prime factorization. | 2 |
1377 | Find Greatest Common Divisor of 267, 445 and 712, using prime factorization. | 2 |
1378 | Find Greatest Common Divisor of 98304 and 162, using prime factorization. | 2 |
1379 | Find Greatest Common Divisor of 31 and 13, using Euclidean algorithm. | 2 |
1380 | Find Greatest Common Divisor of 81, 2, 8, 9 and 1, using prime factorization. | 2 |
1381 | Find Greatest Common Divisor of 1529 and 14038, using Euclidean algorithm. | 2 |
1382 | Find Greatest Common Divisor of 498304 and 162000, using prime factorization. | 2 |
1383 | Find Greatest Common Divisor of 8 and 73, using Euclidean algorithm. | 2 |
1384 | Find Greatest Common Divisor of 44 and 75, using Euclidean algorithm. | 2 |
1385 | Find Greatest Common Divisor of 1874 and 602, using prime factorization. | 2 |
1386 | Find Greatest Common Divisor of 33 and 89, using Euclidean algorithm. | 2 |
1387 | Find Greatest Common Divisor of 2, 4 and 8, using prime factorization. | 2 |
1388 | Find Greatest Common Divisor of 103 and 91, using Euclidean algorithm. | 2 |
1389 | Find Greatest Common Divisor of 267 and 165, using Euclidean algorithm. | 2 |
1390 | Find Greatest Common Divisor of 144 and 105, using prime factorization. | 2 |
1391 | Find Greatest Common Divisor of 90 and 67, using Euclidean algorithm. | 2 |
1392 | Find Greatest Common Divisor of 1009 and 958, using Euclidean algorithm. | 2 |
1393 | Find Greatest Common Divisor of 911 and 172, using prime factorization. | 2 |
1394 | Find Greatest Common Divisor of 832 and 10933, using Euclidean algorithm. | 2 |
1395 | Find Greatest Common Divisor of 3 and 105, using prime factorization. | 2 |
1396 | Find Greatest Common Divisor of 204 and 255, using prime factorization. | 2 |
1397 | Find Greatest Common Divisor of 44 and 90, using Euclidean algorithm. | 2 |
1398 | Find Greatest Common Divisor of 33 and 84, using Euclidean algorithm. | 2 |
1399 | Find Greatest Common Divisor of 527 and 646, using repeated division. | 2 |
1400 | Find Greatest Common Divisor of 6897 and 11857, using Euclidean algorithm. | 2 |