GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4351 | Find Greatest Common Divisor of 3026 and 259, using prime factorization. | 2 |
| 4352 | Find Greatest Common Divisor of 2025 and 1286, using Euclidean algorithm. | 2 |
| 4353 | Find Greatest Common Divisor of 3026 and 359, using Euclidean algorithm. | 2 |
| 4354 | Find Greatest Common Divisor of 3026 and 358, using Euclidean algorithm. | 2 |
| 4355 | Find Greatest Common Divisor of 58. | 2 |
| 4356 | Find Greatest Common Divisor of 192 and 25, using prime factorization. | 2 |
| 4357 | Find Greatest Common Divisor of 1029 and 793, using prime factorization. | 2 |
| 4358 | Find Greatest Common Divisor of 1127 and 829, using prime factorization. | 2 |
| 4359 | Find Greatest Common Divisor of 1448 and 808, using prime factorization. | 2 |
| 4360 | Find Greatest Common Divisor of 1463 and 712, using prime factorization. | 2 |
| 4361 | Find Greatest Common Divisor of 1216 and 608, using prime factorization. | 2 |
| 4362 | Find Greatest Common Divisor of 1003 and 708, using prime factorization. | 2 |
| 4363 | Find Greatest Common Divisor of 1487 and 987, using prime factorization. | 2 |
| 4364 | Find Greatest Common Divisor of 1032 and 502, using prime factorization. | 2 |
| 4365 | Find Greatest Common Divisor of 1203 and 743, using prime factorization. | 2 |
| 4366 | Find Greatest Common Divisor of 1112 and 836, using prime factorization. | 2 |
| 4367 | Find Greatest Common Divisor of 1252 and 537, using prime factorization. | 2 |
| 4368 | Find Greatest Common Divisor of 1392 and 528, using prime factorization. | 2 |
| 4369 | Find Greatest Common Divisor of 1056 and 504, using prime factorization. | 2 |
| 4370 | Find Greatest Common Divisor of 1458 and 582, using prime factorization. | 2 |
| 4371 | Find Greatest Common Divisor of 1008 and 502, using prime factorization. | 2 |
| 4372 | Find Greatest Common Divisor of 12, 14 and 22, using repeated division. | 2 |
| 4373 | Find Greatest Common Divisor of 49, 21 and 72, using prime factorization. | 2 |
| 4374 | Find Greatest Common Divisor of 11 and 15, using prime factorization. | 2 |
| 4375 | Find Greatest Common Divisor of 14300 and 5915, using prime factorization. | 2 |
| 4376 | Find Greatest Common Divisor of 264 and 90, using prime factorization. | 2 |
| 4377 | Find Greatest Common Divisor of 25 and 150, using Euclidean algorithm. | 2 |
| 4378 | Find Greatest Common Divisor of 720 and 17, using prime factorization. | 2 |
| 4379 | Find Greatest Common Divisor of 720 and 17, using repeated division. | 2 |
| 4380 | Find Greatest Common Divisor of 13, 650 and 100, using prime factorization. | 2 |
| 4381 | Find Greatest Common Divisor of 3712 and 1472, using prime factorization. | 2 |
| 4382 | Find Greatest Common Divisor of 2 and 5, by listing out the factors. | 2 |
| 4383 | Find Greatest Common Divisor of 15 and 4, using Euclidean algorithm. | 2 |
| 4384 | Find Greatest Common Divisor of 98 and 49, using prime factorization. | 2 |
| 4385 | Find Greatest Common Divisor of 60 and 48, using prime factorization. | 2 |
| 4386 | Find Greatest Common Divisor of 3, 6 and 2, using prime factorization. | 2 |
| 4387 | Find Greatest Common Divisor of 270 and 450, using repeated division. | 2 |
| 4388 | Find Greatest Common Divisor of 850 and 35, using repeated division. | 2 |
| 4389 | Find Greatest Common Divisor of 17 and 60, by listing out the factors. | 2 |
| 4390 | Find Greatest Common Divisor of 168 and 378, using prime factorization. | 2 |
| 4391 | Find Greatest Common Divisor of 105 and 14, by listing out the factors. | 2 |
| 4392 | Find Greatest Common Divisor of 3962 and 1589, using Euclidean algorithm. | 2 |
| 4393 | Find Greatest Common Divisor of 3962 and 1859, using Euclidean algorithm. | 2 |
| 4394 | Find Greatest Common Divisor of 1 and 2, using repeated division. | 2 |
| 4395 | Find Greatest Common Divisor of 60 and 120, using repeated division. | 2 |
| 4396 | Find Greatest Common Divisor of 45, 80, 60, 35 and 20, using prime factorization. | 2 |
| 4397 | Find Greatest Common Divisor of 1071 and 482, using Euclidean algorithm. | 2 |
| 4398 | Find Greatest Common Divisor of 5445 and 2550, using Euclidean algorithm. | 2 |
| 4399 | Find Greatest Common Divisor of 3911 and 2999, using Euclidean algorithm. | 2 |
| 4400 | Find Greatest Common Divisor of 10256 and 5420, using Euclidean algorithm. | 2 |