GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3451 | Find Greatest Common Divisor of 180, 396 and 468, using Euclidean algorithm. | 2 |
| 3452 | Find Greatest Common Divisor of 0 and 5, using repeated division. | 2 |
| 3453 | Find Greatest Common Divisor of 1009 and 958, using Euclidean algorithm. | 2 |
| 3454 | Find Greatest Common Divisor of 4666620000 and 6666600000, using prime factorization. | 2 |
| 3455 | Find Greatest Common Divisor of 4666620000 and 4936617300, using prime factorization. | 2 |
| 3456 | Find Greatest Common Divisor of 1124788752 and 1118788812, using prime factorization. | 2 |
| 3457 | Find Greatest Common Divisor of 1348119852 and 1340719926, using prime factorization. | 2 |
| 3458 | Find Greatest Common Divisor of 20111 and 20222, using prime factorization. | 2 |
| 3459 | Find Greatest Common Divisor of 6666600000 and 6666666666, using prime factorization. | 2 |
| 3460 | Find Greatest Common Divisor of 6666600000 and 6666666666, using repeated division. | 2 |
| 3461 | Find Greatest Common Divisor of 45 and 126, using prime factorization. | 2 |
| 3462 | Find Greatest Common Divisor of 1, 8, 0, 38, 0 and 3, using prime factorization. | 2 |
| 3463 | Find Greatest Common Divisor of 25, 45 and 55, using repeated division. | 2 |
| 3464 | Find Greatest Common Divisor of 25, 45 and 55, using Euclidean algorithm. | 2 |
| 3465 | Find Greatest Common Divisor of 25, 45 and 55, by listing out the factors. | 2 |
| 3466 | Find Greatest Common Divisor of 2957 and 400680, using repeated division. | 2 |
| 3467 | Find Greatest Common Divisor of 2957 and 400680, using prime factorization. | 2 |
| 3468 | Find Greatest Common Divisor of 2957 and 400680, using Euclidean algorithm. | 2 |
| 3469 | Find Greatest Common Divisor of 3501 and 400680, using Euclidean algorithm. | 2 |
| 3470 | Find Greatest Common Divisor of 819 and 72, using prime factorization. | 2 |
| 3471 | Find Greatest Common Divisor of 819 and 72, using repeated division. | 2 |
| 3472 | Find Greatest Common Divisor of 1, 8, 2 and 4, using prime factorization. | 2 |
| 3473 | Find Greatest Common Divisor of 1970 and 1066, using prime factorization. | 2 |
| 3474 | Find Greatest Common Divisor of 441, 567 and 693, using repeated division. | 2 |
| 3475 | Find Greatest Common Divisor of 296 and 481, using repeated division. | 2 |
| 3476 | Find Greatest Common Divisor of 98 and 96, using Euclidean algorithm. | 2 |
| 3477 | Find Greatest Common Divisor of 95 and 90, using Euclidean algorithm. | 2 |
| 3478 | Find Greatest Common Divisor of 116, 60, 98 and 109, using repeated division. | 2 |
| 3479 | Find Greatest Common Divisor of 39, 65 and 91, using prime factorization. | 2 |
| 3480 | Find Greatest Common Divisor of 120 and 112, using prime factorization. | 2 |
| 3481 | Find Greatest Common Divisor of 120 and 122, using prime factorization. | 2 |
| 3482 | Find Greatest Common Divisor of 120 and 144, using prime factorization. | 2 |
| 3483 | Find Greatest Common Divisor of 5 and 17, using prime factorization. | 2 |
| 3484 | Find Greatest Common Divisor of 5 and 17, by listing out the factors. | 2 |
| 3485 | Find Greatest Common Divisor of 534, 801 and 1335, using prime factorization. | 2 |
| 3486 | Find Greatest Common Divisor of 49, 91 and 70, using repeated division. | 2 |
| 3487 | Find Greatest Common Divisor of 527 and 646, using repeated division. | 2 |
| 3488 | Find Greatest Common Divisor of 234 and 16, using Euclidean algorithm. | 2 |
| 3489 | Find Greatest Common Divisor of 54 and 90, by listing out the factors. | 2 |
| 3490 | Find Greatest Common Divisor of 294 and 654, using Euclidean algorithm. | 2 |
| 3491 | Find Greatest Common Divisor of 455 and 210, using Euclidean algorithm. | 2 |
| 3492 | Find Greatest Common Divisor of 960 and 112, using Euclidean algorithm. | 2 |
| 3493 | Find Greatest Common Divisor of 950 and 600, using prime factorization. | 2 |
| 3494 | Find Greatest Common Divisor of 75 and 100, by listing out the factors. | 2 |
| 3495 | Find Greatest Common Divisor of 32 and 60, using prime factorization. | 2 |
| 3496 | Find Greatest Common Divisor of 32 and 60, by listing out the factors. | 2 |
| 3497 | Find Greatest Common Divisor of 58 and 32, using prime factorization. | 2 |
| 3498 | Find Greatest Common Divisor of 456 and 74, using prime factorization. | 2 |
| 3499 | Find Greatest Common Divisor of 800, 400 and 200, using repeated division. | 2 |
| 3500 | Find Greatest Common Divisor of 910 and 6517, using prime factorization. | 2 |