First basic definitions and proofs.
Found potentially better bound.
First complete proof.
Remove unused lemma.
First whack at problem formulation.
Encode trivial linear strategy.
Some comments on linear search.
Simplify some proofs with lia.
Make main theorem more intuitive.
Strengthen theorem a little bit.
Small tweak in some statements.
Function for finding optimal number.
Use simpler version of main theorem.
Remove strong version of main theorem.
Remove unused lemma.
Change lemma name.
Improve find_optimal guess.
Use eauto in end of proof.
Tweak definition of optimality.
Reorder definitions and lemmas, some text.