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

Let \(\pi_ c(x)\) be the number of integers \(n\leq x\) for which \([n^ c]\) is a prime. \(\pi_ c(x)\) behaves like (1/c)\(\pi\) (x) for c is not much bigger than 1. Improving the latest such result [due to \textit{D. R. Heath- Brown}, J. Number Theory 16, 242-266 (1983; Zbl 0513.10042)] the formula \[ \pi_ c(x)=x/(c \log x)+O(x/\log^ 2 x)\quad for\quad c<39/34 \] is proved. The small improvement is obtained by treating the ''type-I'' sums very carefully based on the author's estimate for multiple exponential sums [Acta Arith. 45, 115-143 (1985; see the preceding review)].