benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let n≥3 be a positive integer. Find the maximum number of diagonals in a regular n-gon one can select, so that any two of them do not intersect in the interior or they are perpendi…

Problem

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

problem

Let n≥3n \geq 3 be a positive integer. Find the maximum number of diagonals in a regular nn-gon one can select, so that any two of them do not intersect in the interior or they are perpendicular to each other.
Plain-text mathematical notation (without MathML)
Let n≥3 be a positive integer. Find the maximum number of diagonals in a regular n-gon one can select, so that any two of them do not intersect in the interior or they are perpendicular to each other.
Original LaTeX notation
Let $n \geq 3$ be a positive integer. Find the maximum number of diagonals in a regular $n$-gon one can select, so that any two of them do not intersect in the interior or they are perpendicular to each other.

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

task_id
c5d4f963-dd55-5933-afe2-d6cd814d9d54
task_key
test--c5d4f963-dd55-5933-afe2-d6cd814d9d54
task_revision_id
1
config / split
/ test

Official source

initial import