GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4951 | Find Greatest Common Divisor of 1276 and 873, using Euclidean algorithm. | 1 |
| 4952 | Find Greatest Common Divisor of 25. | 1 |
| 4953 | Find Greatest Common Divisor of 2071 and 206, using Euclidean algorithm. | 1 |
| 4954 | Find Greatest Common Divisor of 5, 965 and 1445, using prime factorization. | 1 |
| 4955 | Find Greatest Common Divisor of 192 and 5, using Euclidean algorithm. | 1 |
| 4956 | Find Greatest Common Divisor of 4788 and 31256, using prime factorization. | 1 |
| 4957 | Find Greatest Common Divisor of 8 and 98, using prime factorization. | 1 |
| 4958 | Find Greatest Common Divisor of 8 and 98, using repeated division. | 1 |
| 4959 | Find Greatest Common Divisor of 8 and 98, using Euclidean algorithm. | 1 |
| 4960 | Find Greatest Common Divisor of 8 and 98, by listing out the factors. | 1 |
| 4961 | Find Greatest Common Divisor of 8, 18 and 32, using repeated division. | 1 |
| 4962 | Find Greatest Common Divisor of 8, 18 and 32, using Euclidean algorithm. | 1 |
| 4963 | Find Greatest Common Divisor of 8, 18 and 32, by listing out the factors. | 1 |
| 4964 | Find Greatest Common Divisor of 7, 18 and 14, using prime factorization. | 1 |
| 4965 | Find Greatest Common Divisor of 50 and 60, using prime factorization. | 1 |
| 4966 | Find Greatest Common Divisor of 50 and 60, using Euclidean algorithm. | 1 |
| 4967 | Find Greatest Common Divisor of 43 and 17, using Euclidean algorithm. | 1 |
| 4968 | Find Greatest Common Divisor of 124 and 56, using Euclidean algorithm. | 1 |
| 4969 | Find Greatest Common Divisor of 144227 and 58483, using Euclidean algorithm. | 1 |
| 4970 | Find Greatest Common Divisor of 2017 and 1949, using prime factorization. | 1 |
| 4971 | Find Greatest Common Divisor of 1134 and 154, using Euclidean algorithm. | 1 |
| 4972 | Find Greatest Common Divisor of 2025 and 20025, using Euclidean algorithm. | 1 |
| 4973 | Find Greatest Common Divisor of 20025 and 200025, using Euclidean algorithm. | 1 |
| 4974 | Find Greatest Common Divisor of 146742024 and 46957680, using Euclidean algorithm. | 1 |
| 4975 | Find Greatest Common Divisor of 216 and 5, using Euclidean algorithm. | 1 |
| 4976 | Find Greatest Common Divisor of 779086434385541 and 91442056588823, using Euclidean algorithm. | 1 |
| 4977 | Find Greatest Common Divisor of 2576 and 943, using Euclidean algorithm. | 1 |
| 4978 | Find Greatest Common Divisor of 893 and 2432, using Euclidean algorithm. | 1 |
| 4979 | Find Greatest Common Divisor of 140 and 48, using Euclidean algorithm. | 1 |
| 4980 | Find Greatest Common Divisor of 229 and 7577561480, using Euclidean algorithm. | 1 |
| 4981 | Find Greatest Common Divisor of 29 and 36, using Euclidean algorithm. | 1 |
| 4982 | Find Greatest Common Divisor of 119 and 91, using prime factorization. | 1 |
| 4983 | Find Greatest Common Divisor of 146 and 258, using prime factorization. | 1 |
| 4984 | Find Greatest Common Divisor of 47 and 128, using Euclidean algorithm. | 1 |
| 4985 | Find Greatest Common Divisor of 105, 140 and 320, using Euclidean algorithm. | 1 |
| 4986 | Find Greatest Common Divisor of 105, 140 and 320, using repeated division. | 1 |
| 4987 | Find Greatest Common Divisor of 15, 21 and 35, using repeated division. | 1 |
| 4988 | Find Greatest Common Divisor of 45 and 34, using Euclidean algorithm. | 1 |
| 4989 | Find Greatest Common Divisor of 42 and 5, using Euclidean algorithm. | 1 |
| 4990 | Find Greatest Common Divisor of 4, 3, 2, 5 and 3, using prime factorization. | 1 |
| 4991 | Find Greatest Common Divisor of 27 and 4332, using prime factorization. | 1 |
| 4992 | Find Greatest Common Divisor of 289 and 986, using Euclidean algorithm. | 1 |
| 4993 | Find Greatest Common Divisor of 289 and 986, using prime factorization. | 1 |
| 4994 | Find Greatest Common Divisor of 1664972998 and 1107550223, using Euclidean algorithm. | 1 |
| 4995 | Find Greatest Common Divisor of 3564 and 926, using Euclidean algorithm. | 1 |
| 4996 | Find Greatest Common Divisor of 5642 and 508, using Euclidean algorithm. | 1 |
| 4997 | Find Greatest Common Divisor of 6828 and 651, using Euclidean algorithm. | 1 |
| 4998 | Find Greatest Common Divisor of 7765 and 756, using Euclidean algorithm. | 1 |
| 4999 | Find Greatest Common Divisor of 6515 and 756, using Euclidean algorithm. | 1 |
| 5000 | Find Greatest Common Divisor of 478 and 3526, using Euclidean algorithm. | 1 |
