###### Mathematics

## Euler’s Polygon Triangulation Problem

Problem Let P be a convex polygon with \(n \) sides. Calculate in how many different ways the polygon can be divided into triangles using diagonals that do not intersect each other in the interior of P. This problem was proposed by Euler in 1751 to his friend Christian Goldbach. Read more…