Category Archives: Counting Techniques

March 5, 2025 · 2:00 am

Binomial Expansion Theorem

My Year 11 Mathematics Methods students are working on the Binomial Expansion Theorem.

But before we get onto that, remember Pascal’s triangle

Now we can use combinations to find the numbers in each row. For example, $1 4 6 4 1$ is $\begin{pmatrix}4\\0\end{pmatrix}=1, \begin{pmatrix}4\\1\end{pmatrix}=4, \begin{pmatrix}4\\2\end{pmatrix}=6, \begin{pmatrix}4\\3\end{pmatrix}=4, \begin{pmatrix}4\\4\end{pmatrix}=1$

As you can see, the coefficients are the row of pascal’s triangle corresponding to the power. So $(x+y)^6$ would have co-efficients from the sixth row of the table $1, 6, 15, 20, 15, 6, 1$ .

To generalise

$(x+y)^n=\begin{pmatrix}n\\0\end{pmatrix}x^ny^0+\begin{pmatrix}n\\1\end{pmatrix}x^{n-1}y^1+\begin{pmatrix}n\\2\end{pmatrix}x^{n-2}y^2+ ...+\begin{pmatrix}n\\n-1\end{pmatrix}x^1{y^{n-1}+\begin{pmatrix}n\\n\end{pmatrix}x^0y^n$

Which we can condense to

$(x+y)^n=\Sigma_{i=0}^n \begin{pmatrix}n\\i\end{pmatrix}x^{n-i}y^i$

Worked Examples

$(1)$ Expand $(2x-3)^4$

$(2x-3)^4=\begin{pmatrix}4\\0\end{pmatrix}(2x)^4(-3)^0+\begin{pmatrix}4\\1\end{pmatrix}(2x)^3(-3)^1+\begin{pmatrix}4\\2\end{pmatrix}(2x)^2(-3)^2+\begin{pmatrix}4\\3\end{pmatrix}(2x)^1(-3)^3+\begin{pmatrix}4\\4\end{pmatrix}(2x)^0(-3)^4$
$(2x-3)^4=16x^4-96x^3+216x^2-216x+81$

$(2)$ Find the co-efficient of the $x^3$ term in the expansion of $(2-5x)^5$ .

Remember $(x+y)^n=\Sigma_{i=0}^n \begin{pmatrix}n\\i\end{pmatrix}x^{n-i}y^i$ , the $x^3$ is when $i=3$
$\begin{pmatrix}5\\3\end{pmatrix}(2)^2(-5)^3=10\times 2\times -125=-5000$

$(3)$ Find the constant term in the expansion of $(x^2+\frac{3}{x^4})^6$

We need to find the term where the $x$ ‘s cancel out. Each term is $\begin{pmatrix}6\\i\end{pmatrix}(x^2)^{6-i}(\frac{3}{x^4})^i$ .
$\begin{pmatrix}6\\i\end{pmatrix}(x^{12-2i})(3^ix^{-4i})$ .
We need $12-2i-4i=0$ , hence $i=2$
Therefore, the co-efficient is $\begin{pmatrix}6\\2\end{pmatrix}\times3^2=135$

Derangements

From Wikipedia

In combinatorial mathematics, a derangement is a permutation of the elements of a set in which no element appears in its original position.

For example, if we have the set ${A, B, C}$ , there are $6$ permutations

$ABC, ACB, BAC, BCA, CAB, CBA$

But only $2$ of them are derangements – $BCA$ and $CAB$

I did a practical question on this here. In that question I used a tree diagram, but there must be a way to determine the number of derangements given $n$ elements.

We know $3$ elements has $2$ derangements, what about $4$ elements? We know there are $4!=24$ permutations

ABCD	BACD	CABD	DABC
ACBD	BADC	CADB	DACB
ACDB	BCAD	CBAD	DBAC
ABDC	BCDA	CBDA	DBCA
ADBC	BDAC	CDAB	DCAB
ADCB	BDCA	CDBA	DCBA

I have highlighted the derangements. when $n=4$ there are $9$ derangements.

Let’s try to generalise.

In how many ways can one element be in its original position?
$\begin{pmatrix}4\\1\end{pmatrix} \times 3!=24$
Choose one element from the 4 to be in its original position, and then arrange the remaining three elements.

So far, we have $D_3=4!-\begin{pmatrix}4\\1\end{pmatrix} \times 3!=0$

Clearly we are counting some arrangements multiple times, for example ABDC has A and B in the correct position, so we need to add all of the arrangements with $2$ elements in their original position.
In how many ways can two elements be in their original position?
$\begin{pmatrix}4\\2\end{pmatrix} \times 2!=12$

So now we have, $D_3=4!-\begin{pmatrix}4\\1\end{pmatrix} \times 3!+\begin{pmatrix}4\\2\end{pmatrix} \times 2!=12$

But once again we have counted some arrangements multiple times, so we need to subtract all of the arrangements with $3$ elements in their original position.
In how many ways can three elements be in their original position?
$\begin{pmatrix}4\\3\end{pmatrix} \times 1!=4$

So now we have, $D_3=4!-\begin{pmatrix}4\\1\end{pmatrix} \times 3!+\begin{pmatrix}4\\2\end{pmatrix} \times 2!-\begin{pmatrix}4\\3\end{pmatrix} \times 1!=8$

We now need to add all of the arrangements with $4$ elements in their original position.
In how many ways can four elements be in their original position?
$\begin{pmatrix}4\\4\end{pmatrix} \times 0!=1$

So now we have, $D_3=4!-\begin{pmatrix}4\\1\end{pmatrix} \times 3!+\begin{pmatrix}4\\2\end{pmatrix} \times 2!-\begin{pmatrix}4\\3\end{pmatrix} \times 1!+\begin{pmatrix}4\\4\end{pmatrix} \times 0!=9$

Hence,

$D_n=\begin{pmatrix}n\\0\end{pmatrix}\times n!-\begin{pmatrix}n\\1\end{pmatrix}\times (n-1)!+\begin{pmatrix}n\\2\end{pmatrix}\times (n-2)!-... \mp \begin{pmatrix}n\\n\end{pmatrix}\times 0!$

Which we can simplify to

$D_n=\Sigma_{i=0}^{n}(-1)^n\begin{pmatrix}n\\i\end{pmatrix}\times(n-i)!$

Counting Techniques

Four teachers decide to swap desks at work. How many ways can this be done if no teacher sits at their previous desk?
Mathematics Specialist Units 1&2 Cambridge

I like this question as it seems easy until you start thinking about it. I think the best approach is a tree diagram.

If we think of the four teachers as A, B, C and D. Then A can no longer sit in A, so the options are B, C and D for the first desk.

For the second desk, If B is in the first desk, then A, C or D could be in the second. If C is in the first desk, then A or D could be in the second (B can’t be in the same desk). If D is in the first desk, then A or C can be in the second desk.

Expression	Expansion	Co-efficients
$(x+y)^2$	$x^2+2xy+y^2$	$1, 2, 1$
$(x+y)^3$	$x^3+3x^2y+3xy^2+y^3$	$1, 3, 3, 1$
$(x+y)^4$	$x^4+4x^3y+6x^2y^2+4xy^3+y^4$	$1, 4, 6, 4, 1$

Category Archives: Counting Techniques

Binomial Expansion Theorem

Worked Examples

Derangements

Counting Techniques

Recent Posts

Categories

Archives