GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1401 | Find Greatest Common Divisor of 70, 105 and 175, using prime factorization. | 8 |
| 1402 | Find Greatest Common Divisor of 96, 144 and 192, using Euclidean algorithm. | 7 |
| 1403 | Find Greatest Common Divisor of 63 and 24, using prime factorization. | 7 |
| 1404 | Find Greatest Common Divisor of 21250 and 16250, using Euclidean algorithm. | 7 |
| 1405 | Find Greatest Common Divisor of 0 and 1, using prime factorization. | 7 |
| 1406 | Find Greatest Common Divisor of 466 and 267, using prime factorization. | 7 |
| 1407 | Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, using prime factorization. | 7 |
| 1408 | Find Greatest Common Divisor of 875 and 1000, using prime factorization. | 7 |
| 1409 | Find Greatest Common Divisor of 8 and 5, using prime factorization. | 7 |
| 1410 | Find Greatest Common Divisor of 1230 and 32, using prime factorization. | 7 |
| 1411 | Find Greatest Common Divisor of 26 and 30, using prime factorization. | 7 |
| 1412 | Find Greatest Common Divisor of 2 and 720, using prime factorization. | 7 |
| 1413 | Find Greatest Common Divisor of 9 and 207, using prime factorization. | 7 |
| 1414 | Find Greatest Common Divisor of 19 and 38, using prime factorization. | 7 |
| 1415 | Find Greatest Common Divisor of 30 and 32, using prime factorization. | 7 |
| 1416 | Find Greatest Common Divisor of 225 and 24, using prime factorization. | 7 |
| 1417 | Find Greatest Common Divisor of 68 and 4, using prime factorization. | 7 |
| 1418 | Find Greatest Common Divisor of 86 and 30, using prime factorization. | 7 |
| 1419 | Find Greatest Common Divisor of 48, 36 and 124, using prime factorization. | 7 |
| 1420 | Find Greatest Common Divisor of 60 and 65, using prime factorization. | 7 |
| 1421 | Find Greatest Common Divisor of 1563 and 390, using prime factorization. | 7 |
| 1422 | Find Greatest Common Divisor of 70 and 4, using prime factorization. | 7 |
| 1423 | Find Greatest Common Divisor of 104 and 12, using prime factorization. | 7 |
| 1424 | Find Greatest Common Divisor of 78 and 46, using prime factorization. | 7 |
| 1425 | Find Greatest Common Divisor of 475 and 100, using prime factorization. | 7 |
| 1426 | Find Greatest Common Divisor of 244 and 24, using prime factorization. | 7 |
| 1427 | Find Greatest Common Divisor of 270 and 8, using prime factorization. | 7 |
| 1428 | Find Greatest Common Divisor of 18 and 20, using prime factorization. | 7 |
| 1429 | Find Greatest Common Divisor of 32 and 22, using prime factorization. | 7 |
| 1430 | Find Greatest Common Divisor of 36 and 18, using prime factorization. | 7 |
| 1431 | Find Greatest Common Divisor of 1176 and 504, using prime factorization. | 7 |
| 1432 | Find Greatest Common Divisor of 30 and 50, using prime factorization. | 7 |
| 1433 | Find Greatest Common Divisor of 75 and 20, using prime factorization. | 7 |
| 1434 | Find Greatest Common Divisor of 300 and 1600, using prime factorization. | 7 |
| 1435 | Find Greatest Common Divisor of 46 and 6, using prime factorization. | 7 |
| 1436 | Find Greatest Common Divisor of 2 and 110, using prime factorization. | 7 |
| 1437 | Find Greatest Common Divisor of 14 and 35, using prime factorization. | 7 |
| 1438 | Find Greatest Common Divisor of 24140 and 16762, using Euclidean algorithm. | 7 |
| 1439 | Find Greatest Common Divisor of 98 and 273, using prime factorization. | 7 |
| 1440 | Find Greatest Common Divisor of 16261 and 85652, using Euclidean algorithm. | 7 |
| 1441 | Find Greatest Common Divisor of 133 and 28, using Euclidean algorithm. | 7 |
| 1442 | Find Greatest Common Divisor of 1160718174 and 316258250, using repeated division. | 7 |
| 1443 | Find Greatest Common Divisor of 24 and 138, using Euclidean algorithm. | 7 |
| 1444 | Find Greatest Common Divisor of 4 and 5, using prime factorization. | 7 |
| 1445 | Find Greatest Common Divisor of 330 and 156, using Euclidean algorithm. | 7 |
| 1446 | Find Greatest Common Divisor of 160 and 7, using prime factorization. | 7 |
| 1447 | Find Greatest Common Divisor of 291 and 252, using prime factorization. | 7 |
| 1448 | Find Greatest Common Divisor of 104 and 64, using repeated division. | 7 |
| 1449 | Find Greatest Common Divisor of 25. | 7 |
| 1450 | Find Greatest Common Divisor of 0, 30, 0, 45, 0 and 60, using prime factorization. | 7 |