GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 801 | Find Greatest Common Divisor of 16 and 24, by listing out the factors. | 3 |
| 802 | Find Greatest Common Divisor of 45 and 75, using prime factorization. | 3 |
| 803 | Find Greatest Common Divisor of 84 and 12, using repeated division. | 3 |
| 804 | Find Greatest Common Divisor of 42 and 12000, using prime factorization. | 3 |
| 805 | Find Greatest Common Divisor of 250 and 15, using prime factorization. | 3 |
| 806 | Find Greatest Common Divisor of 58 and 10, using prime factorization. | 3 |
| 807 | Find Greatest Common Divisor of 4 and 26, using prime factorization. | 3 |
| 808 | Find Greatest Common Divisor of 420 and 60, using prime factorization. | 3 |
| 809 | Find Greatest Common Divisor of 32 and 12, using prime factorization. | 3 |
| 810 | Find Greatest Common Divisor of 134 and 2, using prime factorization. | 3 |
| 811 | Find Greatest Common Divisor of 111 and 63, using prime factorization. | 3 |
| 812 | Find Greatest Common Divisor of 105 and 10, using prime factorization. | 3 |
| 813 | Find Greatest Common Divisor of 16 and 10, using prime factorization. | 3 |
| 814 | Find Greatest Common Divisor of 18 and 8, using prime factorization. | 3 |
| 815 | Find Greatest Common Divisor of 26 and 24, using prime factorization. | 3 |
| 816 | Find Greatest Common Divisor of 28 and 10, using prime factorization. | 3 |
| 817 | Find Greatest Common Divisor of 39 and 42, using prime factorization. | 3 |
| 818 | Find Greatest Common Divisor of 7871850 and 21829500, using Euclidean algorithm. | 3 |
| 819 | Find Greatest Common Divisor of 189 and 30, using prime factorization. | 3 |
| 820 | Find Greatest Common Divisor of 2579 and 2424, using Euclidean algorithm. | 3 |
| 821 | Find Greatest Common Divisor of 75 and 36, using prime factorization. | 3 |
| 822 | Find Greatest Common Divisor of 304 and 30, using prime factorization. | 3 |
| 823 | Find Greatest Common Divisor of 17 and 89, using Euclidean algorithm. | 3 |
| 824 | Find Greatest Common Divisor of 80 and 100, using prime factorization. | 3 |
| 825 | Find Greatest Common Divisor of 161213367. | 3 |
| 826 | Find Greatest Common Divisor of 2 and 0, using Euclidean algorithm. | 3 |
| 827 | Find Greatest Common Divisor of 2 and 0, using prime factorization. | 3 |
| 828 | Find Greatest Common Divisor of 5 and 12, using Euclidean algorithm. | 3 |
| 829 | Find Greatest Common Divisor of 46, 69 and 92, by listing out the factors. | 3 |
| 830 | Find Greatest Common Divisor of 807 and 481, using Euclidean algorithm. | 3 |
| 831 | Find Greatest Common Divisor of 396 and 792, by listing out the factors. | 3 |
| 832 | Find Greatest Common Divisor of 24 and 48, using repeated division. | 3 |
| 833 | Find Greatest Common Divisor of 12075 and 4655, using prime factorization. | 3 |
| 834 | Find Greatest Common Divisor of 12075 and 4655, using Euclidean algorithm. | 3 |
| 835 | Find Greatest Common Divisor of 270 and 192, using repeated division. | 3 |
| 836 | Find Greatest Common Divisor of 20 and 28, using prime factorization. | 3 |
| 837 | Find Greatest Common Divisor of 175, 225 and 350, using repeated division. | 3 |
| 838 | Find Greatest Common Divisor of 12 and 6, using prime factorization. | 3 |
| 839 | Find Greatest Common Divisor of 11 and 25, using Euclidean algorithm. | 3 |
| 840 | Find Greatest Common Divisor of 72 and 52, using Euclidean algorithm. | 3 |
| 841 | Find Greatest Common Divisor of 150 and 890, using prime factorization. | 3 |
| 842 | Find Greatest Common Divisor of 77 and 28, using prime factorization. | 3 |
| 843 | Find Greatest Common Divisor of 42 and 14, using prime factorization. | 3 |
| 844 | Find Greatest Common Divisor of 114 and 312, using repeated division. | 3 |
| 845 | Find Greatest Common Divisor of 25 and 40, using prime factorization. | 3 |
| 846 | Find Greatest Common Divisor of 18 and 48, using prime factorization. | 3 |
| 847 | Find Greatest Common Divisor of 3 and 3016, using prime factorization. | 3 |
| 848 | Find Greatest Common Divisor of 257 and 532, using Euclidean algorithm. | 3 |
| 849 | Find Greatest Common Divisor of 153 and 119, using prime factorization. | 3 |
| 850 | Find Greatest Common Divisor of 311 and 28, using prime factorization. | 3 |
