Binomial expansion and valid approximations
Introducido| English | Significado |
|---|---|
| factorial/fækˈtɔːrɪəl/ | The product of the positive integers up to a given positive integer; zero factorial is defined as one. |
| combination/ˌkɒmbɪˈneɪʃn/ | A selection of items in which their order is not significant. |
14 million tickets, November 1994
- The UK National Lottery's first draw, on 19 November 1994, asked players to choose 6 numbers from 49. The order does not matter, so the number of possible tickets is $\dbinom{49}{6} = 13\,983\,816$. One ticket had about a 1 in 14 million chance of the jackpot. Counting choices like this is the job of factorial 阶乘 and combination 组合 counts.
- $\dbinom{n}{r}$, also written ${}^nC_r$, is the number of ways to choose $r$ objects from $n$ when order does not matter.
Factorials
- $n! = n \times (n - 1) \times \dots \times 2 \times 1$, with $0! = 1$.
- $n!$ is the number of ways to arrange $n$ different objects in a row: 5 books can be arranged in $120$ ways.
Evaluate $\dfrac{8!}{6!}$.
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$8 \times 7$.
In how many ways can 6 different books be arranged on a shelf?
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$6!$.
Combinations
- $\dbinom{n}{r} = \dfrac{n!}{r!(n - r)!}$: $\dbinom{10}{3} = \dfrac{10 \times 9 \times 8}{3 \times 2 \times 1} = 120$.
- Symmetry: $\dbinom{n}{r} = \dbinom{n}{n - r}$, since choosing 3 to take is choosing 7 to leave.
Binomial expansion and valid approximations
For positive integer n, (a+b)^n is a finite binomial expansion
Compare the model with the worked case and explain one change.
A team of 4 is chosen from 9 students. How many teams are possible?
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$\binom{9}{4}$.
$\dbinom{20}{17} = \dbinom{20}{3}$.
Dificultad 1/5 · 100 monedas + un pequeño bono en el primer intento de hoy
Choosing 17 to take is choosing 3 to leave.
Worked example: a term in an expansion
Find the term in $x^3$ in the expansion of $(2 - 3x)^7$.
- Choose: the $x^3$ term uses $\dbinom{7}{3}$ — the number of ways to pick which 3 of the 7 brackets give $-3x$.
- Powers: $\dbinom{7}{3}(2)^4(-3x)^3 = 35 \times 16 \times (-27)x^3$.
- Result: $-15\,120x^3$.
Find the coefficient of $x^2$ hacia adentro $(1 + 2x)^6$.
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$\binom{6}{2} \times 4$.
Pascal's triangle
- Each entry is the sum of the two above it: $\dbinom{n}{r} + \dbinom{n}{r + 1} = \dbinom{n + 1}{r + 1}$.
- Row 5 is 1, 5, 10, 10, 5, 1 — the coefficients of $(a + b)^5$.
Combinations in probability
- The binomial distribution uses $\dbinom{n}{r}$ to count the orders: $P(X = r) = \dbinom{n}{r}p^r(1 - p)^{n - r}$.
- Exactly 2 sixes in 5 rolls: $\dbinom{5}{2}\left(\tfrac{1}{6}\right)^2\left(\tfrac{5}{6}\right)^3 = 0.161$.
A fair coin is thrown 6 times. Find the probability of exactly 3 heads, as a decimal.
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$\tfrac{20}{64}$.
Do not forget the powers of the other term. In $(2 - 3x)^7$, the $x^3$ term is not $35 \times (-27)x^3$: the four other brackets each give 2, so multiply by $2^4 = 16$ as well. Keep the minus sign inside the bracket.
$n!$ counts arrangements; $\binom{n}{r} = \tfrac{n!}{r!(n - r)!}$ counts choices where order does not matter, with $\binom{n}{r} = \binom{n}{n - r}$. In $(a + b)^n$, the term with $b^r$ is $\binom{n}{r}a^{n - r}b^r$ — include every power and sign.
In the expansion of $(1 + kx)^8$, the coefficient of $x^2$ is 252. Find the possible values of $k$, and the coefficient of $x^3$ when $k > 0$.
Working backwards from a coefficient.