So you can formulate a brute force test that works for all n? That's a bold claim. Remember, you are trying to prove that for every natural number n, once you have 2^(n-2)+1 points in a plane, no three co-linear, there is a subset of n of them that form a convex n-gon.

How will you brute-force that?