IMOC 2018 G1 (k ways to draw a non-intersecting n-gon)
Source: https://artofproblemsolving.com/community/c6h1740825p11314688
March 22, 2020
geometrycombinatorial geometrypointspolygon
Problem Statement
Given an integer . Find the largest positive integer with the following property:
For points in general position, there exists ways to draw a non-intersecting polygon with those points as it’s vertices.[hide=Different wording]Given , find the maximum so that for every general position of points , there are at least ways of connecting the points to form a polygon.