Saltar al contenido

Edexcel A level Further Maths

A-Level · EdexcelFurther Maths17 notas en 9 carpetas, 63 KB

17 apuntes de estudio para Edexcel A-Level Further Maths, creados por cookie, en 9 secciones que siguen los temas del curso.

Notes for Pearson Edexcel A level Further Mathematics (9FM0), in folders for Core Pure Mathematics and then one folder for each optional paper from 3A to 4D, in the specification's order. Each option has its own folder, so delete any you do not take. Follows the 9FM0 specification, Issue 4.

Qué contiene

La primera nota

Core pure mathematics / Proof by induction

The two steps

A statement P(n)P(n) depends on a whole number nn. Induction proves it for every nn from a starting value onwards in two steps.

  1. Show that P(n)P(n) is true for the first value of nn, usually n=1n = 1. This is the base case.
  2. For the induction step, assume P(k)P(k) is true for some value kk, and use that assumption to show P(k+1)P(k + 1) is true.

The base case starts the chain and the step carries it from each value to the next. Both parts are needed. The step on its own proves nothing, because it never shows that the chain starts.

The assumption in the step is only an assumption. It is never used to conclude that P(k)P(k) holds for every kk. What the step proves is that if P(k)P(k) holds then P(k+1)P(k + 1) holds, and that implication is what is shown.

Worked example: a sum

Prove that ∑r=1n(2r−1)=n2\sum_{r=1}^{n} (2r - 1) = n^2 for all integers n≥1n \ge 1.

For the base case, when n=1n = 1 the left side is 11 and the right side is 12=11^2 = 1, so the statement holds.

In the induction step, assume ∑r=1k(2r−1)=k2\sum_{r=1}^{k} (2r - 1) = k^2. Then

∑r=1k+1(2r−1)=∑r=1k(2r−1)+(2(k+1)−1)=k2+(2k+1)=(k+1)2 \begin{aligned} \sum_{r=1}^{k+1} (2r - 1) &= \sum_{r=1}^{k} (2r - 1) + \bigl(2(k+1) - 1\bigr) \\ &= k^2 + (2k + 1) \\ &= (k + 1)^2 \end{aligned}

The statement holds for k+1k + 1 whenever it holds for kk, so it holds for all n≥1n \ge 1.

Divisibility

To prove that an expression is divisible by a number mm by induction, write the expression at n=k+1n = k + 1 as a multiple of the expression at n=kn = k plus a term that is itself a multiple of mm.

Prove that 4n−14^n - 1 is divisible by 33 for all n≥1n \ge 1.

For the base case, 41−1=34^1 - 1 = 3, which is divisible by 33.

For the induction step, assume 4k−1=3m4^k - 1 = 3m for some integer mm. Then

4k+1−1=4(4k−1)+3=4(3m)+3=3(4m+1), 4^{k+1} - 1 = 4(4^k - 1) + 3 = 4(3m) + 3 = 3(4m + 1),

which is divisible by 33. The induction step is complete.

Matrix powers

The same method proves formulae for powers of a matrix. Take

M=(1101). \mathbf{M} = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}.

To prove that Mn=(1n01)\mathbf{M}^n = \begin{pmatrix} 1 & n \\ 0 & 1 \end{pmatrix} for n≥1n \ge 1, the base case is M1=M\mathbf{M}^1 = \mathbf{M}, which is true. In the step, assume Mk=(1k01)\mathbf{M}^k = \begin{pmatrix} 1 & k \\ 0 & 1 \end{pmatrix}. Then

Mk+1=MkM=(1k01)(1101)=(1k+101). \mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M} = \begin{pmatrix} 1 & k \\ 0 & 1 \end{pmatrix}\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} = \begin{pmatrix} 1 & k + 1 \\ 0 & 1 \end{pmatrix}.

Standard sums

Induction is the usual way to prove the standard sums for the first nn integers, squares and cubes:

∑r=1nr=n(n+1)2,∑r=1nr2=n(n+1)(2n+1)6,∑r=1nr3=n2(n+1)24. \sum_{r=1}^{n} r = \frac{n(n+1)}{2}, \qquad \sum_{r=1}^{n} r^2 = \frac{n(n+1)(2n+1)}{6}, \qquad \sum_{r=1}^{n} r^3 = \frac{n^2(n+1)^2}{4}.

These results are used throughout the course to sum series. For example, the sum of the first nn terms of r(r+1)r(r+1) is found by writing r(r+1)r(r+1) in terms of r2r^2 and rr and using the first two results:

∑r=1nr(r+1)=n(n+1)(2n+1)6+n(n+1)2=n(n+1)(n+2)3. \sum_{r=1}^{n} r(r+1) = \frac{n(n+1)(2n+1)}{6} + \frac{n(n+1)}{2} = \frac{n(n+1)(n+2)}{3}.

Check with n=2n = 2: the terms are 22 and 66, a total of 88, and 2×3×43=8\frac{2 \times 3 \times 4}{3} = 8.

Common mistakes

A proof that begins by assuming the result for n=k+1n = k + 1 is not a proof of the step. The assumption must be made for kk, and the conclusion drawn for k+1k + 1.

A base case checked for n=1n = 1 does not prove the result for n=2n = 2. The induction step is what carries the result forward.

Y 16 más: abre cualquiera desde la lista de arriba.

Reseñas

Todavía no hay reseñas escritas. Añade estas notas a las tuyas y podrás ser la primera persona en dejar una.