Erdős 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?$

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

647.lean

Retained formal statement4 of 4

This is true for $n = 24$ .

FormalConjectures/ErdosProblems/647.leanErdos647.erdos_647.variants.twenty_four1 lineExact file

1⨆ m, ↑m + (ArithmeticFunction.sigma 0) ↑m ≤ 26

SolvedStatement only, no proof