ข้ามไปยังเนื้อหา
cookie

OCR A level Further Maths B (MEI)

A-Level · OCRFurther Maths B (MEI)21 โน้ต ใน 9 โฟลเดอร์, 58 KB

โน้ตทบทวน 21 รายการสำหรับ OCR A-Level Further Maths B (MEI) สร้างโดย cookie แบ่งเป็น 9 ส่วนตามหัวข้อของหลักสูตร

Notes for OCR A level Further Mathematics B (MEI), H645, starting with Core Pure and then each major and minor option in turn. Each option has its own folder, so delete the ones you do not take. Mechanics and statistics notes assume the A level Mathematics content.

มีอะไรอยู่ข้างใน

โน้ตรายการแรก

Core pure / Proof by induction

Induction proves a statement about every positive integer nn at once. Instead of checking infinitely many cases, you show two things. First, the statement holds for the smallest value of nn it applies to. Second, whenever it holds for some value, it also holds for the next value. Together these chain forward through every integer, the way a row of dominoes falls once the first is pushed.

The method has three parts, and a complete proof writes all of them out in order.

  1. Base case. Substitute the smallest value (usually n=1n = 1) into both sides of the statement and check they agree.
  2. Assumption. Write "assume the result is true for n=kn = k" and write the statement for n=kn = k as an equation you can use.
  3. Inductive step. Start from the statement for n=k+1n = k + 1, use the assumption to replace part of it, and show the result is the statement for n=k+1n = k + 1.

A conclusion sentence finishes the proof: the base case holds, and the step carries it from kk to k+1k + 1, so the statement holds for all positive integers.

Sums of series

The usual example is the sum of the squares of the first nn integers.

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

Base case: when 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.

Assumption: suppose ∑r=1kr2=k(k+1)(2k+1)6\sum_{r=1}^{k} r^2 = \frac{k(k+1)(2k+1)}{6}.

Inductive step: add (k+1)2(k+1)^2 to both sides.

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

Take out the common factor (k+1)(k+1).

=(k+1)(k(2k+1)6+(k+1))=(k+1)(2k2+7k+6)6= (k+1)\left(\frac{k(2k+1)}{6} + (k+1)\right) = \frac{(k+1)(2k^2 + 7k + 6)}{6}

The quadratic factorises as (k+2)(2k+3)(k+2)(2k+3), so the right side is (k+1)(k+2)(2k+3)6\frac{(k+1)(k+2)(2k+3)}{6}. That is the formula with n=k+1n = k + 1. The proof is complete.

Factorising the quadratic is where most mistakes happen, so check it by expanding. Here (k+2)(2k+3)=2k2+7k+6(k+2)(2k+3) = 2k^2 + 7k + 6, which matches.

Divisibility

Induction also proves that an expression is a multiple of a number. Take 7n−17^n - 1, which is divisible by 6 for every positive integer nn.

For the inductive step, assume 7k−1=6m7^k - 1 = 6m for some integer mm. Then write the expression for k+1k + 1 in terms of it.

7k+1−1=7(7k−1)+6=7×6m+6=6(7m+1)7^{k+1} - 1 = 7(7^k - 1) + 6 = 7 \times 6m + 6 = 6(7m + 1)

Since 7m+17m + 1 is an integer, the expression is a multiple of 6. The trick of writing 7k+1−17^{k+1} - 1 as 7(7k−1)+67(7^k - 1) + 6 is what makes the assumption usable. Look for it whenever the expression contains k+1k + 1 powers.

Matrices

Induction proves formulae for powers of a matrix. For example, if

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

then Mn=(1n01)\mathbf{M}^n = \begin{pmatrix} 1 & n \\ 0 & 1 \end{pmatrix} for every positive integer nn. The base case is n=1n = 1, where the matrix is M\mathbf{M} itself. In the inductive step, multiply Mk\mathbf{M}^k by M\mathbf{M} and check that the product has the entry k+1k + 1 in the top right corner.

What to write

A complete proof is short. It has the base case with its check, a line that states the assumption, the algebra for the step, and a sentence that concludes. Writing the conclusion is part of the proof, not decoration. A proof that stops after the algebra has not shown the statement for all nn.

และอีก 20 รายการ: เปิดรายการใดก็ได้จากรายการด้านบน

รีวิว

ยังไม่มีรีวิวที่เขียนไว้ เพิ่มโน้ตเหล่านี้ลงในของคุณ แล้วคุณจะเป็นคนแรกที่เขียนรีวิว