Key Points

Binomial Theorem

14 Sections
  • Binomial Theorem for Positive Integral Indices

    The expansion of (a+b)n(a+b)^n for any positive integer n is (a+b)n=nC0an+nC1an1b+nC2an2b2++nCnbn(a+b)^n = {}^n\mathrm{C}_0 a^n + {}^n\mathrm{C}_1 a^{n-1}b + {}^n\mathrm{C}_2 a^{n-2}b^2 + \dots + {}^n\mathrm{C}_n b^n.

  • Binomial Theorem in Summation Notation

    The binomial theorem can be expressed concisely using sigma notation as (a+b)n=k=0nnCkankbk(a+b)^n = \sum_{k=0}^{n} {}^n\mathrm{C}_k a^{n-k}b^k.

  • Binomial Coefficients

    The coefficients nCr{}^n\mathrm{C}_r are known as binomial coefficients. They are calculated using the formula nCr=n!r!(nr)!{}^n\mathrm{C}_r = \frac{n!}{r!(n-r)!} where 0rn0 \le r \le n.

  • Pascal's Triangle

    Pascal's triangle is a triangular array of numbers where each number is the sum of the two numbers directly above it. The numbers in the row corresponding to index nn are the binomial coefficients nC0,nC1,,nCn{}^n\mathrm{C}_0, {}^n\mathrm{C}_1, \dots, {}^n\mathrm{C}_n.

  • Number of Terms in Expansion

    The total number of terms in the expansion of a binomial (a+b)n(a+b)^n is always n+1n+1, which is one more than the index nn.

  • Powers of Terms in Expansion

    In successive terms of the expansion of (a+b)n(a+b)^n, the power of 'a' decreases by 1 (from nn down to 0), while the power of 'b' increases by 1 (from 0 up to nn).

  • Sum of Indices in Each Term

    In each term of the expansion of (a+b)n(a+b)^n, the sum of the powers of 'a' and 'b' is constant and equal to the index nn.

  • Expansion of (x-y)^n

    The expansion for a difference is (xy)n=nC0xnnC1xn1y+nC2xn2y2+(1)nnCnyn(x-y)^n = {}^n\mathrm{C}_0 x^n - {}^n\mathrm{C}_1 x^{n-1}y + {}^n\mathrm{C}_2 x^{n-2}y^2 - \dots + (-1)^n {}^n\mathrm{C}_n y^n. The terms have alternating signs.

  • Expansion of (1+x)^n

    A common special case is the expansion of (1+x)n(1+x)^n, which is given by (1+x)n=nC0+nC1x+nC2x2++nCnxn(1+x)^n = {}^n\mathrm{C}_0 + {}^n\mathrm{C}_1 x + {}^n\mathrm{C}_2 x^2 + \dots + {}^n\mathrm{C}_n x^n.

  • Sum of All Binomial Coefficients

    The sum of the binomial coefficients for any power nn is 2n2^n. This is derived by setting x=1x=1 in the expansion of (1+x)n(1+x)^n, resulting in nC0+nC1+nC2++nCn=2n{}^n\mathrm{C}_0 + {}^n\mathrm{C}_1 + {}^n\mathrm{C}_2 + \dots + {}^n\mathrm{C}_n = 2^n.

  • Alternating Sum of Binomial Coefficients

    The sum of binomial coefficients with alternating signs is zero. This is shown by setting x=1x=1 in the expansion of (1x)n(1-x)^n, giving nC0nC1+nC2+(1)nnCn=0{}^n\mathrm{C}_0 - {}^n\mathrm{C}_1 + {}^n\mathrm{C}_2 - \dots + (-1)^n {}^n\mathrm{C}_n = 0.

  • Application in Numerical Evaluation

    The theorem is used to evaluate high powers of numbers by expressing the base as a sum or difference. For example, (98)5(98)^5 can be computed by expanding (1002)5(100-2)^5.

  • Application in Proving Divisibility

    Binomial expansion can be used to prove divisibility properties. For instance, expanding 6n=(1+5)n6^n = (1+5)^n helps to show that 6n5n6^n - 5n leaves a remainder of 1 when divided by 25.

  • Application in Comparing Large Numbers

    The theorem helps in comparing large numbers by expanding one of them. For example, expanding (1.01)1000000=(1+0.01)1000000(1.01)^{1000000} = (1+0.01)^{1000000} and examining the first few terms proves it is larger than 10,000.

Quick Revision Tips

  • • Review these points before exams
  • • Make flashcards for better retention
  • • Connect points to real-world examples
  • • Practice explaining each point in your own words