The divisors of integers II (Q3215015)

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 3427464
Language Label Description Also known as
default for all languages
No label defined
    English
    The divisors of integers II
    scientific article; zbMATH DE number 3427464

      Statements

      The divisors of integers II (English)
      0 references
      1975
      0 references
      This is a sequel to [the author, Acta Arith. 26, 41--46 (1974; Zbl 0272.10019)] and to \textit{P. Erdős} and the author [Acta Arith. 26, 175--188 (1974; Zbl 0272.10021)]. Let \( \|x\| \) denote the distance from \( x \) to the nearest integer. Then it is shown that if \( g(n)=\operatorname{lnf}\left\|\log d_{1}-\log d_{2}\right\|, d_{1}, d_{2} \mid n, d_{1} \neq d_{2} \) we have \[ 3^{-(1+\varepsilon) \log \log n}<g(n)<3^{-(1-\varepsilon) \log \log n} \] for every fixed \( \varepsilon>0 \) and almost all \(n\). \textit{P. Erdős} [J. Lond. Math. Soc. 39, 692--696 (1964; Zbl 0125.08602)] showed that if \( g_{1}(n) \) is defined similarly, but with \(\|\|\) replaced by \( \mid \), the same result holds for \( g_{1}(n) / \log n \).
      0 references

      Identifiers