NL-NWO 1972 Problem 1

Prove that for every $n \in N$ , $n > 6$ , every equilateral triangle can be divided into $n$ pieces, which are also equilateral triangles.

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.