Normal largest gap between prime factors (Q2199519): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some Remarks on Prime Factors of Integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some Properties of Prime Factors of Integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the distribution of prime divisors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cribler les entiers sans grand facteur premier / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5500818 / rank | |||
Normal rank |
Latest revision as of 14:58, 23 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Normal largest gap between prime factors |
scientific article |
Statements
Normal largest gap between prime factors (English)
0 references
11 September 2020
0 references
In private correspondence E. Sofos asked the author about normal and upper bounds for the function \(f(n)=\max_{1\le j<\omega(n)} \log\left(\log p_{j+1}(n))/\log p_j(n)\right)\), where \(p_1(n)< \cdots < p_{\omega(n)}\) are the distinct prime factors of \(n\) arranged increasingly. The author points out that in [Can. J. Math. 11, 161--167 (1959; Zbl 0092.04301)] \textit{P. Erdős} states without proof that for any \(c>0\) the density of the positive integers \(n\) with \(e^{f(n)}>c\log n\) is \(1-e^{-1/c}\). In this short note, the author gives a short proof of this statement in Erdős style.
0 references
distribution of prime factors
0 references
normal order
0 references
largest gap
0 references