For any positive integer n we let P(n) be the largest prime factor of n. We improve and generalize several results of P. Erdos and C. Stewart on P(n!+1). In particular, we show that limsupn→∞P(n!+1)/n ≥ 2.5, which improves their lower bound of limsupn→∞P(n!+1)/n > 2.
|Number of pages||9|
|Journal||Bulletin of the London Mathematical Society|
|Publication status||Published - Dec 2005|