olymmath

DE-BUNDESWETTBEWERB 2005 Problem 8

  • Round 2

For any integer n≥3n\geq 3 , let A(n)A\left(n\right) denote the maximal number of self-intersections a closed broken line P1P2...PnP1P_1P_2...P_nP_1 can have; hereby, we assume that no three vertices of the broken line P1P2...PnP1P_1P_2...P_nP_1 are collinear.

Prove that

(a) if n is odd, then A(n)=n(n−3)2A\left(n\right)=\frac{n\left(n-3\right)}{2} ; (b) if n is even, then A(n)=n(n−4)2+1A\left(n\right)=\frac{n\left(n-4\right)}{2}+1 .

Note. A self-intersection of a broken line is a (non-ordered) pair of two distinct non-adjacent segments of the broken line which have a common point.

Dataset text AI-MO AoPS. Quoted with source.

Official text: Bundeswettbewerb Mathematik 2005 official paper, page 1.

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 de-bundeswettbewerb/2005/p8 · Tag CJ01Q0DA4T · Edit this page on GitHub · Keys: j next, k previous