Hello everyone,(adsbygoogle = window.adsbygoogle || []).push({});

I need some help with this one:

I need to write a routine that tests

the irreducibility of a polynomial over Fp,

(where Fp is the finite field with p

elements and p is a prime).

It should take as input: p,the polynomial

and its degree.

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!

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Irreducibility test for polynomials over Fp

Loading...

Similar Threads - Irreducibility test polynomials | Date |
---|---|

I Irreducibles and Primes in Integral Domains ... | Apr 5, 2017 |

I Quadratic Polynomials and Irreducibles and Primes ... | Apr 2, 2017 |

I Definition of an irreducible element in an integral domain | Feb 18, 2017 |

Completeness and orthogonality of unitary irreducible representations | Feb 15, 2016 |

Fourier transformation and test function -- Question in the derivation | Dec 31, 2015 |

**Physics Forums - The Fusion of Science and Community**