Problem 52629. Count the ways to draw non-intersecting chords between points on a circle
There are 9 ways to draw non-intersecting chords between four points on the perimeter of a circle (including no chords at all). In this case there is no way to draw three chords between the four points because two would have to intersect at one of the points or elsewhere.
Write a function to count the ways to draw non-intersecting chords between a given number of points.
Solution Stats
Problem Comments
-
1 Comment
Rafael S.T. Vieira
on 28 Nov 2022
Tip: Counting is not as easy as we think. It depends on what we are counting. Counting primes up to n, for instance, is hard. However, It is easy when a pattern or formula can be found...
Solution Comments
Show commentsProblem Recent Solvers9
Suggested Problems
-
1349 Solvers
-
1412 Solvers
-
280 Solvers
-
Arrange Vector in descending order
11372 Solvers
-
Chebyshev polynomials of the 1st Kind
71 Solvers
More from this Author281
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!