Counting & ProbabilityEasyRecursion, Catalan Numbers & Generating Functions
Recursion, Catalan Numbers & Generating Functions · Easy problem
How many ways are there to cut a convex hexagon (-gon) into triangles using non-crossing diagonals?
How many ways are there to cut a convex hexagon (-gon) into triangles using non-crossing diagonals?