GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2851 | Find Greatest Common Divisor of 215 and 94, using Euclidean algorithm. | 2 |
| 2852 | Find Greatest Common Divisor of 143 and 1941, using prime factorization. | 2 |
| 2853 | Find Greatest Common Divisor of 96, 60 and 144, using prime factorization. | 2 |
| 2854 | Find Greatest Common Divisor of 12, 42 and 36, using prime factorization. | 2 |
| 2855 | Find Greatest Common Divisor of 30, 36 and 24, using prime factorization. | 2 |
| 2856 | Find Greatest Common Divisor of 11 and 18, using prime factorization. | 2 |
| 2857 | Find Greatest Common Divisor of 52 and 24, using Euclidean algorithm. | 2 |
| 2858 | Find Greatest Common Divisor of 18 and 12345, using Euclidean algorithm. | 2 |
| 2859 | Find Greatest Common Divisor of 180 and 9, using prime factorization. | 2 |
| 2860 | Find Greatest Common Divisor of 232 and 8, using prime factorization. | 2 |
| 2861 | Find Greatest Common Divisor of 535 and 65, using prime factorization. | 2 |
| 2862 | Find Greatest Common Divisor of 36 and 12, using prime factorization. | 2 |
| 2863 | Find Greatest Common Divisor of 22 and 22, using prime factorization. | 2 |
| 2864 | Find Greatest Common Divisor of 56, 68 and 128, using prime factorization. | 2 |
| 2865 | Find Greatest Common Divisor of 5010 and 8016, using prime factorization. | 2 |
| 2866 | Find Greatest Common Divisor of 42 and 50, using prime factorization. | 2 |
| 2867 | Find Greatest Common Divisor of 77 and 22, using prime factorization. | 2 |
| 2868 | Find Greatest Common Divisor of 122 and 2, using prime factorization. | 2 |
| 2869 | Find Greatest Common Divisor of 84 and 8, using prime factorization. | 2 |
| 2870 | Find Greatest Common Divisor of 283 and 177, using Euclidean algorithm. | 2 |
| 2871 | Find Greatest Common Divisor of 283 and 76, using Euclidean algorithm. | 2 |
| 2872 | Find Greatest Common Divisor of 461 and 58, using Euclidean algorithm. | 2 |
| 2873 | Find Greatest Common Divisor of 390 and 58, using Euclidean algorithm. | 2 |
| 2874 | Find Greatest Common Divisor of 398 and 57, using Euclidean algorithm. | 2 |
| 2875 | Find Greatest Common Divisor of 398 and 79, using Euclidean algorithm. | 2 |
| 2876 | Find Greatest Common Divisor of 613 and 74, using Euclidean algorithm. | 2 |
| 2877 | Find Greatest Common Divisor of 613 and 76, using Euclidean algorithm. | 2 |
| 2878 | Find Greatest Common Divisor of 517 and 83, using Euclidean algorithm. | 2 |
| 2879 | Find Greatest Common Divisor of 581 and 83, using Euclidean algorithm. | 2 |
| 2880 | Find Greatest Common Divisor of 581 and 197, using Euclidean algorithm. | 2 |
| 2881 | Find Greatest Common Divisor of 581 and 397, using Euclidean algorithm. | 2 |
| 2882 | Find Greatest Common Divisor of 588 and 392, using Euclidean algorithm. | 2 |
| 2883 | Find Greatest Common Divisor of 588 and 292, using Euclidean algorithm. | 2 |
| 2884 | Find Greatest Common Divisor of 416 and 94, using Euclidean algorithm. | 2 |
| 2885 | Find Greatest Common Divisor of 518 and 94, using Euclidean algorithm. | 2 |
| 2886 | Find Greatest Common Divisor of 518 and 193, using Euclidean algorithm. | 2 |
| 2887 | Find Greatest Common Divisor of 518 and 126, using Euclidean algorithm. | 2 |
| 2888 | Find Greatest Common Divisor of 588 and 120, using Euclidean algorithm. | 2 |
| 2889 | Find Greatest Common Divisor of 588 and 126, using Euclidean algorithm. | 2 |
| 2890 | Find Greatest Common Divisor of 588 and 231, using Euclidean algorithm. | 2 |
| 2891 | Find Greatest Common Divisor of 330 and 165, using Euclidean algorithm. | 2 |
| 2892 | Find Greatest Common Divisor of 375 and 45, using Euclidean algorithm. | 2 |
| 2893 | Find Greatest Common Divisor of 6 and 0, using prime factorization. | 2 |
| 2894 | Find Greatest Common Divisor of 130963810 and 8201782117, using Euclidean algorithm. | 2 |
| 2895 | Find Greatest Common Divisor of 128 and 34, using Euclidean algorithm. | 2 |
| 2896 | Find Greatest Common Divisor of 128 and 64, using Euclidean algorithm. | 2 |
| 2897 | Find Greatest Common Divisor of 128 and 24, using Euclidean algorithm. | 2 |
| 2898 | Find Greatest Common Divisor of 128 and 44, using Euclidean algorithm. | 2 |
| 2899 | Find Greatest Common Divisor of 16261 and 85652, by listing out the factors. | 2 |
| 2900 | Find Greatest Common Divisor of 139024789 and 93278890, using prime factorization. | 2 |