olymmath

APMO 1990 Problem 5

  • Paper

Show that for every integer n≥6n \geq 6, there exists a convex hexagon which can be dissected into exactly nn congruent triangles.

Dataset text NuminaMath olympiads. 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 apmo/1990/p5 · Tag 5R79Z8KPVC · Edit this page on GitHub · Keys: j next, k previous