The number of positive integers x and free of prime factors >y

DOI10.1016/0022-314X(85)90057-5MaRDI QIDQ1064342zbMATH OpenOpenAlexFDO

Authors Douglas Hensley

Publication date 1985

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-314x(85)90057-5

zbMATH Keywords

asymptotic formulaDickman functionintegers free of large prime factorslower bound

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Asymptotic results on arithmetic functions (11N37)

Review text

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).

Recommendations

• On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
• scientific article; zbMATH DE number 3235385
• Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor)
• On Integers Free of Large Prime Factors
• Integers without large prime factors: from Ramanujan to de Bruijn

Cites work

• scientific article; zbMATH DE number 3119383 (Why is no real title available?)
• scientific article; zbMATH DE number 3492781 (Why is no real title available?)
• scientific article; zbMATH DE number 3805629 (Why is no real title available?)
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• scientific article; zbMATH DE number 3226335 (Why is no real title available?)
• scientific article; zbMATH DE number 3235403 (Why is no real title available?)
• scientific article; zbMATH DE number 3343743 (Why is no real title available?)
• scientific article; zbMATH DE number 3051056 (Why is no real title available?)
• scientific article; zbMATH DE number 3066012 (Why is no real title available?)
• Numbers with small prime factors, and the least 𝑘th power non-residue
• On a problem of Oppenheim concerning Factorisatio Numerorum
• On the Number of Positive Integers ≦x all of Whose Prime Factors are ≦y
• The number of positiv integers \(\leq x\) and free of prime divisors \(>x^c\), and a problem of S. S. Pillai

Cited in

(10)

• On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
• A property of the counting function of integers with no large prime factors
• On the number of prime factors of integers without large prime divisors
• Integers without large prime factors
• The Number of Factorizations of Numbers Less than x Into Divisors Greater than y
• On Integers Free of Large Prime Factors
• scientific article; zbMATH DE number 4095603 (Why is no real title available?)
• The number of unsieved integers up to x
• scientific article; zbMATH DE number 3235385 (Why is no real title available?)
• Nicolaas Govert de Bruijn, the enchanter of friable integers

This page was built for publication: The number of positive integers \(\leq x\) and free of prime factors \(>y\)

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