GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4901 | Find Greatest Common Divisor of 12 and 33, using Euclidean algorithm. | 1 |
| 4902 | Find Greatest Common Divisor of 388, 576 and 7164, using Euclidean algorithm. | 1 |
| 4903 | Find Greatest Common Divisor of 388, 576 and 7164, by listing out the factors. | 1 |
| 4904 | Find Greatest Common Divisor of 101 and 3267, using prime factorization. | 1 |
| 4905 | Find Greatest Common Divisor of 101 and 3267, using repeated division. | 1 |
| 4906 | Find Greatest Common Divisor of 4378 and 2722, using prime factorization. | 1 |
| 4907 | Find Greatest Common Divisor of 42 and 154, using prime factorization. | 1 |
| 4908 | Find Greatest Common Divisor of 2722 and 2462, using prime factorization. | 1 |
| 4909 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using prime factorization. | 1 |
| 4910 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using Euclidean algorithm. | 1 |
| 4911 | Find Greatest Common Divisor of 6, 42, 12, 52 and 20, using repeated division. | 1 |
| 4912 | Find Greatest Common Divisor of 1235 and 765, by listing out the factors. | 1 |
| 4913 | Find Greatest Common Divisor of 1 and 60, using prime factorization. | 1 |
| 4914 | Find Greatest Common Divisor of 1 and 60, using Euclidean algorithm. | 1 |
| 4915 | Find Greatest Common Divisor of 8000 and 3600, using Euclidean algorithm. | 1 |
| 4916 | Find Greatest Common Divisor of 50 and 20, using prime factorization. | 1 |
| 4917 | Find Greatest Common Divisor of 210, 355 and 690, using prime factorization. | 1 |
| 4918 | Find Greatest Common Divisor of 1260 and 10500, using Euclidean algorithm. | 1 |
| 4919 | Find Greatest Common Divisor of 2516 and 1125, using repeated division. | 1 |
| 4920 | Find Greatest Common Divisor of 60 and 3, by listing out the factors. | 1 |
| 4921 | Find Greatest Common Divisor of 19, 7, 29 and 7, using prime factorization. | 1 |
| 4922 | Find Greatest Common Divisor of 1243 and 26, using Euclidean algorithm. | 1 |
| 4923 | Find Greatest Common Divisor of 24, 45 and 72, using prime factorization. | 1 |
| 4924 | Find Greatest Common Divisor of 56, 78 and 90, using prime factorization. | 1 |
| 4925 | Find Greatest Common Divisor of 29 and 20, using prime factorization. | 1 |
| 4926 | Find Greatest Common Divisor of 5238 and 2425, using prime factorization. | 1 |
| 4927 | Find Greatest Common Divisor of 95, 57 and 23, using prime factorization. | 1 |
| 4928 | Find Greatest Common Divisor of 10, 20, 30, 40 and 50, using prime factorization. | 1 |
| 4929 | Find Greatest Common Divisor of 37 and 13, using prime factorization. | 1 |
| 4930 | Find Greatest Common Divisor of 299 and 256, using Euclidean algorithm. | 1 |
| 4931 | Find Greatest Common Divisor of 123987456 and 87, using prime factorization. | 1 |
| 4932 | Find Greatest Common Divisor of 1176 and 483, using prime factorization. | 1 |
| 4933 | Find Greatest Common Divisor of 2772 and 1912, using repeated division. | 1 |
| 4934 | Find Greatest Common Divisor of 2772 and 1912, using Euclidean algorithm. | 1 |
| 4935 | Find Greatest Common Divisor of 2772 and 4138, using prime factorization. | 1 |
| 4936 | Find Greatest Common Divisor of 2772 and 4148, using prime factorization. | 1 |
| 4937 | Find Greatest Common Divisor of 4144 and 2736, using prime factorization. | 1 |
| 4938 | Find Greatest Common Divisor of 1920 and 2772, using prime factorization. | 1 |
| 4939 | Find Greatest Common Divisor of 1920 and 2768, using prime factorization. | 1 |
| 4940 | Find Greatest Common Divisor of 6064 and 2768, using prime factorization. | 1 |
| 4941 | Find Greatest Common Divisor of 1029 and 420, using prime factorization. | 1 |
| 4942 | Find Greatest Common Divisor of 54 and 90, using Euclidean algorithm. | 1 |
| 4943 | Find Greatest Common Divisor of 289 and 248, using Euclidean algorithm. | 1 |
| 4944 | Find Greatest Common Divisor of 367500 and 43401015, using prime factorization. | 1 |
| 4945 | Find Greatest Common Divisor of 63 and 77, using Euclidean algorithm. | 1 |
| 4946 | Find Greatest Common Divisor of 123 and 82, using Euclidean algorithm. | 1 |
| 4947 | Find Greatest Common Divisor of 10, 8, 12 and 4, using Euclidean algorithm. | 1 |
| 4948 | Find Greatest Common Divisor of 5, 3 and 1, using prime factorization. | 1 |
| 4949 | Find Greatest Common Divisor of 143 and 111, using prime factorization. | 1 |
| 4950 | Find Greatest Common Divisor of 26 and 18, using Euclidean algorithm. | 1 |
