Diophantine approximation over Piatetski-Shapiro primes (Q2308834): Difference between revisions

Consider the set \[ \mathcal N_{\gamma}=\{n\in\mathbb N: n=[m^{1/{\gamma}}]\text{ for some } m\in\mathbb N]\}. \] \textit{I. I. Piatetski-Shapiro} [Mat. Sb., Nov. Ser. 33(75), 559--566 (1953; Zbl 0053.02702)] proved that for \(\gamma>11/12\) this set contains infinitely many primes and also gave an asymptotic formula for their number. These primes are called Piatetski-Shapiro primes of index \(\gamma\) and were later intensively studied. \textit{I. I. Piatetski-Shapiro} [Mat. Sb., Nov. Ser. 30(72), 105--120 (1952; Zbl 0047.28001)] also investigated the question about the solubility of \[ |p_1^c+\ldots +p_s^c-N|<\varepsilon \] in primes \(p_1,\ldots,p_s\), where \(c>1\) is not an integer, \(\varepsilon>0\) and \(N\) is a large real number. There are upper bounds for the least integer \(s\) such that the above inequality is solvable for sufficiently large \(N\). \par The authors prove that if \(\gamma < 1< c\) and \(8(c-1)+21(1-\gamma)<1\), then for sufficiently large \(N\) the inequality \[|p_1^c+p_2^c+p_3^c-N|<(\log N)^{-1}\] has solutions in Piatetski-Shapiro primes of index \(\gamma\). Similar results (with different conditions) are obtained for \(s=4\) and \(s=2\).