How large must $y(\varepsilon, n)$ be so that every interval $(x, x+y)$ contains at most $\varepsilon y$ integers having a divisor in $(n, 2n)$? The candidate proof gives the sharp fixed-$\varepsilon$ order $y = \Theta_\varepsilon(n)$, uniformly in the translate.

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