The least \(k\)-th power non-residue (Q2254218)

Let \(p\) be a prime number and let \(k\geq 2\) be a divisor of \(p-1\). By \(g(p,k)\) denote the least \(k\)-th power non-residue modulo \(p\), i.e., the least natural \(q\) such that congruence \(x^k\equiv q\,( {\text{mod}}\, p)\) is not satisfied for all integer \(0<x<p\). The author proves that \(g(k,p)\leq 0.9\,p^{1/4}\log p\) unless \(k=2\) and \(p\equiv 3\,( \text{mod}\,4)\), in which case \(g(p,2)\leq 1.1\,p^{1/4}\log p\). The obtained bounds improve \textit{K. K. Norton}'s results [Mem. Am. Math. Soc. 106, 106 p. (1971; Zbl 0211.37801)].