# Polynomial order

Let $P$ be an irreducible polynomial of degree $d\ge 1$ over a prime finite field ${𝔽}_{p}$. The order of $P$ is the smallest positive integer $n$ such that $P\left(x\right)$ divides ${x}^{n}-1$. $n$ is also equal to the multiplicative order of any root of $P$. It is a divisor of ${p}_{d}-1$. The polynomial $P$ is a primitive polynomial if $n={p}^{d}-1$.

This tool allows you to enter a polynomial and compute its order. If you enter a reducible polynomial, the orders of all its non-linear factors will be computed and presented.

: over the finite field ${𝔽}_{p}$ of characteristics
The most recent version

This page is not in its usual appearance because WIMS is unable to recognize your web browser.
In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press Enter''.

Please take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.

• Description: computes the order of an irreducible polynomial over a finite field Fp. interactive exercises, online calculators and plotters, mathematical recreation and games, Pôle Formation CFAI-CENTRE
• Keywords: CFAI,interactive math, server side interactivity, algebra, coding, polynomials, finite_field, factorization, roots, order, cyclic_code