English

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

Number Theory 2007-05-23 v2

Abstract

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

Keywords

Cite

@article{arxiv.math/0311056,
  title  = {On a problem of Erd\H{o}s involving the largest prime factor of $n$},
  author = {Aleksandar Ivić},
  journal= {arXiv preprint arXiv:math/0311056},
  year   = {2007}
}

Comments

14 pages