Skip to content

Erdős problem 647

Let τ(n)\tau(n) count the number of divisors of nn. Is there some n>24n > 24 such that maxm<n(m+τ(m))n+2? \max_{m < n}(m + \tau(m)) \leq n + 2?
Retained from Formal Conjectures · not edited here
Formal statements
3 open · 1 solved
Erdős Problems says
verifiable
Decision here
No current contribution
Checks
0 checks · 4 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page