Conway polynomial
Builds on Finite fieldPrimitive polynomial over a finite fieldMonic polynomial
Definition
Let be a prime. Order the monic polynomials of degree over as follows: write such a polynomial as with , and compare the sequences lexicographically. The Conway polynomial is defined by induction on . It is the least monic polynomial of degree over for this order such that:
- is a primitive polynomial over ;
- for every divisor of with , the polynomial divides .
Remarks
Clause 2 says: if is a root of , then is a root of . So the copies of inside the models of match for all dividing . Example: . The primitive cubics over are and , with sequences and . Clause 2 holds for both, since has root and every power of is . Non-example: is irreducible over but fails clause 1, so it is not , which is . For , , since is not a primitive root modulo and is.
Reading path
To understand this page from the ground up, read these 12 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Primitive polynomial over a finite field concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Unit of a ring definition
- Degree of a polynomial definition
- Field definition
- Leading coefficient definition
- Finite field definition
- Monic polynomial definition
- Conway polynomial definition
Further reading
About this page
| Tag | JRMWDJCMCE |
|---|---|
| URI | m2://JRMWDJCMCE |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11T06, 12E20 |
| Defines | Conway polynomial |
| Uses | Finite field, Primitive polynomial over a finite field, Monic polynomial |
| Changed | 2 November 2026 |
Markdown ยท JSON ยท Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.