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 …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let n≥5n \geq 5 be a given integer. Determine the greatest integer kk for which there exists a polygon with nn vertices (convex or not, with non-selfintersecting boundary) having kk internal right angles. [i]
Plain-text mathematical notation (without MathML)
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 right angles.

[i]
Original LaTeX notation
Let $n \geq 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 right angles.

[i]

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import