Let $S(x)$ count ordered pairs $(a,b)$ with $a+b \le x$ and $\sigma(a)+\sigma(b) = \sigma(a+b)$. Erdos asked whether $S(x) \sim cx$. The opposite extreme holds: for every $R > 0$, $S(x)/(x(\log x)^R) \to \infty$, so the count beats every fixed logarithmic scale.

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