<

Question: Irreducibility test for polynomials over Fp

Hello everyone, I need some help with this one: I need to write a routine that tests the irreducibility of a polynomial over the field Fp , where p is a prime. It should return TRUE if the polynomial is irreducible over Fp and FALSE if it's not. I can use the theorem below: The polynomial x^(p^n)-x is the product of all monic irreduble polynomials over Fp, of degree that divides n. So, any ideas? Thanks in advance for your time!
Please Wait...