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 16261 and 85652, using prime factorization. | 2 |
1352 | Find Greatest Common Divisor of 84 and 96, using prime factorization. | 2 |
1353 | Find Greatest Common Divisor of 165, 45 and 5, using prime factorization. | 2 |
1354 | Find Greatest Common Divisor of 5 and 288, using prime factorization. | 2 |
1355 | Find Greatest Common Divisor of 250 and 134, using prime factorization. | 2 |
1356 | Find Greatest Common Divisor of 790 and 380, using prime factorization. | 2 |
1357 | Find Greatest Common Divisor of 2. | 2 |
1358 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using Euclidean algorithm. | 2 |
1359 | Find Greatest Common Divisor of 889 and 246, using Euclidean algorithm. | 2 |
1360 | Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm. | 2 |
1361 | Find Greatest Common Divisor of 357 and 476, using prime factorization. | 2 |
1362 | Find Greatest Common Divisor of 585 and 169, using Euclidean algorithm. | 2 |
1363 | Find Greatest Common Divisor of 12 and 24, using prime factorization. | 2 |
1364 | Find Greatest Common Divisor of 12 and 24, using Euclidean algorithm. | 2 |
1365 | Find Greatest Common Divisor of 1 and 7, using Euclidean algorithm. | 2 |
1366 | Find Greatest Common Divisor of 2947 and 3997, using Euclidean algorithm. | 2 |
1367 | Find Greatest Common Divisor of 132 and 100, using prime factorization. | 2 |
1368 | Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm. | 2 |
1369 | Find Greatest Common Divisor of 1513 and 120, using prime factorization. | 2 |
1370 | Find Greatest Common Divisor of 99 and 81, using prime factorization. | 2 |
1371 | Find Greatest Common Divisor of 5616 and 54756, using prime factorization. | 2 |
1372 | Find Greatest Common Divisor of 111 and 201, using Euclidean algorithm. | 2 |
1373 | Find Greatest Common Divisor of 3, 1 and 1, using Euclidean algorithm. | 2 |
1374 | Find Greatest Common Divisor of 16 and 35, using Euclidean algorithm. | 2 |
1375 | Find Greatest Common Divisor of 20 and 45, using prime factorization. | 2 |
1376 | Find Greatest Common Divisor of 32, 56 and 78, using repeated division. | 2 |
1377 | Find Greatest Common Divisor of 2907 and 105, using prime factorization. | 2 |
1378 | Find Greatest Common Divisor of 1330 and 42, using Euclidean algorithm. | 2 |
1379 | Find Greatest Common Divisor of 24, 12 and 36, using prime factorization. | 2 |
1380 | Find Greatest Common Divisor of 12327 and 2409, using Euclidean algorithm. | 2 |
1381 | Find Greatest Common Divisor of 2486625522 and 41582215163, by listing out the factors. | 2 |
1382 | Find Greatest Common Divisor of 492, 1353 and 615, using prime factorization. | 2 |
1383 | Find Greatest Common Divisor of 5400 and 2412, using Euclidean algorithm. | 2 |
1384 | Find Greatest Common Divisor of 6789, 1356 and 2460, using prime factorization. | 2 |
1385 | Find Greatest Common Divisor of 1342 and 5733, using prime factorization. | 2 |
1386 | Find Greatest Common Divisor of 75 and 240, using prime factorization. | 2 |
1387 | Find Greatest Common Divisor of 13 and 2197, using prime factorization. | 2 |
1388 | Find Greatest Common Divisor of 84 and 28, using prime factorization. | 2 |
1389 | Find Greatest Common Divisor of 589432167. | 2 |
1390 | Find Greatest Common Divisor of 589432167. | 2 |
1391 | Find Greatest Common Divisor of 7, 5 and 6, using prime factorization. | 2 |
1392 | Find Greatest Common Divisor of 520 and 660, using prime factorization. | 2 |
1393 | Find Greatest Common Divisor of 101 and 3267, using Euclidean algorithm. | 2 |
1394 | Find Greatest Common Divisor of 9357 and 5864, using prime factorization. | 2 |
1395 | Find Greatest Common Divisor of 52 and 130, using prime factorization. | 2 |
1396 | Find Greatest Common Divisor of 1, 9, 2, 4, 4 and 30, using prime factorization. | 2 |
1397 | Find Greatest Common Divisor of 1235 and 765, using Euclidean algorithm. | 2 |
1398 | Find Greatest Common Divisor of 16 and 63, using prime factorization. | 2 |
1399 | Find Greatest Common Divisor of 112 and 128, using prime factorization. | 2 |
1400 | Find Greatest Common Divisor of 144 and 300, using prime factorization. | 2 |