On a problem of Erdős involving the largest prime factor of $n$
| dc.creator | Ivić, Aleksandar | |
| dc.date | 2003-11-05 | |
| dc.date | 2004-01-08 | |
| dc.date.accessioned | 2026-07-07T05:02:37Z | |
| dc.date.available | 2026-07-07T05:02:37Z | |
| dc.description | 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$. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/math/0311056 | |
| dc.identifier | http://arxiv.org/abs/math/0311056 | |
| dc.identifier | Monatsh. Math. 145, 35-46(2005) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69077 | |
| dc.subject | Number Theory | |
| dc.subject | 11N25, 11N37 | |
| dc.title | On a problem of Erdős involving the largest prime factor of $n$ | |
| dc.type | text |