benchmarks.wiki / Public workspace

Omni-MATH / Let n>5 be an integer. There are n points in the plane, no three of them collinear. Each day, Tom erases one of the points, until there are three points left. On the i-th day, for … · Discussion

Discussing Let n>5 be an integer. There are n points in the plane, no three of them collinear. Each day, Tom erases one of the points, until there are three points left. On the i-th day, for … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.