Passer au contenu

OCR A level Further Maths A

A-Level · OCRFurther Maths A20 notes dans 5 dossiers, 69 KB

20 notes de révisions pour OCR A-Level Further Maths A, créée par cookie, répartie en 5 sections qui suivent les thèmes du cours.

Notes for OCR A Level Further Mathematics A (H245), in folders for the Pure Core (papers Y540 and Y541) and each optional paper: Statistics (Y542), Mechanics (Y543), Discrete Mathematics (Y544) and Additional Pure Mathematics (Y545). Each note covers one area of content with worked examples. Delete the folders for optional papers your course leaves out.

Contenu

La première note

Pure core (Y540 and Y541) / Proof by induction

The principle

A statement about every positive integer nn can be proved in two stages. First the statement is shown to hold for the first value of nn, usually n=1n = 1. This is the base case. Then it is shown that whenever the statement holds for n=kn = k, it also holds for n=k+1n = k + 1. This is the inductive step, and the assumption that the statement holds for n=kn = k is the inductive hypothesis.

The two stages work together. The base case starts a chain, and the inductive step passes the result from each value to the next, so it reaches every positive integer. Checking several values by hand does not do this, because it never shows that the statement holds for all nn.

Proving a formula for a sum

Take the formula ∑r=1nr2=n(n+1)(2n+1)6\sum_{r=1}^{n} r^2 = \frac{n(n+1)(2n+1)}{6}.

For the base case, when n=1n = 1 the left side is 12=11^2 = 1, and the right side is 1×2×36=1\frac{1 \times 2 \times 3}{6} = 1.

For the inductive step, assume the formula holds for n=kn = k. Then the sum to k+1k + 1 is the sum to kk plus one more term:

∑r=1k+1r2=∑r=1kr2+(k+1)2 \sum_{r=1}^{k+1} r^2 = \sum_{r=1}^{k} r^2 + (k+1)^2

Substituting the inductive hypothesis gives

∑r=1k+1r2=k(k+1)(2k+1)6+(k+1)2=(k+1)(2k2+7k+6)6=(k+1)(k+2)(2k+3)6 \begin{aligned} \sum_{r=1}^{k+1} r^2 &= \frac{k(k+1)(2k+1)}{6} + (k+1)^2 \\ &= \frac{(k+1)\left(2k^2 + 7k + 6\right)}{6} \\ &= \frac{(k+1)(k+2)(2k+3)}{6} \end{aligned}

The last line is the formula with n=k+1n = k + 1, because 2k2+7k+6=(k+2)(2k+3)2k^2 + 7k + 6 = (k+2)(2k+3). So the statement holds for k+1k + 1, and the proof is complete.

Divisibility

To prove that n3+2nn^3 + 2n is divisible by 3 for every positive integer nn, the base case is 13+2×1=31^3 + 2 \times 1 = 3, which is divisible by 3.

For the inductive step, write the expression at k+1k + 1 in terms of the expression at kk:

(k+1)3+2(k+1)=(k3+2k)+(3k2+3k+3) (k+1)^3 + 2(k+1) = (k^3 + 2k) + (3k^2 + 3k + 3)

The first bracket is divisible by 3 by the inductive hypothesis. The second is 3(k2+k+1)3(k^2 + k + 1), which is also divisible by 3. A sum of two multiples of 3 is a multiple of 3, so the result holds for k+1k + 1.

The step is to rewrite the expression at k+1k + 1 so that the expression at kk appears inside it, with whatever is left over shown to be a multiple of the divisor. Divisibility by dd means that the number equals dqdq for some integer qq.

Matrix powers

Let M=(1101)\mathbf{M} = \begin{pmatrix}1 & 1 \\ 0 & 1\end{pmatrix}. The claim is Mn=(1n01)\mathbf{M}^n = \begin{pmatrix}1 & n \\ 0 & 1\end{pmatrix}.

The base case is M1=M\mathbf{M}^1 = \mathbf{M}, which is true. For the inductive step, Mk+1=MkM\mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M}, so

(1k01)(1101)=(1k+101) \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}

which is the claimed form with n=k+1n = k + 1.

Common errors

A proof that only checks the base case proves nothing about the other values. A proof that assumes the statement for n=k+1n = k + 1 is circular. The inductive hypothesis is used on the expression at kk, and the conclusion must be stated for k+1k + 1.

The inductive step must also be written so that the reader can see where the hypothesis is used. Simply stating that the result "follows" is not enough. Each line should either be an identity or follow from the line before it.

Which statements need induction

Induction suits results that are built up one term at a time: sums of series, powers of a matrix, divisibility of an expression by a fixed number, and inequalities that depend on nn. It does not suit every result. A statement about a single value of nn is proved directly, and a statement that fails for even one value is shown to be false with a counterexample.

Et 19 autres : ouvre-les depuis la liste ci-dessus.

Avis

Aucun avis écrit pour le moment. Ajoute ces notes aux tiennes et tu pourras être le premier à en laisser un.