A polynomial $f$ over a finite field $\mathbb{F}_{q}$ can be classified as a permutation polynomial by the Hermite–Dickson criterion, which consists of conditions on the powers $f^{e}$ for each $e$ from $1$ to $q-2$, as well as the existence of a unique solution to $f(x)=0$ in $\mathbb{F}_{q}$. Carlitz and Lutz gave a variant of the criterion. In this paper, we provide an alternate proof to the theorem of Carlitz and Lutz.

Let ${ \mathbb{F} }_{q} $ be the finite field of characteristic $p$ containing $q= {p}^{r} $ elements and $f(x)= a{x}^{n} + {x}^{m} $, a binomial with coefficients in this field. If some conditions on the greatest common divisor of $n- m$ and $q- 1$ are satisfied then this polynomial does not permute the elements of the field. We prove in particular that if $f(x)= a{x}^{n} + {x}^{m} $ permutes ${ \mathbb{F} }_{p} $, where $n\gt m\gt 0$ and $a\in { \mathbb{F} }_{p}^{\ast } $, then $p- 1\leq (d- 1)d$, where $d= \gcd (n- m, p- 1)$, and that this bound of $p$, in terms of $d$ only, is sharp. We show as well how to obtain in certain cases a permutation binomial over a subfield of ${ \mathbb{F} }_{q} $ from a permutation binomial over ${ \mathbb{F} }_{q} $.