On a problem of Erdős involving the largest prime factor of n

2003/11/30 by Aleksandar Ivić
Mathematics · #math.NT #msc:11N25 #msc:11N37

paper · pdf

published as Monatsh. Math. 145, 35-46(2005) · 14 pages

arxiv created 2004/01/08 · arxiv updated 2009/12/01

Abstract

An asymptotic formula for the number of n ≤ x such that n does not divide P(n)! is given, where P(n) is the largest prime factor of n.

Related

• A note on the normal largest gap between prime factors
• Decomposing a factorial into large factors
• On Erdős problem # 648
• On the largest prime divisor of n!+1
• An improvement on the largest prime factors of consecutive integers