Diophantine approximation with smooth numbers
If \(\theta\) is irrational and \(\varphi\) is real, then we find an extensive literature on the existence of small distances from \(\theta n + \varphi\) to the nearest integer, when the integers \(n\) belong to thin (and not-so-thin) sets. In the paper at hand, the author treats this problem for smooth numbers \(n\), specifically for positive integers \(n\) with the property that all their prime factors are bounded above by \((\log n)^C\), for fixed \(C>2\). He shows that there are infinitely many such \(n\) with the property that the distances from \(\theta n + \varphi\) to the nearest integer satisfies, given \(\varepsilon > 0\), \[ \| \theta n + \varphi \| < n^{-{\left( \frac{1}{3} - \frac{2}{3C} \right)+\varepsilon}}. \] The proof of this results depends upon results from Diophantine approximation and careful use of exponential sums.
- Diophantine approximation with products of two primes
- Diophantine approximation with square-free numbers
- Distribution of $\alpha n +\beta $ modulo 1 over integers free from large and small primes
- Entiers Sans Grand Facteur Premier En Progressions Arithmetiques
- Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
- On the Distribution of αp Modulo One II
- Prime-detecting sieves
- Small fractional parts of quadratic forms
- The distribution of αp modulo one
This page was built for publication: Diophantine approximation with smooth numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158135)
