Fall 2016, problem 21
Determine all values of $n$ such that it is possible to divide a triangle into $n$ smaller triangles such that there are not three collinear vertices and such that each vertex belongs to the same number of segments.
Determine all values of $n$ such that it is possible to divide a triangle into $n$ smaller triangles such that there are not three collinear vertices and such that each vertex belongs to the same number of segments.