Algebra, V, p. 166
a) Let q be a power of a prime number. Show that for every integer n>1, if hi (1≤i≤r) are the distinct prime divisors of the integer n, then the number of elements ζ∈Fqn such that Fqn=Fq(ζ) is equal to
v=qn−i∑qn/hi+i<j∑qn/hihj−i<j<k∑qn/hihjhk+⋯+(−1)rqn/h1h2…hr (observe that such an element is characterized by the property of not belonging to any of the fields
Fqn/hi). If
h1≤…≤hr, we have
qn−i∑qn/hi≤v≤qn−qn/h1. Examine the case where
n is a prime power. b) Let
bn(q) be the number of monic irreducible polynomials of degree
n over
Fq. Deduce from a) an expression for
bn(q). In particular, if
q≥3, show that the number of polynomials (not necessarily monic) of degree
n in
Fq[X] which are irreducible is at least equal to
qn(q−2)/n≥qn+1/3n. c) Prove that
∑d∣ndbd(q)=qn (establish the identity
1/(1−qT)=∏(1−Tn)−bn(q)). \* Using the Mobius inversion formula (Lie, II, p. 176, Appendix), show that
nbn(q)=d∣n∑μ(n/d)qd. Compare this result with that obtained in b). d) Let
an(q) be the number of monic polynomials without multiple factors in
Fq[X]. Show that
a0(q)=1, a1(q)=q, an(q)=qn−qn−1 for
n>1 (establish the identity
qn=∑an−2i(q) qi).