GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
851 | Find Greatest Common Divisor of 1975231 and 1936877, using prime factorization. | 2 |
852 | Find Greatest Common Divisor of 19 and 45, using Euclidean algorithm. | 2 |
853 | Find Greatest Common Divisor of 446492299 and 186378511, using prime factorization. | 2 |
854 | Find Greatest Common Divisor of 27 and 5, using prime factorization. | 2 |
855 | Find Greatest Common Divisor of 1914 and 899, using prime factorization. | 2 |
856 | Find Greatest Common Divisor of 8440. | 2 |
857 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using repeated division. | 2 |
858 | Find Greatest Common Divisor of 33 and 45, using Euclidean algorithm. | 2 |
859 | Find Greatest Common Divisor of 0 and 5, using repeated division. | 2 |
860 | Find Greatest Common Divisor of 210, 60 and 45, using prime factorization. | 2 |
861 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using Euclidean algorithm. | 2 |
862 | Find Greatest Common Divisor of 2, 48, 2, 88, 3 and 6, using prime factorization. | 2 |
863 | Find Greatest Common Divisor of 406 and 945, using prime factorization. | 2 |
864 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using Euclidean algorithm. | 2 |
865 | Find Greatest Common Divisor of 7, 5 and 6, using prime factorization. | 2 |
866 | Find Greatest Common Divisor of 52 and 54, using prime factorization. | 2 |
867 | Find Greatest Common Divisor of 44 and 95, using Euclidean algorithm. | 2 |
868 | Find Greatest Common Divisor of 6 and 5, using repeated division. | 2 |
869 | Find Greatest Common Divisor of 52 and 54, by listing out the factors. | 2 |
870 | Find Greatest Common Divisor of 75 and 21, using Euclidean algorithm. | 2 |
871 | Find Greatest Common Divisor of 728, 1196 and 2132, using repeated division. | 2 |
872 | Find Greatest Common Divisor of 44 and 70, using Euclidean algorithm. | 2 |
873 | Find Greatest Common Divisor of 1970 and 1066, using Euclidean algorithm. | 2 |
874 | Find Greatest Common Divisor of 244 and 117, using Euclidean algorithm. | 2 |
875 | Find Greatest Common Divisor of 25, 75 and 90, using prime factorization. | 2 |
876 | Find Greatest Common Divisor of 220 and 33, using Euclidean algorithm. | 2 |
877 | Find Greatest Common Divisor of 2 and 48, using repeated division. | 2 |
878 | Find Greatest Common Divisor of 405 and 945, using prime factorization. | 2 |
879 | Find Greatest Common Divisor of 513 and 347, using Euclidean algorithm. | 2 |
880 | Find Greatest Common Divisor of 90 and 6, using prime factorization. | 2 |
881 | Find Greatest Common Divisor of 126 and 147, by listing out the factors. | 2 |
882 | Find Greatest Common Divisor of 39 and 2535, using prime factorization. | 2 |
883 | Find Greatest Common Divisor of 24 and 3, using repeated division. | 2 |
884 | Find Greatest Common Divisor of 17 and 34, using prime factorization. | 2 |
885 | Find Greatest Common Divisor of 15, 29 and 75, using prime factorization. | 2 |
886 | Find Greatest Common Divisor of 48, 54 and 84, using prime factorization. | 2 |
887 | Find Greatest Common Divisor of 2560 and 1440, using repeated division. | 2 |
888 | Find Greatest Common Divisor of 871 and 27, using Euclidean algorithm. | 2 |
889 | Find Greatest Common Divisor of 62 and 83, using Euclidean algorithm. | 2 |
890 | Find Greatest Common Divisor of 396. | 2 |
891 | Find Greatest Common Divisor of 84, 36 and 75, using prime factorization. | 2 |
892 | Find Greatest Common Divisor of 2560 and 1440, using Euclidean algorithm. | 2 |
893 | Find Greatest Common Divisor of 44289 and 38952, using Euclidean algorithm. | 2 |
894 | Find Greatest Common Divisor of 390 and 1261, using prime factorization. | 2 |
895 | Find Greatest Common Divisor of 16261 and 85652, using prime factorization. | 2 |
896 | Find Greatest Common Divisor of 205800 and 6468, using prime factorization. | 2 |
897 | Find Greatest Common Divisor of 84 and 1264, using Euclidean algorithm. | 2 |
898 | Find Greatest Common Divisor of 49 and 168, using prime factorization. | 2 |
899 | Find Greatest Common Divisor of 6638 and 22783, using Euclidean algorithm. | 2 |
900 | Find Greatest Common Divisor of 170 and 122, using repeated division. | 2 |