コンテンツへ移動

WJEC A level Further Maths

A-Level · WJECFurther Maths6個のフォルダーに20件のノート、62 KB

WJEC A-Level Further Mathsの試験勉強用ノート20件。cookieが作成。コースのトピックに沿った6個のセクションに分かれています。

Notes for WJEC GCE AS and A level Further Mathematics (Wales), in folders for the six units in the specification's order, with one note for each topic or pair of topics. Units 5 and 6 are options, so delete the folder for the one you do not take.

内容

最初のノート

Further pure mathematics A / Proof by induction and sums of series

The method of induction

A statement P(n)P(n) about positive integers is proved by induction in two steps. The base case shows that P(1)P(1), or the first value in the range, is true. The inductive step assumes P(k)P(k) is true for some integer kk and then shows that P(k+1)P(k+1) follows from it. Together these two steps show the statement holds for every value from the base case upwards: P(1)P(1) is true, so P(2)P(2) is true, so P(3)P(3) is true, and so on.

The inductive step is where most of the work sits. The assumption P(k)P(k) is used to rewrite the expression for k+1k+1 in a form that can be simplified to the required result.

Divisibility

To show that 4n−14^n - 1 is divisible by 3 for every positive integer nn, check the base case first. When n=1n = 1, 4−1=34 - 1 = 3, which is divisible by 3.

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). \begin{aligned} 4^{k+1} - 1 &= 4(4^k - 1) + 3 \\ &= 4 \times 3m + 3 \\ &= 3(4m + 1). \end{aligned} Since 4m+14m + 1 is an integer, 4k+1−14^{k+1} - 1 is divisible by 3, which completes the induction.

Most divisibility questions follow this pattern. The trick is to split the expression for k+1k+1 into a multiple of the expression for kk plus a term that is obviously divisible.

Matrix powers

Induction gives a formula for powers of a matrix. Take M=(1101)\mathbf{M} = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}. The base case M1=(1101)\mathbf{M}^1 = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} is true. If 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}, so Mn=(1n01)\mathbf{M}^n = \begin{pmatrix} 1 & n \\ 0 & 1 \end{pmatrix} for every positive integer nn.

The binomial theorem

For a positive integer nn, (a+b)n=∑r=0n(nr)an−rbr,(nr)=n!r! (n−r)!. (a+b)^n = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^r, \qquad \binom{n}{r} = \frac{n!}{r!\,(n-r)!}. The induction step relies on Pascal's identity (nr)+(nr+1)=(n+1r+1). \binom{n}{r} + \binom{n}{r+1} = \binom{n+1}{r+1}. Multiplying the expansion for n=kn = k by (a+b)(a+b) and collecting the coefficient of ak+1−rbra^{k+1-r}b^r gives exactly this identity, so the expansion holds for n=k+1n = k+1.

Standard sums

The sums of the first nn integers, squares and cubes are ∑r=1nr=n(n+1)2,∑r=1nr2=n(n+1)(2n+1)6,∑r=1nr3=(n(n+1)2)2. \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 = \left(\frac{n(n+1)}{2}\right)^2. These can be combined. For example, ∑r=110(r2+2r)=∑r=110r2+2∑r=110r=385+2×55=495. \sum_{r=1}^{10} (r^2 + 2r) = \sum_{r=1}^{10} r^2 + 2\sum_{r=1}^{10} r = 385 + 2 \times 55 = 495.

The method of differences

When each term can be written as f(r)−f(r+1)f(r) - f(r+1), the sum telescopes, because most terms cancel. Partial fractions usually provide the split. Since 1r(r+1)=1r−1r+1, \frac{1}{r(r+1)} = \frac{1}{r} - \frac{1}{r+1}, the sum is ∑r=1n1r(r+1)=(1−12)+(12−13)+⋯+(1n−1n+1)=1−1n+1=nn+1. \sum_{r=1}^{n} \frac{1}{r(r+1)} = \left(1 - \frac{1}{2}\right) + \left(\frac{1}{2} - \frac{1}{3}\right) + \cdots + \left(\frac{1}{n} - \frac{1}{n+1}\right) = 1 - \frac{1}{n+1} = \frac{n}{n+1}. Check with n=3n = 3: 12+16+112=34\frac{1}{2} + \frac{1}{6} + \frac{1}{12} = \frac{3}{4}, which matches 33+1\frac{3}{3+1}.

For 1r(r+2)\frac{1}{r(r+2)}, the partial fractions are 12(1r−1r+2)\frac{1}{2}\left(\frac{1}{r} - \frac{1}{r+2}\right). Summing gives ∑r=1n1r(r+2)=34−2n+32(n+1)(n+2). \sum_{r=1}^{n} \frac{1}{r(r+2)} = \frac{3}{4} - \frac{2n+3}{2(n+1)(n+2)}. Check with n=1n = 1: the left side is 13\frac{1}{3}, and the right side is 34−512=13\frac{3}{4} - \frac{5}{12} = \frac{1}{3}.

さらに19件あります。上のリストから開けます。

レビュー

文章でのレビューはまだありません。このノートを自分のノートに追加して、最初のレビューを投稿できます。