benchmarks.wiki / Public workspace

Omni-MATH / Let n≥5 be a given integer. Determine the greatest integer k for which there exists a polygon with n vertices (convex or not, with non-selfintersecting boundary) having k internal … · Discussion

Discussing Let n≥5 be a given integer. Determine the greatest integer k for which there exists a polygon with n vertices (convex or not, with non-selfintersecting boundary) having k internal … · 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.