## You are here

Homeirreducible polynomials over finite field

## Primary tabs

# irreducible polynomials over finite field

Theorem.β Over a finite field $F$, there exist irreducible polynomials of any degree.

Proof.β Let $n$ be a positive integer, $p$ be the characteristic of $F$, $\mathbb{F}_{p}$ be the prime subfield, and $p^{r}$ be the order of the field $F$.β Since $p^{r}\!-\!1$ is a divisor of $p^{{rn}}\!-\!1$, the zeros of the polynomial $X^{{p^{r}}}\!-\!X$ form inβ $G:=\mathbb{F}_{{p^{{rn}}}}$β a subfield isomorphic to $F$.β Thus, one can regard $F$ as a subfield of $G$.β Because

$[G\!:\!F]=\frac{[G\!:\!\mathbb{F}_{p}]}{[F\!:\!\mathbb{F}_{p}]}=\frac{rn}{r}=n,$ |

the minimal polynomial of a primitive element of the field extension $G/F$ is an irreducible polynomial of degree $n$ in the ring $F[X].$

Related:

FiniteField

Type of Math Object:

Theorem

Major Section:

Reference

Parent:

Groups audience:

## Mathematics Subject Classification

12E20*no label found*11T99

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella