Problem 52629. Count the ways to draw non-intersecting chords between points on a circle

• Created by ChrisR
• Appears in Sequences & Series V

×

Like (1)

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

81.82% Correct | 18.18% Incorrect

• 11 Solutions
• 9 Solvers

Last Solution submitted on Jul 17, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers9

Suggested Problems

• Find the alphabetic word product

  3385 Solvers

• First N Perfect Squares

  882 Solvers

• Project Euler: Problem 7, Nth prime

  1580 Solvers

• QWERTY Shift Code Decoder

  215 Solvers

• Create a vector

  10373 Solvers

More from this Author298

• Convert integers from primary notation to base 10

  7 Solvers

• Compute the harmonic numbers

  83 Solvers

• Compute the period of a pendulum started from a finite initial angle

  3 Solvers

• Label primes with the Erdos-Selfridge classification

  13 Solvers

• Construct dimensionless parameters

  4 Solvers