MathDB
Question 1

Source: Iran TST 2006

April 29, 2006
algebrapolynomialcombinatorial geometryIMO ShortlistRing Theorycombinatorics proposedcombinatorics

Problem Statement

We have nn points in the plane, no three on a line. We call kk of them good if they form a convex polygon and there is no other point in the convex polygon. Suppose that for a fixed kk the number of kk good points is ckc_k. Show that the following sum is independent of the structure of points and only depends on nn : i=3n(1)ici \sum_{i=3}^n (-1)^i c_i