No label defined (Q4510359)
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 1521537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1521537 |
Statements
25 October 2000
0 references
prime numbers
0 references
0.8928109
0 references
0.8915569
0 references
0.8910979
0 references
0 references
The author gives a short proof, by induction, of the following interesting result due to \textit{J. B. Rosser} and \textit{L. Schoenfeld} [Ill. J. Math. 6, 64-96 (1962; Zbl 0122.05001)]: For every positive integer \(n\geq 13\) one has \(p_1p_2\cdots p_n\geq n^n\), where \((p_n)_{n\geq 1}\) is the sequence of positive prime numbers. The author also proves a stronger result: For every \(n\geq 2\) one has \(\root n\of{p_1p_2\cdots p_n}>(n\log n)/6\). In particular, it follows that \(\root n\of{p_1p_2\cdots p_n}>2n\) for every \(n>162755\).
0 references
