Erdős Problem #413 — Barriers for the distinct-prime-divisor function
For a positive integer , let be the number of distinct prime divisors of ; in particular, . The first question asks whether there are infinitely many positive integers such that
Such an is a barrier for . The second question asks whether there is a fixed real number for which infinitely many positive integers satisfy
Background
Erdős introduced the barrier terminology in 1979 and conjectured that has infinitely many barriers. The question sits among related problems about the behavior of iterated arithmetic functions: Erdős and Graham proposed it as a possible route to showing that iteration of eventually settles into one sequence, independently of the starting value. This was proposed as a motivation, not stated as a consequence already proved. Erdős Problems #413 Erdős (1979), Some unconventional problems in number theory
A related function considered by Erdős is when is its prime factorization. Erdős proved that has barriers on a set of positive density. The same account notes that Selfridge found to be the largest barrier for the prime-factor-counting function with multiplicity, , below . Erdős Problems #413 Erdős (1979), Some unconventional problems in number theory
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.