Is there an algorithm to figure out whether a certain polynomial over $ℚ$ is irreducible or not?

387 Views Asked by At

Just wondering

Does there exist an algorithm that can determine in a finite number of steps whether a polynomial over $ℚ$ is irreducible over $ℚ$?

I know there are algorithms, but is there one that works with all polynomials over $ℚ$?

1

There are 1 best solutions below

0
On BEST ANSWER

Yes, such as Kronecker's method and the Zassenhaus algorithm. However, such algorithms usually perform full factorization. See Wikipedia.