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
Solution Comments
Show comments
Loading...
Problem Recent Solvers12
Suggested Problems
-
Select every other element of a vector
36860 Solvers
-
596 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2893 Solvers
-
Project Euler: Problem 10, Sum of Primes
2124 Solvers
-
Split Even Number Into Two Primes
215 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
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...