Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting. is the number of highly composite numbers less than .
Conjecture (p. 117, unnumbered). The paper conjectures that
The print gives the value of the right side as , a misprint. The expression equals with and , which is . The conclusion (p. 129) likewise prints , where the value is , and the same on p. 130.
Basis given in the paper
Section 5 (pp. 129–130) gives the heuristic. If primes were spaced about apart near , the argument of Théorème 5 would give . If the linear forms satisfied for every , the paper says Théorème 1 would hold with and the proof of Théorème 3 with ; since and , only and would contribute, giving with . The paper adds that if the numbers were badly distributed, would probably have no limit. None of this is proved in the paper.
Read depth
Claims checked: the conjecture and Section 5 were read on the page images of the print, and the numerical values were recomputed from the printed expressions. Not independently reviewed.
Source. Jean-Louis Nicolas, Répartition des nombres hautement composés de Ramanujan, Canadian J. Math. 23 (1971), no. 1, 116–130, doi:10.4153/cjm-1971-012-6; the edition read is named on the source card.
Bears on
- Problem 381: the conjecture predicts the exponent of growth of that the problem's question concerns. It is a conjecture, not a result, and the problem's answer rests on Théorème 4.