benchmarks.wiki / Public workspace
Omni-MATH / ( Gregory Galparin ) Let P be a convex polygon with n sides, n≥3 . Any set of n−3 diagonals of P that do not intersect in the interior of the polygon determine a triangulation of P…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
( Gregory Galparin ) Let be a convex polygon with sides, . Any set of diagonals of that do not intersect in the interior of the polygon determine a triangulation of into triangles. If is regular and there is a triangulation of consisting of only isosceles triangles, find all the possible values of .
Plain-text mathematical notation (without MathML)
( Gregory Galparin ) Let P be a convex polygon with n sides, n≥3 . Any set of n−3 diagonals of P that do not intersect in the interior of the polygon determine a triangulation of P into n−2 triangles. If P is regular and there is a triangulation of P consisting of only isosceles triangles, find all the possible values of n .
Original LaTeX notation
( Gregory Galparin ) Let $\mathcal{P}$ be a convex polygon with $n$ sides, $n\ge3$ . Any set of $n - 3$ diagonals of $\mathcal{P}$ that do not intersect in the interior of the polygon determine a triangulation of $\mathcal{P}$ into $n - 2$ triangles. If $\mathcal{P}$ is regular and there is a triangulation of $\mathcal{P}$ consisting of only isosceles triangles, find all the possible values of $n$ .Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import