Let $p$ be a prime and let $F=\mathbb{F}_p$. Prove that there exists an irreducible polynomial $f\in F[x]$ with $\deg(f)=2014$.
Attempt:
Assume in contradiction that every polynomial $f\in F[x]$ of degree $2014$ is reducible. Let $f\in F[x]$. (My problem is to find a proper $f$ such that I will get a contradiction). There exist $g,h\in F[x]$ s.t. $$ F[x]\ni f(x)=g(x)\cdot h(x)$$ If we look at $f$ as an element in $\mathbb{Z}[x]$ then we get that there exists some $r\in\mathbb{Z}[x]$ s.t. $$\mathbb{Z}[x] \ni f(x)=g(x)\cdot h(x) +p\cdot r(x)$$
Hint Consider the extension $$\mathbb{F} \subseteq \mathbb{F}_{p^{2014}}$$
Since the multiplicative group of $\mathbb{F}_{p^n}$ is cyclic, there exists some generator $b$. Then $\mathbb{F}_{p^n}=\mathbb{F}[b]$.
What can you say about the minimal polynomial of $b$?
Note The existence of an irreducible polynomial of degree $n$ ove $\mathbb{F}$ is equivalent to the existence of $\mathbb{F}_{p^n}$.