* Let $2 n$ equally spaced points be chosen on a circle. Let $h_{n}$ denote the number of ways to join these points in pairs so that the resulting line segments do not intersect. Establish a recurrence relation for $h_{n}$
Added by Angelica C.
Step 1
Choose an arbitrary point on the circle. There are $2n-1$ other points to which it can be connected. Show more…
Show all steps
Your feedback will help us improve your experience
Supreeta N and 99 other Geometry educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
There are 2n points on a circle. We want to divide them into pairs and connect each pair with a segment (i.e. a chord) in such a way that these segments do not intersect. Show that the number of ways to do this is given by a Catalan number.
Madhur L.
Choose n points on a circle so that no three chords meet at a common point inside the circle. Let an be the number of regions formed inside the circle by all the chords. (i) Obtain a recurrence an = an-1 + f(n), where f(n) = (n-1) + ÎŁ(i-1)(n-1-i) with a0 = 1. (ii) Solve the recurrence in (i) to obtain a formula for an as a sum of three binomial coefficients.
Sri K.
Two points on a circle determine two distinct arcs. How many arcs are determined by $n$ points on a circle? (Hint: Make a table and look for a pattern.) FIGURE CAN'T COPY.
Circles
Arcs and Chords
Recommended Textbooks
Geometry A Common Core Curriculum
Geometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD