GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1351 | Find Greatest Common Divisor of 143 and 227, using Euclidean algorithm. | 5 |
| 1352 | Find Greatest Common Divisor of 42 and 78, using prime factorization. | 5 |
| 1353 | Find Greatest Common Divisor of 42 and 78, using repeated division. | 5 |
| 1354 | Find Greatest Common Divisor of 147 and 21, using prime factorization. | 5 |
| 1355 | Find Greatest Common Divisor of 534 and 50, using prime factorization. | 5 |
| 1356 | Find Greatest Common Divisor of 80 and 10, using prime factorization. | 5 |
| 1357 | Find Greatest Common Divisor of 39 and 13, using prime factorization. | 5 |
| 1358 | Find Greatest Common Divisor of 69 and 6, using prime factorization. | 5 |
| 1359 | Find Greatest Common Divisor of 254 and 70, using prime factorization. | 5 |
| 1360 | Find Greatest Common Divisor of 30 and 40, using prime factorization. | 5 |
| 1361 | Find Greatest Common Divisor of 2735. | 5 |
| 1362 | Find Greatest Common Divisor of 36 and 20, using repeated division. | 5 |
| 1363 | Find Greatest Common Divisor of 257. | 5 |
| 1364 | Find Greatest Common Divisor of 10 and 1120, using prime factorization. | 5 |
| 1365 | Find Greatest Common Divisor of 23 and 46, using prime factorization. | 5 |
| 1366 | Find Greatest Common Divisor of 143 and 91, using repeated division. | 5 |
| 1367 | Find Greatest Common Divisor of 24 and 4, using prime factorization. | 5 |
| 1368 | Find Greatest Common Divisor of 90 and 252, using Euclidean algorithm. | 5 |
| 1369 | Find Greatest Common Divisor of 90 and 252, using prime factorization. | 5 |
| 1370 | Find Greatest Common Divisor of 90 and 252, using repeated division. | 5 |
| 1371 | Find Greatest Common Divisor of 7 and 8, using repeated division. | 5 |
| 1372 | Find Greatest Common Divisor of 2 and 64, using prime factorization. | 5 |
| 1373 | Find Greatest Common Divisor of 52 and 6, using prime factorization. | 5 |
| 1374 | Find Greatest Common Divisor of 26 and 30, using prime factorization. | 5 |
| 1375 | Find Greatest Common Divisor of 2 and 720, using prime factorization. | 5 |
| 1376 | Find Greatest Common Divisor of 10 and 104, using prime factorization. | 5 |
| 1377 | Find Greatest Common Divisor of 30 and 32, using prime factorization. | 5 |
| 1378 | Find Greatest Common Divisor of 225 and 24, using prime factorization. | 5 |
| 1379 | Find Greatest Common Divisor of 100 and 45, using prime factorization. | 5 |
| 1380 | Find Greatest Common Divisor of 147 and 57, using prime factorization. | 5 |
| 1381 | Find Greatest Common Divisor of 2009 and 7, using prime factorization. | 5 |
| 1382 | Find Greatest Common Divisor of 80 and 12, using prime factorization. | 5 |
| 1383 | Find Greatest Common Divisor of 105 and 20, using prime factorization. | 5 |
| 1384 | Find Greatest Common Divisor of 27 and 39, using prime factorization. | 5 |
| 1385 | Find Greatest Common Divisor of 118 and 2, using prime factorization. | 5 |
| 1386 | Find Greatest Common Divisor of 16 and 352, using prime factorization. | 5 |
| 1387 | Find Greatest Common Divisor of 108 and 70, using prime factorization. | 5 |
| 1388 | Find Greatest Common Divisor of 171 and 9, using prime factorization. | 5 |
| 1389 | Find Greatest Common Divisor of 453 and 12, using prime factorization. | 5 |
| 1390 | Find Greatest Common Divisor of 81 and 36, using repeated division. | 5 |
| 1391 | Find Greatest Common Divisor of 81 and 36, by listing out the factors. | 5 |
| 1392 | Find Greatest Common Divisor of 2133132421. | 5 |
| 1393 | Find Greatest Common Divisor of 2133132421. | 5 |
| 1394 | Find Greatest Common Divisor of 24 and 46, using Euclidean algorithm. | 5 |
| 1395 | Find Greatest Common Divisor of 630 and 494, using prime factorization. | 5 |
| 1396 | Find Greatest Common Divisor of 102 and 60, using prime factorization. | 5 |
| 1397 | Find Greatest Common Divisor of 10092 and 1654, using Euclidean algorithm. | 5 |
| 1398 | Find Greatest Common Divisor of 1999 and 299, using Euclidean algorithm. | 5 |
| 1399 | Find Greatest Common Divisor of 22800 and 15200, using prime factorization. | 5 |
| 1400 | Find Greatest Common Divisor of 96, 112 and 144, by listing out the factors. | 5 |