Let $A=\{n_1<n_2<\cdots\}$ be an infinite sequence of integers, and let $\phi_A(k)$ count the number of $1\leq m\leq n_k$ such that the fraction $\frac{m}{n_k}$ does not have denominator $n_j$ for $j<k$ when written in lowest form; equivalently, $$\frac{n_k}{(m,n_k)}\neq n_j$$ for all $1\leq j<k$.

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