GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7601 | Find Greatest Common Divisor of 15 and 35, using prime factorization. | 1 |
| 7602 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using Euclidean algorithm. | 1 |
| 7603 | Find Greatest Common Divisor of 33 and 18, using prime factorization. | 1 |
| 7604 | Find Greatest Common Divisor of 123 and 65, using prime factorization. | 1 |
| 7605 | Find Greatest Common Divisor of 78 and 250, using prime factorization. | 1 |
| 7606 | Find Greatest Common Divisor of 63807, 73880 and 50840, using prime factorization. | 1 |
| 7607 | Find Greatest Common Divisor of 50, 56 and 105, using prime factorization. | 1 |
| 7608 | Find Greatest Common Divisor of 512 and 820, using prime factorization. | 1 |
| 7609 | Find Greatest Common Divisor of 13966 and 14727, using prime factorization. | 1 |
| 7610 | Find Greatest Common Divisor of 1280 and 720, using prime factorization. | 1 |
| 7611 | Find Greatest Common Divisor of 320 and 81, using repeated division. | 1 |
| 7612 | Find Greatest Common Divisor of 2435 and 342, using Euclidean algorithm. | 1 |
| 7613 | Find Greatest Common Divisor of 45 and 16, using prime factorization. | 1 |
| 7614 | Find Greatest Common Divisor of 45 and 16, using repeated division. | 1 |
| 7615 | Find Greatest Common Divisor of 45 and 16, using Euclidean algorithm. | 1 |
| 7616 | Find Greatest Common Divisor of 24 and 76, using repeated division. | 1 |
| 7617 | Find Greatest Common Divisor of 118 and 25, using Euclidean algorithm. | 1 |
| 7618 | Find Greatest Common Divisor of 89 and 442, using Euclidean algorithm. | 1 |
| 7619 | Find Greatest Common Divisor of 1955 and 29030, using Euclidean algorithm. | 1 |
| 7620 | Find Greatest Common Divisor of 96 and 144, using prime factorization. | 1 |
| 7621 | Find Greatest Common Divisor of 681 and 43, using prime factorization. | 1 |
| 7622 | Find Greatest Common Divisor of 681 and 43, using Euclidean algorithm. | 1 |
| 7623 | Find Greatest Common Divisor of 10672 and 4147, by listing out the factors. | 1 |
| 7624 | Find Greatest Common Divisor of 12 and 42, using prime factorization. | 1 |
| 7625 | Find Greatest Common Divisor of 1610 and 667, using Euclidean algorithm. | 1 |
| 7626 | Find Greatest Common Divisor of 115 and 46, using Euclidean algorithm. | 1 |
| 7627 | Find Greatest Common Divisor of 250, 148 and 316, using prime factorization. | 1 |
| 7628 | Find Greatest Common Divisor of 524 and 148, using prime factorization. | 1 |
| 7629 | Find Greatest Common Divisor of 630 and 1260, using repeated division. | 1 |
| 7630 | Find Greatest Common Divisor of 324, 378 and 1890, using repeated division. | 1 |
| 7631 | Find Greatest Common Divisor of 115 and 644, using repeated division. | 1 |
| 7632 | Find Greatest Common Divisor of 216 and 234, using Euclidean algorithm. | 1 |
| 7633 | Find Greatest Common Divisor of 84 and 36, using prime factorization. | 1 |
| 7634 | Find Greatest Common Divisor of 1794 and 2346, using prime factorization. | 1 |
| 7635 | Find Greatest Common Divisor of 557 and 239, using Euclidean algorithm. | 1 |
| 7636 | Find Greatest Common Divisor of 11, 3, 7 and 2, using prime factorization. | 1 |
| 7637 | Find Greatest Common Divisor of 29106 and 5382, using Euclidean algorithm. | 1 |
| 7638 | Find Greatest Common Divisor of 28260 and 5148, using Euclidean algorithm. | 1 |
| 7639 | Find Greatest Common Divisor of 28539 and 5088, using Euclidean algorithm. | 1 |
| 7640 | Find Greatest Common Divisor of 13 and 3, using Euclidean algorithm. | 1 |
| 7641 | Find Greatest Common Divisor of 18 and 6, using Euclidean algorithm. | 1 |
| 7642 | Find Greatest Common Divisor of 4 and 20, by listing out the factors. | 1 |
| 7643 | Find Greatest Common Divisor of 317 and 525, using prime factorization. | 1 |
| 7644 | Find Greatest Common Divisor of 289 and 377, using Euclidean algorithm. | 1 |
| 7645 | Find Greatest Common Divisor of 750, 242 and 9, using prime factorization. | 1 |
| 7646 | Find Greatest Common Divisor of 25 and 17, using Euclidean algorithm. | 1 |
| 7647 | Find Greatest Common Divisor of 9800, 420 and 2520, by listing out the factors. | 1 |
| 7648 | Find Greatest Common Divisor of 18, 12 and 24, using repeated division. | 1 |
| 7649 | Find Greatest Common Divisor of 8925 and 76576500, using prime factorization. | 1 |
| 7650 | Find Greatest Common Divisor of 169, 28, 16, 8, 160, 28, 292, 108, 56, 68, 72, 28, 124, 52 and 264, using prime factorization. | 1 |
