In the above diagram is the centre of the larger circle. and are points on the circumference of the larger circle. and are points on the circumference of the smaller circle. Show that . and are straight lines.
(radii of the larger circle)
At a line from to (it is also a radius of the larger circle)
My Year 11 Mathematics Methods students are working on the Binomial Expansion Theorem.
But before we get onto that, remember Pascal’s triangle
First 8 rows of Pascal’s triangle
Now we can use combinations to find the numbers in each row. For example, is
Expression
Expansion
Co-efficients
As you can see, the coefficients are the row of pascal’s triangle corresponding to the power. So would have co-efficients from the sixth row of the table .
To generalise
Which we can condense to
Worked Examples
Expand
Find the co-efficient of the term in the expansion of .
Remember , the is when
Find the constant term in the expansion of
We need to find the term where the ‘s cancel out. Each term is . . We need , hence Therefore, the co-efficient is
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 , there are permutations
But only of them are derangements – and
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 elements.
We know elements has derangements, what about elements? We know there are 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 there are derangements.
Let’s try to generalise.
In how many ways can one element be in its original position? Choose one element from the 4 to be in its original position, and then arrange the remaining three elements.
So far, we have
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 elements in their original position.
In how many ways can two elements be in their original position?
So now we have,
But once again we have counted some arrangements multiple times, so we need to subtract all of the arrangements with elements in their original position.
In how many ways can three elements be in their original position?
So now we have,
We now need to add all of the arrangements with elements in their original position.
In how many ways can four elements be in their original position?
How do we go about finding the rule for a first order linear recurrence relation?
Something like
There isn’t a common difference (arithmetic sequence) or a common ratio (geometric sequence). Sometimes you can just see the rule, but an algorithm will be handy.
Let’s say our relationship is
(1)
Referring back to our sequence , we know
(2)
and
(3)
We can solve equation and simultaneously
equation equation
Hence
Substitute into equation
Hence
Let’s try to generalise
If , then
(4)
and
(5)
Equation equation
Hence,
Once you know , substitute into either equation to find .
Example
Find the recursive rule for the following
Hence and
It is also possible to find the rule using a Classpad (if it’s in the calculator section} by using an e-activity.
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.