On the distribution of prime numbers in a sequence of the form \([n^c]\) (Q1596184)

Let \(x\geq 1\) be a real number, \(c>0\) be an arbitrary constant and \(\pi_c(x)\) be the number of prime numbers of type \([n^c]\) for \(n\leq x\), where \([x]\) denotes the integer part of \(x\). The main result of the paper is the following improvement of the Piatetski-Shapiro prime number theorem. 1) For \(,1<c< c_0=\frac{149}{129} = 1 \frac{1}{6.45} = 1.1550\dots\) the asymptotic formula \[ \pi_c(x) = \frac{x}{c \log x} = O\biggl(\frac{x}{(\log x)^2}\biggr) \] is valid. Thus giving a better estimate for \(c_0\) than Rivat \((c_0= \frac{6121}{5302}= 1.1544\dots)\), Liu and Rivat \((c_0= \frac {15}{13}= 1.1538\dots)\), Kolesnik \((c_0= \frac {39}{34}= 1.1470\dots)\) and Heath-Brown \((c_0= \frac{755}{662}= 1.1404\dots\)). 2) For \(1<c<\frac{149}{129}\) the asymptotic formula \[ \sum \limits_{n\leq T} \tau_k([n^c]) = TQ_{k-1}(\ln T) + O\biggl(\frac{T}{\ln T}\biggr) \] is valid, where \(\tau_k(n)\) is the number of solutions in natural numbers \(x_1,\dots,x_k\) of the equations \( x_1\dots x_k = n\), \( Q_{k-1}(x)\) is a polynomial of degree \(k-1\).