Given a regular N-sided polygon, how many ways can you draw K non-intersecting diagonals? Any pair of diagonals must not intersect strictly inside the polygon.
For e.g. N = 4 and K = 2 -> 2 ways

N = 5 and K = 2 -> 5 ways

N = 5 and K = 3 -> 0 ways
Given a regular N-sided polygon, how many ways can you draw K non-intersecting diagonals? Any pair of diagonals must not intersect strictly inside the polygon.
For e.g. N = 4 and K = 2 -> 2 ways

N = 5 and K = 2 -> 5 ways

N = 5 and K = 3 -> 0 ways
Copyright © 2021 JogjaFile Inc.