1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Irreducible polynomial?

  1. May 6, 2007 #1
    1. The problem statement, all variables and given/known data
    What are the ways you can determine whether a polynomial is irreducible?

    3. The attempt at a solution
    Eisenstein's criterion is one but it can't be applied all the time. i.e. x^4-2x^2+9
  2. jcsd
  3. May 6, 2007 #2


    User Avatar
    Staff Emeritus
    Science Advisor
    Gold Member

    Off the top of my head, I know two things you can do:

    (1) See if it's irreducible over several small finite fields. For your polynomial, that just means checking that GCD(x^4 - 2x^2 + 9, x^(p^k) - x) = 1, for k = 1, 2, and 3.

    (2) Compute a root of the polynomial and determine its minimal polynomial. (maybe by computing it numerically over the complexes and using lattice basis reduction to find the minimal polynomial exactly, or maybe by solving it over the 2-adics, or maybe by solving it modulo several small primes and using the CRT)
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?

Similar Discussions: Irreducible polynomial?