Research notes on a density problem of Erdős

DOI10.1155/S0161171299226555MaRDI QIDQ1587828zbMATH OpenFDO

Authors Safwan Akbik

Publication date 28 February 2001

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/48941

zbMATH Keywords

densityfactoriallargest prime factorprimes

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Distribution of integers with specified multiplicative constraints (11N25)

Review text

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)].

Recommendations

• On a problem of Erdős involving the largest prime factor of n
• On a thin set of integers involving the largest prime factor function
• scientific article; zbMATH DE number 3619965
• A divisibility theorem for factorials
• Largest prime factor

Cited in

(5)

• A divisibility theorem for factorials
• On a problem of Erdős involving the largest prime factor of n
• Polynomial analogue of the Smarandache function
• Repercussions of a Problem of Erdős and Ulam on Density Ideals
• On a Conjecture of Balog

This page was built for publication: Research notes on a density problem of Erdős

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587828)