scientific article; zbMATH DE number 1521537

From MaRDI portal
Publication:4510359





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











This page was built for publication:

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