There are a number of criteria for determining whether a polynomial with integral coefficients is irreducible over rational numbers (the traditional ones being Eisenstein criterion and irreducibility over a prime finite field).
I was wondering if the decision problem of "Given an arbitrary polynomial with integral coefficients is irreducible over rational numbers or not" is decidable or undecidable?
Stefano Capparelli
I am not an expert in logic so I am not sure how to answer your question, nor if what I am saying is relevant. However, there are algorithms for factoring polynomials over the integers, so it would seem to me that the problem is decidable.
0 votes
0 thanks
- Badges
- Science topic
- Similar topics
- Control Systems Engineering
- Filtering
More Sarthak Gupta's questions See All
Similar questions and discussions