Putnam 1969 A3
- Session A
Let be a non-selfintersecting closed polygon with sides. Let its vertices be Let other points, , interior to , be given. Let the figure be triangulated. This means that certain pairs of the points are connected by line segments such that (i) the resulting figure consists exclusively of a set of triangles, (ii) if two different triangles in have more than a vertex in common then they have exactly a side in common, and (iii) the set of vertices of the triangles in is precisely the set of the points How many triangles are in ?
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.
Similar problems
These problems have the most words in common with this statement.