A problem of Hooley in Diophantine approximation

From MaRDI portal





In this paper the author proves: Let \(k\geq 2\) be an integer, \(b\) a fixed integer, and \(\alpha\) an irrational real number. Then, for any \(\varepsilon> 0\), there are infinitely many solutions to the inequality \(|\alpha n^k- m|< n^{-\rho(k)+\varepsilon}\) for \[ \rho(k)= \begin{cases} 2/5 &\text{if }k= 2,\\ (3.2^{k-2}- 1)^{-1} &\text{if }k\geq 3\end{cases} \] and \((bn, m)=1\). The result improves upon a result by \textit{C. Hooley} [Glasg. Math. J. 32, 309-316 (1990; Zbl 0715.11033)] who obtained \(\rho(k)= (2^k- 1)^{-1}\) if \(k\geq 3\). As a corollary, the author obtains: Let \(f(x)\) be a polynomial with integer coefficients having odd degree \(k\geq 3\). Then, for any given real irrational \(\alpha\), and any \(\varepsilon>0\), there are infinitely many moduli \(\lambda\) for which there is a solution \(\nu\) to \(f(\nu)\equiv 0\pmod\lambda\) and \[ |\alpha- (\nu/\lambda)|< \lambda^{-\tau(k)+\varepsilon} \] with \[ \tau(k)= {1\over k}+ {\rho(k-1)\over k(k-1)}. \] Here \(|x|\) denotes the distance from \(x\) to the nearest integer.











This page was built for publication: A problem of Hooley in Diophantine approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365265)