GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
901 | Find Greatest Common Divisor of 388 and 189, using prime factorization. | 3 |
902 | Find Greatest Common Divisor of 7250 and 2360, using Euclidean algorithm. | 3 |
903 | Find Greatest Common Divisor of 420 and 200, using prime factorization. | 3 |
904 | Find Greatest Common Divisor of 2024. | 3 |
905 | Find Greatest Common Divisor of 36303, 3836 and 3827, using prime factorization. | 3 |
906 | Find Greatest Common Divisor of 14. | 3 |
907 | Find Greatest Common Divisor of 36 and 81, using prime factorization. | 3 |
908 | Find Greatest Common Divisor of 2, 8 and 6, using prime factorization. | 3 |
909 | Find Greatest Common Divisor of 13 and 7, using prime factorization. | 3 |
910 | Find Greatest Common Divisor of 20 and 40, using Euclidean algorithm. | 2 |
911 | Find Greatest Common Divisor of 8 and 4, using Euclidean algorithm. | 2 |
912 | Find Greatest Common Divisor of 56 and 2582, using prime factorization. | 2 |
913 | Find Greatest Common Divisor of 56 and 25824, using prime factorization. | 2 |
914 | Find Greatest Common Divisor of 156 and 25824, using prime factorization. | 2 |
915 | Find Greatest Common Divisor of 65 and 28, using prime factorization. | 2 |
916 | Find Greatest Common Divisor of 8813 and 885, using prime factorization. | 2 |
917 | Find Greatest Common Divisor of 12 and 90, using prime factorization. | 2 |
918 | Find Greatest Common Divisor of 12 and 150, using prime factorization. | 2 |
919 | Find Greatest Common Divisor of 23 and 1200, using Euclidean algorithm. | 2 |
920 | Find Greatest Common Divisor of 2 and 1200, using Euclidean algorithm. | 2 |
921 | Find Greatest Common Divisor of 3 and 1200, using prime factorization. | 2 |
922 | Find Greatest Common Divisor of 7 and 1200, using prime factorization. | 2 |
923 | Find Greatest Common Divisor of 71 and 83, using Euclidean algorithm. | 2 |
924 | Find Greatest Common Divisor of 20536. | 2 |
925 | Find Greatest Common Divisor of 12 and 5, using prime factorization. | 2 |
926 | Find Greatest Common Divisor of 54. | 2 |
927 | Find Greatest Common Divisor of 18 and 2, using prime factorization. | 2 |
928 | Find Greatest Common Divisor of 192 and 258, using Euclidean algorithm. | 2 |
929 | Find Greatest Common Divisor of 33 and 89, using Euclidean algorithm. | 2 |
930 | Find Greatest Common Divisor of 343 and 237, using Euclidean algorithm. | 2 |
931 | Find Greatest Common Divisor of 286 and 369, using Euclidean algorithm. | 2 |
932 | Find Greatest Common Divisor of 506 and 2185, using Euclidean algorithm. | 2 |
933 | Find Greatest Common Divisor of 132 and 318, using Euclidean algorithm. | 2 |
934 | Find Greatest Common Divisor of 86 and 47, using Euclidean algorithm. | 2 |
935 | Find Greatest Common Divisor of 624 and 255, using Euclidean algorithm. | 2 |
936 | Find Greatest Common Divisor of 3600 and 2016, using prime factorization. | 2 |
937 | Find Greatest Common Divisor of 1400 and 630, using prime factorization. | 2 |
938 | Find Greatest Common Divisor of 23 and 82, using prime factorization. | 2 |
939 | Find Greatest Common Divisor of 11 and 150, using prime factorization. | 2 |
940 | Find Greatest Common Divisor of 960 and 4500, using prime factorization. | 2 |
941 | Find Greatest Common Divisor of 9 and 57, using prime factorization. | 2 |
942 | Find Greatest Common Divisor of 23, 31, 23 and 17, using prime factorization. | 2 |
943 | Find Greatest Common Divisor of 56, 42 and 98, using prime factorization. | 2 |
944 | Find Greatest Common Divisor of 14, 49 and 7, using prime factorization. | 2 |
945 | Find Greatest Common Divisor of 4, 27 and 50, using prime factorization. | 2 |
946 | Find Greatest Common Divisor of 48, 87 and 6, using prime factorization. | 2 |
947 | Find Greatest Common Divisor of 65, 39 and 13, using prime factorization. | 2 |
948 | Find Greatest Common Divisor of 45, 8, 64 and 32, using prime factorization. | 2 |
949 | Find Greatest Common Divisor of 99, 11 and 17, using prime factorization. | 2 |
950 | Find Greatest Common Divisor of 100, 150 and 200, using prime factorization. | 2 |