Erdős problem 647 · problems.science

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?$

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/647.lean

Formal Conjectures

FormalConjectures/ErdosProblems/647.leanErdos647.erdos_6471 lineExact file

1sorry ↔ ∃ n > 24, ⨆ m, ↑m + (ArithmeticFunction.sigma 0) ↑m ≤ n + 2

OpenStatement only, no proof

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI standalone
Erdős AI contributions wiki · 28 Jan, 2026
Machine
ChatGPT Deep research, DeepSeek DeepThink, Gemini
Open the source record
Conditional on conjectures
GPT-Erdős
Open the source record