olymmath

USAMO 2008 Problem 4

Let P\mathcal{P} be a convex polygon with nn sides, n≥3n\ge3 . Any set of n−3n - 3 diagonals of P\mathcal{P} that do not intersect in the interior of the polygon determine a triangulation of P\mathcal{P} into n−2n - 2 triangles. If P\mathcal{P} is regular and there is a triangulation of P\mathcal{P} consisting of only isosceles triangles, find all the possible values of nn .

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator usamo/2008/p4 · Tag 46RMFM78WC · Edit this page on GitHub · Keys: j next, k previous