MathDB
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 ABAB where A=(0,0)A = (0, 0) and B=(51,51)B = (51, 51), and the interior angles at AA and BB are both at most 4545 degrees. Assuming no 180180 degree angles, what is the maximum number of vertices this polygon can have?