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 $ℚ$?
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 $ℚ$?
Copyright © 2021 JogjaFile Inc.
Yes, such as Kronecker's method and the Zassenhaus algorithm. However, such algorithms usually perform full factorization. See Wikipedia.