Claim in Erdős problems named in new papers, 2026-10
A published paper or arXiv preprint answers the main question of Erdős Problem #647 (theorem erdos_647 in formal-conjectures) in full (proof, disproof, or the exact value asked for) with no hypotheses beyond the problem's own.
Let \tau(n) count the number of divisors of n. Is there some n > 24 such that \max_{m < n}(m + \tau(m)) \leq n + 2?
Verdict: no verdict yet
Evidence for
None yet.
Evidence against
None yet.