SOLVER7 Study. Nothing Else.
Exercise 7.1 Q14

Prove that \( \sum_{r=0}^{n} 3^{r}\,{}^{n}C_{r}=4^{n}.\)

CBSE Class 11 Maths · Binomial Theorem

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have a magic box that expands any sum raised to a power. The Binomial Theorem is that magic box. When we see a big sum with lots of pieces involving \( {}^{n}C_{r} \) and \( 3^{r} \), it is secretly just \( (1 + 3)^n \) hiding in disguise. Recognising that disguise lets us collapse the whole messy sum into one neat answer. The trick is choosing the right numbers to plug in, and here those numbers are 1 and 3.

Answer: \[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}.\]

📖 Proving the Binomial Sum Identity

Detailed Explanation

The Binomial Theorem for a positive integral index states how to expand \( (a + b)^n \) as a sum of terms containing binomial coefficients \( {}^{n}C_{r} \). The key idea in this problem is that a sum of the form \( \sum_{r=0}^{n} {}^{n}C_{r}\, a^{n-r} b^{r} \) is exactly the expansion of \( (a + b)^n \). So if we can match the given sum with a suitable choice of \( a \) and \( b \), we can collapse the whole sum into a single closed-form expression. Here the sum \( \sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} \) contains a \( 3^{r} \) but no factor depending on \( n-r \). This suggests we substitute \( a = 1 \) and \( b = 3 \) into the Binomial Theorem, because \( 1^{n-r} = 1 \) does not change anything.

Formula Used

\[(a + b)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, a^{n-r} b^{r}\]

Solution

  1. Step 1: Write down the general statement of the Binomial Theorem for a positive integer \( n \): \[(a + b)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, a^{n-r} b^{r}.\] Our goal is to choose \( a \) and \( b \) so that the right-hand side becomes the given sum.
  2. Step 2: Look at the given sum \( \sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} \). It has \( {}^{n}C_{r} \) and a factor \( 3^{r} \), but no factor raised to the power \( n-r \). To make the \( a^{n-r} \) term disappear, choose \( a = 1 \), since \( 1^{n-r} = 1 \). To produce the \( 3^{r} \), choose \( b = 3 \).
  3. Step 3: Substitute \( a = 1 \) and \( b = 3 \) into the Binomial Theorem: \[(1 + 3)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, (1)^{n-r} (3)^{r}.\]
  4. Step 4: Simplify each factor. Since \( 1^{n-r} = 1 \), the term \( (1)^{n-r} \) can be dropped, giving \[(1 + 3)^n = \sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r}.\]
  5. Step 5: Evaluate the left-hand side. Since \( 1 + 3 = 4 \), we get \[(1 + 3)^n = 4^{n}.\] Therefore \[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n},\] which is exactly what we wanted to prove.

Final Answer

\[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}.\]

Common Mistake

A common mistake is choosing \( a = 3 \) and \( b = 1 \) instead of \( a = 1 \) and \( b = 3 \). This would produce \( 3^{n-r} \) rather than the required \( 3^{r} \). Always match the exponent \( r \) with \( b \), because in the standard form \( {}^{n}C_{r}\, a^{n-r} b^{r} \) it is \( b \) that carries the power \( r \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write out the target sum clearly: \[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r}\] Reason: Identifying what the sum looks like helps us match it term-by-term with the standard binomial expansion.
  2. Step 2: Recall the Binomial Theorem: \[(a + b)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, a^{n-r} b^{r}\] Reason: This is our main tool — we need to find values of \( a \) and \( b \) such that the right-hand side matches the given sum exactly.
  3. Step 3: Compare the given sum \( \sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} \) with the general term \( {}^{n}C_{r}\, a^{n-r} b^{r} \). The given sum has \( 3^{r} \) but no factor raised to the power \( n - r \). To remove the \( a^{n-r} \) dependence, set \( a = 1 \), because \( 1^{n-r} = 1 \) for all \( r \). To produce the factor \( 3^{r} \), set \( b = 3 \). Reason: Matching coefficients term-by-term reveals the correct substitution.
  4. Step 4: Substitute \( a = 1 \) and \( b = 3 \) into the Binomial Theorem: \[(1 + 3)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, (1)^{n-r} (3)^{r}\] Reason: Plugging in these values transforms the left side into a simple number and the right side into the given sum.
  5. Step 5: Simplify \( (1)^{n-r} = 1 \) for every term, so the right side reduces to \( \sum_{r=0}^{n} {}^{n}C_{r}\, 3^{r} \), which is exactly the given sum. Reason: Since \( 1 \) raised to any power is still \( 1 \), it does not alter any term in the expansion.
  6. Step 6: Evaluate the left side: \( 1 + 3 = 4 \), so \( (1 + 3)^n = 4^n \). Reason: This gives the closed-form value of the entire summation in one neat expression.
  7. Step 7: Combine both sides to state the final result: \[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}\] Reason: Equating the simplified left side to the identified right side completes the proof.

Final Answer

\[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}.\]

Common Mistake

One common mistake: Students sometimes forget to simplify \( 1^{n-r} \) to \( 1 \), and incorrectly think there is no valid binomial substitution because the term \( a^{n-r} \) appears to be missing from the given sum.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Apply the Binomial Theorem with \( a = 1 \) and \( b = 3 \): \[(1 + 3)^n = \sum_{r=0}^{n} {}^{n}C_{r}\,(1)^{n-r}(3)^{r}\]
  2. Step 2: Since \( (1)^{n-r} = 1 \), the right side simplifies to \( \displaystyle\sum_{r=0}^{n} {}^{n}C_{r}\, 3^{r} \), and the left side gives \( 4^n \).
  3. Step 3: \[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}\]

Answer: \[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}.\]

➕ More Examples

More Examples

Example 1

Question: Prove that \[ \sum_{r=0}^{n} 2^{r}\, {}^{n}C_{r} = 3^{n}. \]

Solution: We begin with the Binomial Theorem, which states: \[ (1 + x)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, x^{r} \] We substitute \( x = 2 \) on both sides. The left-hand side becomes: \[ (1 + 2)^n = 3^n \] The right-hand side becomes: \[ \sum_{r=0}^{n} {}^{n}C_{r}\, 2^{r} \] Equating both sides: \[ \sum_{r=0}^{n} {}^{n}C_{r}\, 2^{r} = 3^{n} \] Hence proved.

Answer: \( \displaystyle\sum_{r=0}^{n} 2^{r}\, {}^{n}C_{r} = 3^{n} \)

Example 2

Question: Prove that \[ \sum_{r=0}^{n} {}^{n}C_{r}\, 4^{r} = 5^{n}. \]

Solution: We use the Binomial Theorem: \[ (1 + x)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, x^{r} \] We substitute \( x = 4 \) on both sides. The left-hand side becomes: \[ (1 + 4)^n = 5^n \] The right-hand side becomes: \[ \sum_{r=0}^{n} {}^{n}C_{r}\, 4^{r} \] Equating both sides: \[ \sum_{r=0}^{n} {}^{n}C_{r}\, 4^{r} = 5^{n} \] Hence proved.

Answer: \( \displaystyle\sum_{r=0}^{n} {}^{n}C_{r}\, 4^{r} = 5^{n} \)

🎯 Try a Similar Question

Try a Similar Question

Question: Prove that \[\sum_{r=0}^{n} 2^{r}\, {}^{n}C_{r} = 3^{n}.\]

Solution

  1. Step 1: Recall the Binomial Theorem: By the Binomial Theorem, for any positive integer \( n \) and any real number \( x \), we have \[(1 + x)^{n} = \sum_{r=0}^{n} {}^{n}C_{r}\, x^{r}.\]
  2. Step 2: Choose an appropriate value of x: We want to produce the factor \( 2^{r} \) in the summation. So we substitute \( x = 2 \) in the Binomial expansion. This gives \[(1 + 2)^{n} = \sum_{r=0}^{n} {}^{n}C_{r}\, 2^{r}.\]
  3. Step 3: Simplify the left-hand side: Simplify the left-hand side: \[1 + 2 = 3,\] so the left-hand side becomes \( 3^{n} \).
  4. Step 4: Write the final result: Therefore, \[\sum_{r=0}^{n} 2^{r}\, {}^{n}C_{r} = 3^{n}.\] This completes the proof.

Answer: \[\sum_{r=0}^{n} 2^{r}\, {}^{n}C_{r} = 3^{n}.\]

Everything you get with Solver7

More questions in Binomial Theorem