If n(p) is the least quadratic non-residue of a given prime p then it is known ((1)) that n(p) = O(pα) for any α > 1/(4 √e). LeVeque ((2), page 122) gives the following bound with an explicit constant: n( p) < √ p for p ≠ 2, 3, 7, 23. In the present paper an elementary and self-contained proof is given of a result slightly stronger than LeVeque's. Some numerical results, which indicate the extent to which the result proved falls short of what actually obtains, are appended.