Ottawa–Carleton
|
Home C&O Seminars Workshops |
27 March 2009, 11.30am
The number of irreducible polynomials
of degree n over Fq with
given trace and constant terms We improve the existing bounds for the number of irreducible polynomials of degree n over Fq with given trace and any arbitrary constant term. When n is a multiple of q–1, we give a simple and precise formula for the number of irreducible polynomials of degree n over Fq with given primitive constant term. |
Site maintained by Robert Bailey. Last updated: 25th March 2009