Erdős Problems

Browse all problems

↑ ↓ to move↵ to openesc to close

Loading problem…

Status

On this page

Status

Topics

Terms Privacy info@plasma.ai

Problem 647 — Erdős Problems

Problem 647

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?

Source: erdosproblems.com/647

Number theory

Wiki page

Status

Open

No claim settles this problem.

Verifiable (the site's label, VERIFIABLE; page last edited 07 April 2026).

Er79: Erdős, Paul, Some unconventional problems in number theory. Math. Mag. (1979), 67-70.
Er79d: Erdős, P., Some unconventional problems in number theory. Acta Math. Acad. Sci. Hungar. (1979), 71-80.
Er92e: Erdős, Pál, Some Unsolved problems in Geometry, Number Theory and Combinatorics. Eureka (1992), 44-48.

Proof claims

Loading proof claims…

Discussion

Loading discussion…

PreviousProblem 646 NextProblem 648

On this page

Statement
Status
References
Proof claims
Discussion

Status: Open
Topics: Number theory
In the wiki: Wiki page