Irreducible Polynomial
A Polynomial or polynomial equation is said to be irreducible if it cannot be factored into polynomials of lower degreeover the same Field.
The number of binary irreducible polynomials of degree 
is equal to the number of -bead fixed Necklacesof two colors: 1, 2, 3, 4, 6, 8, 14, 20, 36, ... (Sloane's A000031), the first few of which are given in the following table.
| Polynomials |
| 1 |  |
| 2 | ,  |
| 3 | ,  , |
| 4 | ,  ,  , |
References
Sloane, N. J. A. SequenceA000031/M0564in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and extended entry inSloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.
- Projective Geometry
- Projective Plane
- Projective Plane PK2
- Projective Space
- Projective Special Linear Group
- Projective Special Orthogonal Group
- Projective Special Unitary Group
- Projective Symplectic Group
- Projectivity
- Prolate Cycloid
- Prolate Cycloid Evolute
- Prolate Spheroid
- Prolate Spheroidal Coordinates
- Prolate Spheroidal Wave Function
- Pronic Number
- Proof
- Proofreading Mistakes
- Propeller
- Proper Cover
- Proper Divisor
- Proper Fraction
- Proper Integral
- Proper k-Coloring
- Proper Subset
- Proper Superset