olymmath

Putnam 1969 A3

  • Session A

Let PP be a non-selfintersecting closed polygon with nn sides. Let its vertices be P1,P2,…,Pn.P_1 , P_2 ,\ldots, P_n . Let mm other points, Q1,Q2,…,QmQ_1 , Q_2 ,\ldots, Q_m , interior to PP , be given. Let the figure be triangulated. This means that certain pairs of the (n+m)(n+m) points P1,…,QmP_1 ,\ldots , Q_m are connected by line segments such that (i) the resulting figure consists exclusively of a set TT of triangles, (ii) if two different triangles in TT 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 TT is precisely the set of the (n+m)(n+m) points P1,…,Qm.P_1 ,\ldots , Q_m. How many triangles are in TT ?

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 putnam/1969/a3 · Tag XC2FMXKXPF · Edit this page on GitHub · Keys: j next, k previous