Diophantine approximation with square-free integers (Q3325813)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3857220
Language Label Description Also known as
default for all languages
No label defined
    English
    Diophantine approximation with square-free integers
    scientific article; zbMATH DE number 3857220

      Statements

      Diophantine approximation with square-free integers (English)
      0 references
      0 references
      1984
      0 references
      pairs of square-free integers
      0 references
      Two results are proved. Let \(\epsilon>0\) and \(\beta\in {\mathbb{R}}\) be given. Then, firstly, for almost all \(\alpha\in {\mathbb{R}}\) (in the sense of Lebesgue measure) there are infinitely many pairs of square-free m,\(n\in {\mathbb{N}}\), such that \(| \alpha n-m+\beta |<n^{-1}(\log n)^{\epsilon}.\) Secondly, for every \(\alpha\in {\mathbb{R}}-{\mathbb{Q}}\), there are infinitely many pairs of square-free m,\(n\in {\mathbb{N}}\) such that \(| \alpha n-m+\beta |<n^{-1/2+\epsilon}.\) The first of these results is best possible, apart from the power of log n. The exponent 1/2 in the second result can conjecturably be replaced by 1. The proof of the first theorem uses a result in the metric theory of Diophantine approximation, due to \textit{W. J. LeVeque} [J. Reine Angew. Math. 202, 215-220 (1959; Zbl 0090.261)]. In the course of the proof one uses the fact that there exists an integer D (namely \(D=40)\) for which \(| \sum_{d| n,d\geq D}\mu(d)| \leq D/5\) for all n. It is not clear to the reviewer why such an integer should exist. The second theorem is proved using a simple character sum estimate. \textit{A. Balog} and \textit{A. Perelli} (to appear) have independently given a result of the same strength as the second theorem, by a similar method. However the reviewer (see the following review) has recently improved the exponent from 1/2 to 2/3 (at least for \(\beta =0)\).
      0 references

      Identifiers