Let $\tau(n)$ count the divisors of $n$ and $\tau^+(n)$ count the number of $k$ such that $n$ has a divisor in $[2^k, 2^{k+1})$. Is it true that, for all $\epsilon > 0$, $$\tau^+(n) < \epsilon \cdot \tau(n)$$ for almost all $n$?

How a contribution reaches this record

Seven steps, in four places.

1. 1

   Read the sources and their formal declarations.

   Public
2. 2

   Work on it, wherever you work.

   Your machine
3. 3

   Keep an Approach and its Attempts here.

   Needs an account
4. 4

   Attach evidence by its content root.

   Needs an account
5. 5

   Prepare an unsigned Submission draft.

   Needs an account
6. 6

   Sign it with your own key.

   Your machine
7. 7

   The Repository decides.

   The Repository