On a problem of Erd\H{o}s involving the largest prime factor of $n$

arxiv: math/0311056 · v2 · submitted 2003-11-05 · 🧮 math.NT

On a problem of ErdH{o}s involving the largest prime factor of n

Aleksandar Ivi\'c This is my paper

classification 🧮 math.NT

keywords factorlargestprimeasymptoticdivideformulagiveninvolving

0 comments

read the original abstract

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

This paper has not been read by Pith yet.