For what values of $0 \leq m < n$ is there a complete sequence $A = \{a_1 \leq a_2 \leq \cdots\}$ of integers such that 1. $A$ remains complete after removing any $m$ elements, but 2. $A$ is not complete after removing any $n$ elements.

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