MathClario
โ† Back to High school
High school๐ŸŽฒProbabilityโ—โ—โ—‹โ—‹โ—‹ยท 4 min
๐Ÿงฎ

Binomial coefficient C(n,k) = n! / (k!(nโˆ’k)!)

Number of ways to choose k out of n. Pascal's triangle computes it without factorials.

The formula

(nk)=n!k!(nโˆ’k)!\binom{n}{k} = \dfrac{n!}{k! (n - k)!}

Read as โ€nn choose kkโ€. The number of combinations of kk items chosen from nn (no order, no repetition).

Special cases

  • (n0)=1\binom{n}{0} = 1 (one way to choose nothing)
  • (nn)=1\binom{n}{n} = 1 (one way to choose everything)
  • (n1)=n\binom{n}{1} = n
  • (n2)=n(nโˆ’1)2\binom{n}{2} = \dfrac{n(n-1)}{2}

Symmetry

(nk)=(nnโˆ’k)\binom{n}{k} = \binom{n}{n - k}

Ex: (103)=(107)\binom{10}{3} = \binom{10}{7}. Choosing 3 is the same as leaving out 7.

Pascalโ€™s triangle

Each number is the sum of the two above:

(n+1k+1)=(nk)+(nk+1)\binom{n+1}{k+1} = \binom{n}{k} + \binom{n}{k+1}

n=0:              1
n=1:            1   1
n=2:          1   2   1
n=3:        1   3   3   1
n=4:      1   4   6   4   1
n=5:    1   5  10  10   5   1

Application: binomial theorem

(a+b)n=โˆ‘k=0n(nk)anโˆ’kbk(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k

For n=2n = 2: (a+b)2=a2+2ab+b2(a+b)^2 = a^2 + 2ab + b^2 (coefficients 1, 2, 1).

For n=3n = 3: (a+b)3=a3+3a2b+3ab2+b3(a+b)^3 = a^3 + 3a^2 b + 3ab^2 + b^3 (coefficients 1, 3, 3, 1).

Application: combinations in probability

Number of 5-card hands from 52:

(525)=52!5!โ€‰47!=2,598,960\binom{52}{5} = \dfrac{52!}{5! \, 47!} = 2{,}598{,}960

Common mistakes

  1. Confusing combination and arrangement (arrangement = with order).
  2. Forgetting the (nโˆ’k)!(n - k)! in the denominator.
  3. Computing huge factorials instead of simplifying (e.g., 10!/8!=10ร—910!/8! = 10 \times 9).
?ร€ toi de jouer

C(6, 2) = ?

Mini-quiz

Question 1 / 3

C(5, 2) = ?

#combination#binomial coefficient#Pascal#grade 12

You might also like