SOLVER7 Study. Nothing Else.
Exercise 6.4 Q3

How many chords can be drawn through \(21\) points on a circle \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

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 \).

📖 Number of Chords Through 21 Points on a Circle

Detailed Explanation

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} \).

Formula Used

\( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \)

Solution

  1. Step 1: Recognise that every chord is determined by choosing 2 endpoints. Since order does not matter (the chord joining points A and B is the same as the chord joining B and A), we use combinations, not permutations.
  2. Step 2: We have \( n = 21 \) points and we must choose \( r = 2 \) of them. So the required number of chords is \[ {}^{21}C_{2}. \]
  3. Step 3: Apply the combination formula: \[ {}^{21}C_{2} = \frac{21!}{2!\,(21-2)!} = \frac{21!}{2!\;19!}. \]
  4. Step 4: Expand and cancel \( 19! \): \[ {}^{21}C_{2} = \frac{21 \times 20 \times 19!}{2 \times 1 \times 19!} = \frac{21 \times 20}{2}. \]
  5. Step 5: Simplify the arithmetic: \[ \frac{21 \times 20}{2} = \frac{420}{2} = 210. \]

Final Answer

The number of chords that can be drawn through 21 points on a circle is \( 210 \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand what a chord needs: every chord requires exactly 2 endpoints, both lying on the circle. So the total number of distinct chords equals the number of ways to select 2 points from the 21 given points. — Reason: Once you pick any 2 points on the circle, exactly one straight line segment (chord) connects them.
  2. Step 2: Decide whether to use permutations or combinations. The chord joining point A to point B is identical to the chord joining point B to point A, so the order of selection does not matter. — Reason: Whenever order does not matter, we use combinations \( {}^{n}C_{r} \) rather than permutations \( {}^{n}P_{r} \).
  3. Step 3: Set up the combination. Here \( n = 21 \) (total points) and \( r = 2 \) (points needed per chord), so the required count is \[ {}^{21}C_{2}. \] — Reason: We are choosing a group of 2 from 21, which is the direct definition of \( {}^{21}C_{2} \).
  4. Step 4: Apply the combination formula: \[ {}^{21}C_{2} = \frac{21!}{2!\,(21-2)!} = \frac{21!}{2!\;19!}. \] — Reason: Substituting \( n = 21 \) and \( r = 2 \) directly into \( \dfrac{n!}{r!(n-r)!} \) gives this expression.
  5. Step 5: Cancel the common factorial \( 19! \) from numerator and denominator: \[ \frac{21!}{2!\;19!} = \frac{21 \times 20 \times 19!}{2 \times 1 \times 19!} = \frac{21 \times 20}{2}. \] — Reason: Writing \( 21! = 21 \times 20 \times 19! \) lets \( 19! \) cancel, leaving a simple product.
  6. Step 6: Carry out the final arithmetic: \[ \frac{21 \times 20}{2} = \frac{420}{2} = 210. \] — Reason: Multiplying 21 and 20 gives 420, and dividing by 2 gives the final count of chords.

Final Answer

The number of chords that can be drawn through 21 points on a circle is \( 210 \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Each chord requires choosing 2 points from 21, so the count is \ \( {}^{21}C_{2} \)
  2. Step 2: \[ {}^{21}C_{2} = \frac{21!}{2! \times 19!} = \frac{21 \times 20}{2 \times 1} \]
  3. Step 3: \[ {}^{21}C_{2} = \frac{420}{2} = 210 \]

Answer: The number of chords that can be drawn through 21 points on a circle is \( 210 \).

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

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?

Solution

  1. Step 1: Understand what a chord requires: A chord is uniquely determined by selecting any 2 points from the points lying on the circle. Since the order of the two endpoints does not matter, we use combinations.
  2. Step 2: Identify the values: Here the total number of points on the circle is \( n = 18 \). We need to choose 2 points at a time, so we compute \( {}^{18}C_{2} \).
  3. Step 3: Apply the combination formula: Using the formula \( {}^{n}C_{2} = \dfrac{n(n-1)}{2} \), substitute \( n = 18 \):
  4. Step 4: Calculate: \[ {}^{18}C_{2} = \frac{18 \times 17}{2} = \frac{306}{2} = 153 \]
  5. Step 5: State the result: Therefore, the total number of distinct chords that can be drawn through 18 points on a circle is 153.

Answer: The number of distinct chords that can be drawn through 18 points on a circle is \( {}^{18}C_{2} = 153 \).

Everything you get with Solver7

More questions in Permutations and Combinations