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 78912 and 83159, using prime factorization. | 1 |
| 4902 | Find Greatest Common Divisor of 78912 and 83159, using Euclidean algorithm. | 1 |
| 4903 | Find Greatest Common Divisor of 78910 and 83159, using Euclidean algorithm. | 1 |
| 4904 | Find Greatest Common Divisor of 1, 2 and 3, using prime factorization. | 1 |
| 4905 | Find Greatest Common Divisor of 1, 2 and 3, using repeated division. | 1 |
| 4906 | Find Greatest Common Divisor of 1, 2 and 3, by listing out the factors. | 1 |
| 4907 | Find Greatest Common Divisor of 1, 2, 3, 4 and 2, by listing out the factors. | 1 |
| 4908 | Find Greatest Common Divisor of 12 and 18, using Euclidean algorithm. | 1 |
| 4909 | Find Greatest Common Divisor of 60 and 54, using prime factorization. | 1 |
| 4910 | Find Greatest Common Divisor of 96, 144 and 192, using prime factorization. | 1 |
| 4911 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using Euclidean algorithm. | 1 |
| 4912 | | 1 |
| 4913 | Find Greatest Common Divisor of 5397 and 133, using Euclidean algorithm. | 1 |
| 4914 | Find Greatest Common Divisor of 1468 and 40, using Euclidean algorithm. | 1 |
| 4915 | Find Greatest Common Divisor of 14355 and 150, using Euclidean algorithm. | 1 |
| 4916 | Find Greatest Common Divisor of 1356 and 828, using Euclidean algorithm. | 1 |
| 4917 | Find Greatest Common Divisor of 546 and 1357, using prime factorization. | 1 |
| 4918 | Find Greatest Common Divisor of 546 and 1357, using Euclidean algorithm. | 1 |
| 4919 | Find Greatest Common Divisor of 5874 and 1277, using Euclidean algorithm. | 1 |
| 4920 | Find Greatest Common Divisor of 22, 33 and 66, using prime factorization. | 1 |
| 4921 | Find Greatest Common Divisor of 180 and 192, using prime factorization. | 1 |
| 4922 | Find Greatest Common Divisor of 78125. | 1 |
| 4923 | Find Greatest Common Divisor of 95 and 168, using prime factorization. | 1 |
| 4924 | Find Greatest Common Divisor of 17610 and 12610, using Euclidean algorithm. | 1 |
| 4925 | Find Greatest Common Divisor of 17750 and 12750, using Euclidean algorithm. | 1 |
| 4926 | Find Greatest Common Divisor of 17790 and 12790, using Euclidean algorithm. | 1 |
| 4927 | Find Greatest Common Divisor of 17830 and 12830, using Euclidean algorithm. | 1 |
| 4928 | Find Greatest Common Divisor of 17850 and 12850, using Euclidean algorithm. | 1 |
| 4929 | Find Greatest Common Divisor of 17990 and 12990, using Euclidean algorithm. | 1 |
| 4930 | Find Greatest Common Divisor of 18070 and 13070, using Euclidean algorithm. | 1 |
| 4931 | Find Greatest Common Divisor of 18170 and 13170, using Euclidean algorithm. | 1 |
| 4932 | Find Greatest Common Divisor of 18230 and 13230, using Euclidean algorithm. | 1 |
| 4933 | Find Greatest Common Divisor of 18250 and 13250, using Euclidean algorithm. | 1 |
| 4934 | Find Greatest Common Divisor of 18270 and 13270, using Euclidean algorithm. | 1 |
| 4935 | Find Greatest Common Divisor of 18310 and 13310, using Euclidean algorithm. | 1 |
| 4936 | Find Greatest Common Divisor of 18330 and 13330, using Euclidean algorithm. | 1 |
| 4937 | Find Greatest Common Divisor of 18370 and 13370, using Euclidean algorithm. | 1 |
| 4938 | Find Greatest Common Divisor of 18390 and 13390, using Euclidean algorithm. | 1 |
| 4939 | Find Greatest Common Divisor of 36, 144 and 200, using prime factorization. | 1 |
| 4940 | Find Greatest Common Divisor of 18430 and 13430, using Euclidean algorithm. | 1 |
| 4941 | Find Greatest Common Divisor of 18450 and 13450, using Euclidean algorithm. | 1 |
| 4942 | Find Greatest Common Divisor of 1152 and 1664, using prime factorization. | 1 |
| 4943 | Find Greatest Common Divisor of 315 and 270, using prime factorization. | 1 |
| 4944 | Find Greatest Common Divisor of 35 and 49, using prime factorization. | 1 |
| 4945 | Find Greatest Common Divisor of 35 and 49, by listing out the factors. | 1 |
| 4946 | Find Greatest Common Divisor of 35 and 49, using Euclidean algorithm. | 1 |
| 4947 | Find Greatest Common Divisor of 2 and 2, using Euclidean algorithm. | 1 |
| 4948 | Find Greatest Common Divisor of 63 and 735, using prime factorization. | 1 |
| 4949 | Find Greatest Common Divisor of 1029428750000 and 376476800, using prime factorization. | 1 |
| 4950 | Find Greatest Common Divisor of 9999 and 11111, using prime factorization. | 1 |
