GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 701 | Find Greatest Common Divisor of 91 and 287, using Euclidean algorithm. | 3 |
| 702 | Find Greatest Common Divisor of 15 and 13, using Euclidean algorithm. | 3 |
| 703 | Find Greatest Common Divisor of 1001 and 1331, using Euclidean algorithm. | 3 |
| 704 | Find Greatest Common Divisor of 12345 and 54321, using Euclidean algorithm. | 3 |
| 705 | Find Greatest Common Divisor of 1716 and 1260, using Euclidean algorithm. | 3 |
| 706 | Find Greatest Common Divisor of 1056 and 228, using Euclidean algorithm. | 3 |
| 707 | Find Greatest Common Divisor of 1022 and 400, using prime factorization. | 3 |
| 708 | Find Greatest Common Divisor of 377 and 2303, using prime factorization. | 3 |
| 709 | Find Greatest Common Divisor of 4001 and 2689, using Euclidean algorithm. | 3 |
| 710 | Find Greatest Common Divisor of 33 and 145, using prime factorization. | 3 |
| 711 | Find Greatest Common Divisor of 76 and 62, using Euclidean algorithm. | 3 |
| 712 | Find Greatest Common Divisor of 483 and 360, using Euclidean algorithm. | 3 |
| 713 | Find Greatest Common Divisor of 1010 and 407, using prime factorization. | 3 |
| 714 | Find Greatest Common Divisor of 12 and 8, using repeated division. | 3 |
| 715 | Find Greatest Common Divisor of 12728 and 20000, using Euclidean algorithm. | 3 |
| 716 | Find Greatest Common Divisor of 1020 and 1170, using prime factorization. | 3 |
| 717 | Find Greatest Common Divisor of 1020 and 1170, using repeated division. | 3 |
| 718 | Find Greatest Common Divisor of 13 and 8, using Euclidean algorithm. | 3 |
| 719 | Find Greatest Common Divisor of 310 and 62, using prime factorization. | 3 |
| 720 | Find Greatest Common Divisor of 296, 703 and 814, using repeated division. | 3 |
| 721 | Find Greatest Common Divisor of 45. | 3 |
| 722 | Find Greatest Common Divisor of 123456 and 789, using Euclidean algorithm. | 3 |
| 723 | Find Greatest Common Divisor of 24 and 69, using Euclidean algorithm. | 3 |
| 724 | Find Greatest Common Divisor of 3, 2 and 2, using prime factorization. | 3 |
| 725 | Find Greatest Common Divisor of 2024 and 1058, using Euclidean algorithm. | 3 |
| 726 | Find Greatest Common Divisor of 3 and 20, using prime factorization. | 3 |
| 727 | Find Greatest Common Divisor of 17 and 3120, using repeated division. | 3 |
| 728 | Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm. | 3 |
| 729 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using Euclidean algorithm. | 3 |
| 730 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using repeated division. | 3 |
| 731 | Find Greatest Common Divisor of 17 and 34, using repeated division. | 3 |
| 732 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using repeated division. | 3 |
| 733 | Find Greatest Common Divisor of 6468 and 14300, using prime factorization. | 3 |
| 734 | Find Greatest Common Divisor of 160 and 7, using repeated division. | 3 |
| 735 | Find Greatest Common Divisor of 2 and 1, using prime factorization. | 3 |
| 736 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using prime factorization. | 3 |
| 737 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, by listing out the factors. | 3 |
| 738 | Find Greatest Common Divisor of 192, 256 and 304, using prime factorization. | 3 |
| 739 | Find Greatest Common Divisor of 27, 80, 108, 20 and 75, using prime factorization. | 3 |
| 740 | Find Greatest Common Divisor of 21 and 2511, using Euclidean algorithm. | 3 |
| 741 | Find Greatest Common Divisor of 110 and 2511, using Euclidean algorithm. | 3 |
| 742 | Find Greatest Common Divisor of 112 and 144, using prime factorization. | 3 |
| 743 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, using prime factorization. | 3 |
| 744 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, by listing out the factors. | 3 |
| 745 | Find Greatest Common Divisor of 115 and 184, using prime factorization. | 3 |
| 746 | Find Greatest Common Divisor of 28 and 52, using Euclidean algorithm. | 3 |
| 747 | Find Greatest Common Divisor of 52 and 54, using repeated division. | 3 |
| 748 | Find Greatest Common Divisor of 3. | 3 |
| 749 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, by listing out the factors. | 3 |
| 750 | Find Greatest Common Divisor of 291 and 252, using repeated division. | 3 |
