The number of positive integers \(\leq x\) and free of prime factors \(>y\) (Q1064342)

From MaRDI portal





scientific article; zbMATH DE number 3918481
Language Label Description Also known as
default for all languages
No label defined
    English
    The number of positive integers \(\leq x\) and free of prime factors \(>y\)
    scientific article; zbMATH DE number 3918481

      Statements

      The number of positive integers \(\leq x\) and free of prime factors \(>y\) (English)
      0 references
      0 references
      1985
      0 references
      Let \(\Psi(x,y)\) denote the number defined in the title. According to a classical result of \textit{N. G. de Bruijn} [Ned. Akad. Wet. Proc., Ser. A 54, 50-60 (1951; Zbl 0042.04204)] the asymptotic formula \(\Psi(x,y)\sim x \rho (u)\), where \(u=\log x/\log y\) and \(\rho(u)\) is the Dickman function, holds uniformly in the range \(1\leq u\leq (\log x)^{3/8-\varepsilon}\), as \(y\to \infty\). Using a probabilistic approach, the author shows that the lower bound \(\Psi(x,y)\gg x \rho (u)\) remains valid in the larger range \(1\leq u\leq \log x/(\log \log x)^{5/3+\varepsilon},\) and derives a similar, but weaker bound for the range \(1\leq u\leq \log x/(1+\log \log x).\) (Remark: These results have been improved in the meantime by the reviewer; see the review Zbl 0575.10038).
      0 references
      integers free of large prime factors
      0 references
      asymptotic formula
      0 references
      Dickman function
      0 references
      lower bound
      0 references

      Identifiers