Let P be an irreducible polynomial of degree
over a prime finite field . The order of P
is the smallest positive integer n such that P(x) divides xn-1.
n is also equal to the multiplicative order of any root of P. It is a
divisor of pd-1. The polynomial P is a primitive polynomial if
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.
The most recent version
This page is not in its usual appearance because WIMS is unable to recognize your
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. Serveur Wims de l'ESPE-Nice-Toulon - Université de Nice - Sophia Antipolis
- Keywords: interactive mathematics, interactive math, server side interactivity, algebra, coding, polynomials, finite_field, factorization, roots, order, cyclic_code