Can someone help me with [number 27](http://people.cs.uchicago.edu/~laci/REU12/puzzles.pdf)? I have no idea how to do this.
27. (Irreducibility over finite fields) Let $p$ be a prime and $n$ a natural number.
(a) Prove that there is an irreducible polynomial over $\Bbb F_p$ of degree $n$.
(b) Prove that if $p^n$ is large then roughly a $1/n$ fraction of all monic polynomials of degree $n$ over $\Bbb F_p$ are irreducible.
(Ted said to use the sieve of Eratosthenes, but I'm not sure how.)