Pular para o conteúdo

AQA A level Further Maths

A-Level · AQAFurther Maths20 notas em 12 pastas, 47 KB

20 notas de revisão de AQA A-Level Further Maths, criadas por cookie, em 12 seções que seguem os tópicos do curso.

Revision notes for AQA A-level Further Mathematics (7367): the compulsory content from proof to numerical methods, and one note each for the three optional applications, mechanics, statistics and discrete mathematics.

O que contém

A primeira anotação

Proof / Mathematical induction

A proof by induction shows that a statement holds for every positive integer nn in two linked steps. First, the statement is shown to be true for the base case, usually n=1n = 1. Second, assuming it is true for n=kn = k, it is shown to be true for n=k+1n = k + 1. Since the base case holds, the second step carries it to n=2n = 2, then n=3n = 3, and so on through every positive integer.

Both steps are needed. The inductive step on its own proves nothing, because it only links each case to the next. The base case gives the chain somewhere to start.

Proving a sum formula

Take ∑r=1nr2=n(n+1)(2n+1)6\sum_{r=1}^{n} r^2 = \frac{n(n+1)(2n+1)}{6}. At n=1n = 1 the left side is 11 and the right side is 1×2×36=1\frac{1 \times 2 \times 3}{6} = 1, so the base case holds.

For the inductive step, assume the formula holds for n=kn = k. Adding the next term (k+1)2(k+1)^2 to both sides gives

∑r=1k+1r2=k(k+1)(2k+1)6+(k+1)2=(k+1)(2k2+7k+6)6.\sum_{r=1}^{k+1} r^2 = \frac{k(k+1)(2k+1)}{6} + (k+1)^2 = \frac{(k+1)(2k^2 + 7k + 6)}{6}.

Since 2k2+7k+6=(k+2)(2k+3)2k^2 + 7k + 6 = (k+2)(2k+3), this equals (k+1)(k+2)(2k+3)6\frac{(k+1)(k+2)(2k+3)}{6}. That is the formula with nn replaced by k+1k + 1, so the step holds.

Proving divisibility

To show that 7n−17^n - 1 is divisible by 6 for every positive integer nn, the base case is 71−1=67^1 - 1 = 6, which is divisible by 6. For the step, write

7k+1−1=7(7k−1)+6.7^{k+1} - 1 = 7(7^k - 1) + 6.

The first term is a multiple of 6 by the assumption, and the second is 6 itself, so the whole expression is a multiple of 6. The method is always the same: rewrite the expression for k+1k + 1 as a multiple of the expression for kk plus a multiple of the divisor.

Proving a result about matrix powers

Let M=(1101)M = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}. The claim is that Mn=(1n01)M^n = \begin{pmatrix} 1 & n \\ 0 & 1 \end{pmatrix}. For n=1n = 1 this is MM itself. Assuming it holds for n=kn = k,

Mk+1=MkM=(1k01)(1101)=(1k+101),M^{k+1} = M^k 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},

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

Other methods

Two other methods appear beside induction. A direct proof reasons from given facts to the result. A proof by contradiction assumes the result is false and shows that leads to something impossible. A single counterexample disproves a general statement, and a proof by exhaustion checks each case in turn when there are only a few.

Some statements are easier to prove directly. For example, n2+nn^2 + n is always even because n(n+1)n(n + 1) is a product of two consecutive integers, and one of them must be even.

E mais 19: abra qualquer um deles na lista acima.

Avaliações

Ainda não há avaliações escritas. Adicione estas notas às suas e você poderá ser a primeira pessoa a deixar uma avaliação.