1 of 12

AS-Level Further Maths

Revision Session 1

  • Roots of Polynomials

Revision Session 2

  • Proof by induction

Revision Session 3

  • Momentum and Impulse

Revision Session 4

  • Review and Hooke’s Law

​

2 of 12

From the specification and teaching guidance

Proof By Induction

- Divisibility

​

- Sums of Series

- Proof by induction of the binomial theorem

​

- Powers of matrices (covered in 2023, ‘Matrices and Sums of Series’)

​

3 of 12

Divisibility Questions

Solution

1. Basis step: When n = 1, 91 – 1 = 8 which is divisible by 8, therefore true for n = 1

2. Assumption step: Assume true for n = k: 9k – 1 is divisible by 8

3. Induction step: When n = k + 1:

4. Conclusion step: Hence true for n = k => true for k+1 and since true for n = 1, the result is proved by induction.

4 of 12

Divisibility Questions

5 of 12

From the specification and teaching guidance

Proof By Induction

- Divisibility

​

- Sums of Series

- Proof by induction of the binomial theorem

​

- Powers of matrices (covered in 2023, ‘Matrices and Sums of Series’)

​

6 of 12

Sums of series questions

 

2. Assumption step: Assume true for n = k:

3. Induction step: When n = k + 1:

4. Conclusion step: Hence true for n = k => true for k+1 and since true for n = 1, the result is proved by induction.

LHS = RHS therefore true for n = 1.

7 of 12

Sequence question

Solution

1. Basis step: When n = 1, x1 = 21 + 1 = 3 which is correct so true for n = 1

2. Assumption step: Assume true for n = k: xk = 2k + k

3. Induction step: When n = k + 1:

4. Conclusion step: Hence true for n = k => true for k+1 and since true for n = 1, the result is proved by induction.

8 of 12

Proving the binomial theorem using proof by induction

Formulae Booklet

9 of 12

Proving the binomial theorem using proof by induction

Pascals Identity

Other things to remember:

​

 

10 of 12

Proving the binomial theorem using proof by induction

Solution

  1. Basis step: When n = 1, (a + b)1 = a1 + b1 = a + b

so true for n = 1

 

3. Induction step: When n = k + 1:

4. Conclusion step: Hence true for n = k => true for k+1 and since true for n = 1, the result is proved by induction.

11 of 12

From the specification and teaching guidance

Proof By Induction

- Divisibility

​

- Sums of Series

- Proof by induction of the binomial theorem

​

- Powers of matrices (covered in 2023, ‘Matrices and Sums of Series’)

​

12 of 12

AS-Level Further Maths

Revision Session 1

  • Roots of Polynomials

Revision Session 2

  • Proof by induction

Revision Session 3

  • Momentum and Impulse

Revision Session 4

  • Review and Hooke’s Law

​