Question:

If $n \geq 2$ is a positive integer, then the sum of the series ${ }^{n+1} C_{2}+2\left({ }^{2} C_{2}+{ }^{3} C_{2}+{ }^{4} C_{2}+\ldots .+{ }^{n} C_{2}\right)$ is:

Updated On: Dec 30, 2025
  • $\frac{ n ( n -1)(2 n +1)}{6}$
  • $\frac{ n ( n +1)(2 n +1)}{6}$
  • $\frac{ n (2 n +1)(3 n +1)}{6}$
  • $\frac{ n ( n +1)^{2}( n +2)}{12}$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

To solve the given problem, we begin by understanding and simplifying the series.

The given series is:

\[{ }^{n+1} C_{2} + 2\left( { }^{2} C_{2} + { }^{3} C_{2} + { }^{4} C_{2} + \ldots + { }^{n} C_{2} \right)\]

We need to evaluate the sum: \({ }^{n+1} C_{2}\) and \(\sum_{k=2}^{n}{ }^{k} C_{2}\). Using the combination formula, where \({}^{r} C_{2} = \frac{r(r-1)}{2}\), we substitute into the series:

  1. \({ }^{n+1} C_{2} = \frac{(n+1)n}{2}\)
  2. For the second part: \(\sum_{k=2}^{n} { }^{k} C_{2} = \sum_{k=2}^{n} \frac{k(k-1)}{2}\)
    • Expand and simplify using summation: \(\sum_{k=2}^{n} \frac{k(k-1)}{2} = \frac{1}{2} \left[ \sum_{k=2}^{n} (k^{2} - k) \right]\)
    • Use known summation formulas:
      • \(\sum_{k=1}^{n} k = \frac{n(n+1)}{2}\)
      • \(\sum_{k=1}^{n} k^{2} = \frac{n(n+1)(2n+1)}{6}\)
    • Apply these to calculate:
      • \(\sum_{k=2}^{n} k = 1 + 2 + \ldots + n - (1) = \frac{n(n+1)}{2} - 1\)
      • \(\sum_{k=2}^{n} k^2 = \frac{n(n+1)(2n+1)}{6} - 1^2\)
    • Combine and substitute back into the main expression:

Now, substituting these into the series:

\({ }^{n+1} C_{2} = \frac{(n+1)n}{2}\)
and summation terms simplify to:
\(\frac{1}{2} \left[ \frac{n(n+1)(2n+1)}{6} - \frac{n(n+1)}{2} \right]\)

Combine these in the problem's expression:

\({ }^{n+1} C_{2} + 2\left(\frac{1}{2} \left[ \sum_{k=2}^{n} (k^{2}-k) \right] \right)\)

Upon simplifying further:

\({ }^{n+1} C_{2} + \left[ \sum_{k=2}^{n} (k^{2}-k) \right]\)

Simplifying both terms gives:

The final solution becomes: \(\frac{n(n+1)(2n+1)}{6}\)

Therefore, the correct option is:

 

$\frac{ n ( n +1)(2 n +1)}{6}$

 

Was this answer helpful?
1
0

Concepts Used:

Binomial Theorem

The binomial theorem formula is used in the expansion of any power of a binomial in the form of a series. The binomial theorem formula is 

Properties of Binomial Theorem

  • The number of coefficients in the binomial expansion of (x + y)n is equal to (n + 1).
  • There are (n+1) terms in the expansion of (x+y)n.
  • The first and the last terms are xn and yn respectively.
  • From the beginning of the expansion, the powers of x, decrease from n up to 0, and the powers of a, increase from 0 up to n.
  • The binomial coefficients in the expansion are arranged in an array, which is called Pascal's triangle. This pattern developed is summed up by the binomial theorem formula.