On the distribution of <i>αp</i>^k modulo 1 (Q4352099)

Let \(\alpha\) be an irrational real number and \(\beta\) be any real number. For any real \(x\) write \(|x|= \min_{n\in \mathbb{Z}} |x-n |\). Using a sieve technique developed by \textit{G. Harman} [J. Lond. Math. Soc., II. Ser. 27, 9-18 (1983; Zbl 0504.10018)], the author proves that for any integer \(k\geq 3\) and any \(\varepsilon>0\) there are infinitely many primes \(p\) such that \[ |\alpha p^k+ \beta|<p^{- \sigma+ \varepsilon} \] where \[ \sigma = \begin{cases} 5/56 \quad & \text{if } k=3, \\ 1/21 \quad & \text{if } k=4, \\ (0.815)2^{-k} \quad & \text{if } k\geq 5. \end{cases} \] For \(3\leq k\leq 12\), the above result is an improvement of a result by \textit{R. C. Baker} and \textit{G. Harman} [Mathematika 38, 170-184 (1991; Zbl 0751.11037)] who obtained \(\sigma= (2/3)2^{-k}\).