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

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

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