2012 Spring Team #10
Source:
March 20, 2022
combinatoricsgeometry
Problem Statement
A convex polygon in the Cartesian plane has all of its vertices on integer coordinates. One of the sides of the polygon is where and , and the interior angles at and are both at most degrees. Assuming no degree angles, what is the maximum number of vertices this polygon can have?