arXiv · math/0311056
On a problem of Erdős involving the largest prime factor of $n$
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$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Aleksandar Ivić. 2004-01-08. On a problem of Erdős involving the largest prime factor of $n$. https://arxiv.org/abs/math/0311056
Cite the original work for its findings. Save a collection to share your selection of sources.