How many chords can be drawn through \(21\) points on a circle \(?\)
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine 21 friends standing in a circle. A chord is just a straight line drawn between any two friends. To count all possible chords, we count every unique pair of friends we can connect. Picking friend A and friend B gives the same line as picking B and A, so order does not matter. We use a special counting method called combinations. The answer turns out to be \( 210 \) different chords in total.
Answer: The number of chords that can be drawn through 21 points on a circle is \( 210 \).
A chord of a circle is a straight line segment whose two endpoints both lie on the circle. So to draw one chord, we simply need to pick 2 points out of the given points on the circle, and join them. Since a chord is completely determined by its two endpoints (and joining point A to point B gives the same chord as joining point B to point A), the order in which we pick the two points does not matter. Whenever order does not matter and we are choosing a group of items, we use combinations, denoted \( {}^{n}C_{r} \). Here we choose \( r = 2 \) points from \( n = 21 \) points, so the total number of chords is \( {}^{21}C_{2} \).
\( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \)
The number of chords that can be drawn through 21 points on a circle is \( 210 \).
A common mistake is using permutations \( {}^{21}P_{2} = 420 \) instead of combinations. Since a chord from A to B is the same as from B to A, order should not matter, so we must use \( {}^{21}C_{2} = 210 \), which is exactly half of the permutation value.
The number of chords that can be drawn through 21 points on a circle is \( 210 \).
One common mistake: using permutations \( {}^{21}P_{2} = 420 \) instead of combinations, which counts the pair (A, B) and (B, A) as two different chords — but they are the same chord, so the answer must be halved.
Answer: The number of chords that can be drawn through 21 points on a circle is \( 210 \).
Question: There are 15 points on a circle. How many distinct chords can be drawn by joining these points?
Solution: Each chord is determined by choosing any 2 of the 15 points on the circle. Since order does not matter (the chord from A to B is the same as from B to A), we use combinations. Number of chords = \( {}^{15}C_{2} \) Applying the formula \( {}^{n}C_{2} = \dfrac{n(n-1)}{2} \) with \( n = 15 \): \[ {}^{15}C_{2} = \frac{15 \times 14}{2} \] \[ {}^{15}C_{2} = \frac{210}{2} \] \[ {}^{15}C_{2} = 105 \] Therefore, the total number of distinct chords that can be drawn is 105.
Answer: 105 chords
Question: A circle has 28 points marked on it such that no three points are collinear. Find the total number of chords that can be formed by joining these points.
Solution: A chord is formed by joining any 2 of the 28 points on the circle. Since the order of the two endpoints does not matter, we select 2 points from 28 using combinations. Number of chords = \( {}^{28}C_{2} \) Using the formula \( {}^{n}C_{2} = \dfrac{n(n-1)}{2} \) with \( n = 28 \): \[ {}^{28}C_{2} = \frac{28 \times 27}{2} \] \[ {}^{28}C_{2} = \frac{756}{2} \] \[ {}^{28}C_{2} = 378 \] Therefore, the total number of distinct chords that can be drawn is 378.
Answer: 378 chords
Question: There are 18 points on a circle, no three of which are collinear. How many distinct chords can be drawn by joining these points?
Answer: The number of distinct chords that can be drawn through 18 points on a circle is \( {}^{18}C_{2} = 153 \).