Specialization Math Example 1

Follow the full solution, then compare it with the other examples linked below.

Example 1

easy
The Binomial Theorem states (a+b)n=โˆ‘k=0n(nk)anโˆ’kbk(a+b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k. Specialise to a=1,b=1a=1, b=1 and a=1,b=โˆ’1a=1, b=-1 to obtain two identities.

Solution

  1. 1
    The Binomial Theorem gives (a+b)n=โˆ‘k=0n(nk)anโˆ’kbk(a+b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k. Specialization means substituting specific values for the parameters to obtain concrete identities.
  2. 2
    Substitute a=1,b=1a=1, b=1: (1+1)n=โˆ‘k=0n(nk)1nโˆ’kโ‹…1k=โˆ‘k=0n(nk)(1+1)^n = \sum_{k=0}^{n}\binom{n}{k}1^{n-k}\cdot 1^k = \sum_{k=0}^{n}\binom{n}{k}. Since the left side equals 2n2^n, we get the identity โˆ‘k=0n(nk)=2n\sum_{k=0}^{n}\binom{n}{k} = 2^n.
  3. 3
    Substitute a=1,b=โˆ’1a=1, b=-1: (1โˆ’1)n=โˆ‘k=0n(nk)(โˆ’1)k(1-1)^n = \sum_{k=0}^{n}\binom{n}{k}(-1)^k. For nโ‰ฅ1n \ge 1 the left side is 0n=00^n = 0, giving the alternating-sum identity โˆ‘k=0n(nk)(โˆ’1)k=0\sum_{k=0}^{n}\binom{n}{k}(-1)^k = 0.

Answer

โˆ‘k=0n(nk)=2n,โˆ‘k=0n(nk)(โˆ’1)k=0\sum_{k=0}^{n}\binom{n}{k}=2^n,\quad \sum_{k=0}^{n}\binom{n}{k}(-1)^k=0
Specialisation plugs specific values into a general formula to obtain particular results. The Binomial Theorem is a powerful source of combinatorial identities via specialisation.

About Specialization

Applying a general theorem or formula to a specific case by substituting particular values for the variables or parameters.

Learn more about Specialization โ†’

More Specialization Examples