GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 801 | Find Greatest Common Divisor of 210 and 315, using prime factorization. | 3 |
| 802 | Find Greatest Common Divisor of 15 and 13, using Euclidean algorithm. | 3 |
| 803 | Find Greatest Common Divisor of 316 and 180, using prime factorization. | 3 |
| 804 | Find Greatest Common Divisor of 13 and 8, using Euclidean algorithm. | 3 |
| 805 | Find Greatest Common Divisor of 44 and 17, using Euclidean algorithm. | 3 |
| 806 | Find Greatest Common Divisor of 51 and 3, using prime factorization. | 3 |
| 807 | Find Greatest Common Divisor of 483 and 360, using Euclidean algorithm. | 3 |
| 808 | Find Greatest Common Divisor of 84 and 320, using Euclidean algorithm. | 3 |
| 809 | Find Greatest Common Divisor of 13 and 7, using prime factorization. | 3 |
| 810 | Find Greatest Common Divisor of 20 and 2, using prime factorization. | 3 |
| 811 | Find Greatest Common Divisor of 1022 and 400, using prime factorization. | 3 |
| 812 | Find Greatest Common Divisor of 432, 576 and 1008, using Euclidean algorithm. | 3 |
| 813 | Find Greatest Common Divisor of 841 and 160, using Euclidean algorithm. | 3 |
| 814 | Find Greatest Common Divisor of 3 and 53, using prime factorization. | 3 |
| 815 | Find Greatest Common Divisor of 296, 703 and 814, using repeated division. | 3 |
| 816 | Find Greatest Common Divisor of 10 and 20, using prime factorization. | 3 |
| 817 | Find Greatest Common Divisor of 1100 and 57330, using prime factorization. | 3 |
| 818 | Find Greatest Common Divisor of 1001 and 1331, using Euclidean algorithm. | 3 |
| 819 | Find Greatest Common Divisor of 99 and 33, using prime factorization. | 3 |
| 820 | Find Greatest Common Divisor of 18 and 201, using repeated division. | 3 |
| 821 | Find Greatest Common Divisor of 8, 13, 39, 42 and 48, by listing out the factors. | 3 |
| 822 | Find Greatest Common Divisor of 377 and 2303, using prime factorization. | 3 |
| 823 | Find Greatest Common Divisor of 54 and 36, using prime factorization. | 3 |
| 824 | Find Greatest Common Divisor of 12345 and 54321, using Euclidean algorithm. | 3 |
| 825 | Find Greatest Common Divisor of 62 and 258, using repeated division. | 3 |
| 826 | Find Greatest Common Divisor of 6059. | 3 |
| 827 | Find Greatest Common Divisor of 2486625522 and 41582215163, using repeated division. | 3 |
| 828 | Find Greatest Common Divisor of 2 and 0, using Euclidean algorithm. | 3 |
| 829 | Find Greatest Common Divisor of 6175 and 10000, using prime factorization. | 3 |
| 830 | Find Greatest Common Divisor of 6666600000 and 6666666666, using Euclidean algorithm. | 3 |
| 831 | Find Greatest Common Divisor of 2 and 0, using prime factorization. | 3 |
| 832 | Find Greatest Common Divisor of 1638 and 2036, using prime factorization. | 3 |
| 833 | Find Greatest Common Divisor of 14. | 3 |
| 834 | Find Greatest Common Divisor of 9216 and 256, using prime factorization. | 3 |
| 835 | Find Greatest Common Divisor of 93 and 119, using prime factorization. | 3 |
| 836 | Find Greatest Common Divisor of 6536 and 9503, using Euclidean algorithm. | 3 |
| 837 | Find Greatest Common Divisor of 1160718174. | 3 |
| 838 | Find Greatest Common Divisor of 30 and 17, using Euclidean algorithm. | 3 |
| 839 | Find Greatest Common Divisor of 54 and 21, using Euclidean algorithm. | 3 |
| 840 | Find Greatest Common Divisor of 96, 144 and 192, using repeated division. | 3 |
| 841 | Find Greatest Common Divisor of 3375 and 1000, using repeated division. | 2 |
| 842 | Find Greatest Common Divisor of 13 and 72, using Euclidean algorithm. | 2 |
| 843 | Find Greatest Common Divisor of 120 and 112, using prime factorization. | 2 |
| 844 | Find Greatest Common Divisor of 3587 and 1819, using repeated division. | 2 |
| 845 | Find Greatest Common Divisor of 122 and 48, using prime factorization. | 2 |
| 846 | Find Greatest Common Divisor of 195 and 340, using Euclidean algorithm. | 2 |
| 847 | Find Greatest Common Divisor of 0, 132 and 763, using prime factorization. | 2 |
| 848 | Find Greatest Common Divisor of 87, 11 and 31, using prime factorization. | 2 |
| 849 | Find Greatest Common Divisor of 120 and 122, using prime factorization. | 2 |
| 850 | Find Greatest Common Divisor of 75 and 100, using repeated division. | 2 |
