Prove that \( \sum_{r=0}^{n} 3^{r}\,{}^{n}C_{r}=4^{n}.\)
CBSE Class 11 Maths · Binomial Theorem
CBSE Class 11 Maths · Binomial Theorem
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}.\]
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.
\[(a + b)^n = \sum_{r=0}^{n} {}^{n}C_{r}\, a^{n-r} b^{r}\]
\[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}.\]
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 \).
\[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}.\]
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.
Answer: \[\sum_{r=0}^{n} 3^{r}\, {}^{n}C_{r} = 4^{n}.\]
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} \)
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} \)
Question: Prove that \[\sum_{r=0}^{n} 2^{r}\, {}^{n}C_{r} = 3^{n}.\]
Answer: \[\sum_{r=0}^{n} 2^{r}\, {}^{n}C_{r} = 3^{n}.\]