Primes of the form \([n^ c]\) (Q5906692): Difference between revisions

The Piatetski-Shapiro prime number theorem states that \[ \pi_ c(x)= \#\{ p=[ n^ c], n\leq x\}\sim {x\over {c\log x}}, \] for \(1<c <\gamma\) for some \(\gamma>1\). The best result so far obtained is \(\gamma= {{6121} \over {5302}}\) [\textit{S. W. Graham} and \textit{G. Kolesnik}, Van der Corput's method for exponential sums (1991; Zbl 0713.11001)]. By combining sieve methods and exponential sum techniques the authors prove \[ \pi_ c (x)> {x\over {4c\log x}} \qquad \text{for} \quad 1<c\leq {20 \over 17} \quad \text{and} \quad x\geq x_ 0 (c). \]