Given a convex polygon An+1 with n+1 sides (where ), partition the polygon into triangles using non-intersecting diagonals (referred to as a triangulation of ). How many different triangulation methods are there?
n≥
2
n−1
n−2
An+1
MathematicsOlympiadOlympiad #2037
An+11(n2n)
Bn−11(n−22n−4)
Cn1(n−12n−2)
D(n−12n−2)
E2n−2
Sign in to check your answer and unlock the solution.