GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
851 | Find Greatest Common Divisor of 11520 and 5670, using prime factorization. | 3 |
852 | Find Greatest Common Divisor of 1100 and 57330, using prime factorization. | 3 |
853 | Find Greatest Common Divisor of 30 and 17, using Euclidean algorithm. | 3 |
854 | Find Greatest Common Divisor of 1025 and 35, using prime factorization. | 3 |
855 | Find Greatest Common Divisor of 6536 and 9503, using Euclidean algorithm. | 3 |
856 | Find Greatest Common Divisor of 67890 and 12345, using prime factorization. | 3 |
857 | Find Greatest Common Divisor of 22 and 10, using prime factorization. | 3 |
858 | Find Greatest Common Divisor of 289 and 377, using prime factorization. | 3 |
859 | Find Greatest Common Divisor of 32 and 936, using repeated division. | 3 |
860 | Find Greatest Common Divisor of 10, 25 and 22, using prime factorization. | 3 |
861 | Find Greatest Common Divisor of 9800, 420 and 2520, using repeated division. | 3 |
862 | Find Greatest Common Divisor of 9800, 420 and 2520, using prime factorization. | 3 |
863 | Find Greatest Common Divisor of 3, 24, 27, 33, 42 and 46, using repeated division. | 3 |
864 | Find Greatest Common Divisor of 45 and 56, using prime factorization. | 3 |
865 | Find Greatest Common Divisor of 20 and 10, using repeated division. | 3 |
866 | Find Greatest Common Divisor of 20 and 7, using repeated division. | 3 |
867 | Find Greatest Common Divisor of 160 and 9, using repeated division. | 3 |
868 | Find Greatest Common Divisor of 75 and 253, using prime factorization. | 3 |
869 | Find Greatest Common Divisor of 11391 and 5673, using Euclidean algorithm. | 3 |
870 | Find Greatest Common Divisor of 232 and 562, using Euclidean algorithm. | 3 |
871 | Find Greatest Common Divisor of 1432 and 156, using prime factorization. | 3 |
872 | Find Greatest Common Divisor of 359 and 125, using Euclidean algorithm. | 3 |
873 | Find Greatest Common Divisor of 388 and 189, using repeated division. | 3 |
874 | Find Greatest Common Divisor of 388 and 189, using prime factorization. | 3 |
875 | Find Greatest Common Divisor of 7250 and 2360, using Euclidean algorithm. | 3 |
876 | Find Greatest Common Divisor of 420 and 200, using prime factorization. | 3 |
877 | Find Greatest Common Divisor of 36303, 3836 and 3827, using prime factorization. | 3 |
878 | Find Greatest Common Divisor of 14. | 3 |
879 | Find Greatest Common Divisor of 36 and 81, using prime factorization. | 3 |
880 | Find Greatest Common Divisor of 2, 8 and 6, using prime factorization. | 3 |
881 | Find Greatest Common Divisor of 13 and 7, using prime factorization. | 3 |
882 | Find Greatest Common Divisor of 20 and 40, using Euclidean algorithm. | 2 |
883 | Find Greatest Common Divisor of 8 and 4, using Euclidean algorithm. | 2 |
884 | Find Greatest Common Divisor of 56 and 2582, using prime factorization. | 2 |
885 | Find Greatest Common Divisor of 56 and 25824, using prime factorization. | 2 |
886 | Find Greatest Common Divisor of 156 and 25824, using prime factorization. | 2 |
887 | Find Greatest Common Divisor of 65 and 28, using prime factorization. | 2 |
888 | Find Greatest Common Divisor of 8813 and 885, using prime factorization. | 2 |
889 | Find Greatest Common Divisor of 12 and 90, using prime factorization. | 2 |
890 | Find Greatest Common Divisor of 12 and 150, using prime factorization. | 2 |
891 | Find Greatest Common Divisor of 23 and 1200, using Euclidean algorithm. | 2 |
892 | Find Greatest Common Divisor of 2 and 1200, using Euclidean algorithm. | 2 |
893 | Find Greatest Common Divisor of 3 and 1200, using prime factorization. | 2 |
894 | Find Greatest Common Divisor of 7 and 1200, using prime factorization. | 2 |
895 | Find Greatest Common Divisor of 71 and 83, using Euclidean algorithm. | 2 |
896 | Find Greatest Common Divisor of 20536. | 2 |
897 | Find Greatest Common Divisor of 12 and 5, using prime factorization. | 2 |
898 | Find Greatest Common Divisor of 54. | 2 |
899 | Find Greatest Common Divisor of 18 and 2, using prime factorization. | 2 |
900 | Find Greatest Common Divisor of 192 and 258, using Euclidean algorithm. | 2 |