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 311 and 28, using Euclidean algorithm. | 3 |
852 | Find Greatest Common Divisor of 12 and 1234, using prime factorization. | 3 |
853 | Find Greatest Common Divisor of 2517 and 2370, using Euclidean algorithm. | 3 |
854 | Find Greatest Common Divisor of 1024 and 2256, using Euclidean algorithm. | 3 |
855 | Find Greatest Common Divisor of 663 and 39, using prime factorization. | 3 |
856 | Find Greatest Common Divisor of 316 and 180, using prime factorization. | 3 |
857 | Find Greatest Common Divisor of 93 and 119, using prime factorization. | 3 |
858 | Find Greatest Common Divisor of 36 and 90, using prime factorization. | 3 |
859 | Find Greatest Common Divisor of 12345 and 54321, using prime factorization. | 3 |
860 | Find Greatest Common Divisor of 816 and 2260, using Euclidean algorithm. | 3 |
861 | Find Greatest Common Divisor of 211 and 575, using prime factorization. | 3 |
862 | Find Greatest Common Divisor of 2024 and 112, using Euclidean algorithm. | 3 |
863 | Find Greatest Common Divisor of 16 and 38, using prime factorization. | 3 |
864 | Find Greatest Common Divisor of 11607 and 3162, using Euclidean algorithm. | 3 |
865 | Find Greatest Common Divisor of 1769 and 2378, using Euclidean algorithm. | 3 |
866 | Find Greatest Common Divisor of 91 and 287, using Euclidean algorithm. | 3 |
867 | Find Greatest Common Divisor of 15 and 13, using Euclidean algorithm. | 3 |
868 | Find Greatest Common Divisor of 1001 and 1331, using Euclidean algorithm. | 3 |
869 | Find Greatest Common Divisor of 12345 and 54321, using Euclidean algorithm. | 3 |
870 | Find Greatest Common Divisor of 1716 and 1260, using Euclidean algorithm. | 3 |
871 | Find Greatest Common Divisor of 1056 and 228, using Euclidean algorithm. | 3 |
872 | Find Greatest Common Divisor of 1022 and 400, using prime factorization. | 3 |
873 | Find Greatest Common Divisor of 377 and 2303, using prime factorization. | 3 |
874 | Find Greatest Common Divisor of 4001 and 2689, using Euclidean algorithm. | 3 |
875 | Find Greatest Common Divisor of 33 and 145, using prime factorization. | 3 |
876 | Find Greatest Common Divisor of 76 and 62, using Euclidean algorithm. | 3 |
877 | Find Greatest Common Divisor of 483 and 360, using Euclidean algorithm. | 3 |
878 | Find Greatest Common Divisor of 1010 and 407, using prime factorization. | 3 |
879 | Find Greatest Common Divisor of 12 and 8, using repeated division. | 3 |
880 | Find Greatest Common Divisor of 12728 and 20000, using Euclidean algorithm. | 3 |
881 | Find Greatest Common Divisor of 1020 and 1170, using prime factorization. | 3 |
882 | Find Greatest Common Divisor of 1020 and 1170, using repeated division. | 3 |
883 | Find Greatest Common Divisor of 13 and 8, using Euclidean algorithm. | 3 |
884 | Find Greatest Common Divisor of 310 and 62, using prime factorization. | 3 |
885 | Find Greatest Common Divisor of 296, 703 and 814, using repeated division. | 3 |
886 | Find Greatest Common Divisor of 45. | 3 |
887 | Find Greatest Common Divisor of 123456 and 789, using Euclidean algorithm. | 3 |
888 | Find Greatest Common Divisor of 24 and 69, using Euclidean algorithm. | 3 |
889 | Find Greatest Common Divisor of 48 and 18, using Euclidean algorithm. | 3 |
890 | Find Greatest Common Divisor of 3, 2 and 2, using prime factorization. | 3 |
891 | Find Greatest Common Divisor of 2024 and 1058, using Euclidean algorithm. | 3 |
892 | Find Greatest Common Divisor of 3 and 20, using prime factorization. | 3 |
893 | Find Greatest Common Divisor of 17 and 3120, using repeated division. | 3 |
894 | Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm. | 3 |
895 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using Euclidean algorithm. | 3 |
896 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using repeated division. | 3 |
897 | Find Greatest Common Divisor of 17 and 34, using repeated division. | 3 |
898 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using repeated division. | 3 |
899 | Find Greatest Common Divisor of 6468 and 14300, using prime factorization. | 3 |
900 | Find Greatest Common Divisor of 160 and 7, using repeated division. | 3 |