olymmath

ISL 2000 C3

Let n≥4n \geq 4 be a fixed positive integer. Given a set S={P1,P2,…,Pn}S = \{P_1, P_2, \ldots, P_n\} of nn points in the plane such that no three are collinear and no four concyclic, let at,a_t, 1≤t≤n,1 \leq t \leq n, be the number of circles PiPjPkP_iP_jP_k that contain PtP_t in their interior, and let m(S)=a1+a2+⋯+an.m(S)=a_1+a_2+\cdots + a_n. Prove that there exists a positive integer f(n),f(n), depending only on n,n, such that the points of SS are the vertices of a convex polygon if and only if m(S)=f(n).m(S) = f(n).

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 isl/2000/c3 · Tag PBAGSYXSRE · Edit this page on GitHub · Keys: j next, k previous