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 13, 3, 3, 2 and 1, by listing out the factors. | 3 |
| 802 | Find Greatest Common Divisor of 26 and 7, using Euclidean algorithm. | 3 |
| 803 | Find Greatest Common Divisor of 96 and 356, using Euclidean algorithm. | 3 |
| 804 | Find Greatest Common Divisor of 45, 83 and 79, using Euclidean algorithm. | 3 |
| 805 | Find Greatest Common Divisor of 29 and 63, using Euclidean algorithm. | 3 |
| 806 | Find Greatest Common Divisor of 5. | 3 |
| 807 | Find Greatest Common Divisor of 47 and 89, using Euclidean algorithm. | 3 |
| 808 | Find Greatest Common Divisor of 75 and 42, using Euclidean algorithm. | 3 |
| 809 | Find Greatest Common Divisor of 48 and 59, using Euclidean algorithm. | 3 |
| 810 | Find Greatest Common Divisor of 44 and 90, by listing out the factors. | 3 |
| 811 | Find Greatest Common Divisor of 52 and 39, using Euclidean algorithm. | 3 |
| 812 | Find Greatest Common Divisor of 634 and 472, using Euclidean algorithm. | 3 |
| 813 | Find Greatest Common Divisor of 25 and 68, using Euclidean algorithm. | 3 |
| 814 | Find Greatest Common Divisor of 91 and 32, using Euclidean algorithm. | 3 |
| 815 | Find Greatest Common Divisor of 97 and 29, using Euclidean algorithm. | 3 |
| 816 | Find Greatest Common Divisor of 23 and 1, using Euclidean algorithm. | 3 |
| 817 | Find Greatest Common Divisor of 22 and 77, using Euclidean algorithm. | 3 |
| 818 | Find Greatest Common Divisor of 26 and 76, using Euclidean algorithm. | 3 |
| 819 | Find Greatest Common Divisor of 85 and 28, using Euclidean algorithm. | 3 |
| 820 | Find Greatest Common Divisor of 72 and 15, using Euclidean algorithm. | 3 |
| 821 | Find Greatest Common Divisor of 320 and 240, using prime factorization. | 3 |
| 822 | Find Greatest Common Divisor of 72 and 82, using Euclidean algorithm. | 3 |
| 823 | Find Greatest Common Divisor of 1028 and 576, using Euclidean algorithm. | 3 |
| 824 | Find Greatest Common Divisor of 5 and 6, using prime factorization. | 3 |
| 825 | Find Greatest Common Divisor of 48, 54 and 84, by listing out the factors. | 3 |
| 826 | Find Greatest Common Divisor of 34 and 120, using prime factorization. | 3 |
| 827 | Find Greatest Common Divisor of 315 and 441, using repeated division. | 3 |
| 828 | Find Greatest Common Divisor of 6666600000 and 6666666666, using Euclidean algorithm. | 3 |
| 829 | Find Greatest Common Divisor of 12 and 2, using prime factorization. | 3 |
| 830 | Find Greatest Common Divisor of 80 and 44, using Euclidean algorithm. | 3 |
| 831 | Find Greatest Common Divisor of 337 and 674, using prime factorization. | 3 |
| 832 | Find Greatest Common Divisor of 54 and 21, using Euclidean algorithm. | 3 |
| 833 | Find Greatest Common Divisor of 108 and 144, using prime factorization. | 3 |
| 834 | Find Greatest Common Divisor of 108 and 144, by listing out the factors. | 3 |
| 835 | Find Greatest Common Divisor of 130 and 115, using Euclidean algorithm. | 3 |
| 836 | Find Greatest Common Divisor of 123456789 and 987654321, using prime factorization. | 3 |
| 837 | Find Greatest Common Divisor of 34 and 55, using Euclidean algorithm. | 3 |
| 838 | Find Greatest Common Divisor of 840 and 1080, using prime factorization. | 3 |
| 839 | Find Greatest Common Divisor of 28 and 7, using prime factorization. | 3 |
| 840 | Find Greatest Common Divisor of 70, 120 and 217, using prime factorization. | 3 |
| 841 | Find Greatest Common Divisor of 70 and 120, using Euclidean algorithm. | 3 |
| 842 | Find Greatest Common Divisor of 113 and 143, using prime factorization. | 3 |
| 843 | Find Greatest Common Divisor of 24 and 60, using prime factorization. | 3 |
| 844 | Find Greatest Common Divisor of 18, 45 and 6, using prime factorization. | 3 |
| 845 | Find Greatest Common Divisor of 83 and 19, using prime factorization. | 3 |
| 846 | Find Greatest Common Divisor of 841 and 160, using Euclidean algorithm. | 3 |
| 847 | Find Greatest Common Divisor of 48 and 18, using repeated division. | 3 |
| 848 | Find Greatest Common Divisor of 0 and 3, using prime factorization. | 3 |
| 849 | Find Greatest Common Divisor of 1 and 17, using prime factorization. | 3 |
| 850 | Find Greatest Common Divisor of 3 and 53, using prime factorization. | 3 |
