scientific article; zbMATH DE number 2211874

From MaRDI portal
Publication:5694685





For any \(n \in \mathbb N\) let \(p_n\) (\(P_n\), resp.) denote the least (greatest, resp.) prime factor of \(n!+1\). By Wilson's theorem \(p_n=n+1\) if \(n+1\) is a prime. First results on the size of \(p_n\) and \(P_n\) were given by \textit{P. Erdős} and the author [J. Lond. Math. Soc., II. Ser. 13, 513--519 (1976; Zbl 0332.10028)]. It is easy to show that for any \(\varepsilon > 0\) there are infinitely many composite integers \(n+1\) with \(p_n < (2+\varepsilon)n\), and that \(P_n> 2n\) holds for infinitely many \(n\). Now it is proved that for any \(\varepsilon>0\) there are infinitely many odd \(n \in \mathbb N\) with \[ p_n < \left( \frac {\sqrt{145}-1} 8 + \varepsilon \right)n \] and that the set of \(n\) with \[ P_n > \left( \frac{11}2 - \varepsilon \right)n \] has positive lower asymptotic density. The key part for the proof is Lemma 2, which uses an upper bound for the square mean of the distances of consecutive primes by \textit{D. R. Heath-Brown} [J. Lond. Math. Soc., II. Ser. 20, 177--178 (1979; Zbl 0407.10032)] to estimate \(\text{gcd}(i_1!+1, \dots, i_t!+1)\) in a very ingenious, but elementary way.











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 Q5694685)