Research notes on a density problem of Erdős (Q1587828)

If \(P(n)\) denotes the largest prime factor of \(n\), the author evaluates the cardinality \(S(x)\) of the set of integers \(n\) not more than \(x\) and that do not divide \(P(n)!\), a problem proposed by \textit{P. Erdős} in [Am. Math. Mon. 98, 965 (1991)]. The author proves elegantly that \(S(x)/x\ll\exp(-0.25\sqrt{\log x})\), improving an earlier estimate of \textit{I. Kastanas} [Am. Math. Mon. 101, 179 (1994)].