If each integer has at most $r$ representations $m = pa$ with $p$ prime and $a \in A \subseteq [1, N]$, what is the best upper bound for $\sum_{a \in A} 1/a$? The candidate proof gives the matching order $\Theta_r(\log N / \log\log 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