Combinatoricshard
0:00.0

Consider a convex polygon with nn sides. How many ways can we choose 3 vertices such that no two are consecutive?