Elementary estimations of the least common multiple (Q2563989)

It is well-known that the prime number theorem \(\pi(x)\sim\frac{x}{\log x}\) is equivalent to \(\lim_{n\to\infty} \root n\of{V(n)}=e\), where \(V(n)\) denotes the least common multiple of the natural numbers \(1,\dots,n\). By elementary means the authors show the estimates \[ (2.51)^n<V(n)<(2.95)^n\quad \text{for }n\geq 41, \] which sharpens a result of \textit{U. Felgner} [Elem. Math. 46, 17-25 (1991; Zbl 0688.10004)]. A consequence is an improvement of Bertrand's postulate: For \(n\geq 25\) there exists a prime between \(n\) and \(1.2 n\).