How do I do a proof by induction?

For this explanation we will use the following example from a 2013 exam paper:

   If u1= 2 and un+1=(5un-3)/(3un-1), then prove that un=(3n+1)/(3n-1) for all n>=1

The first step of any proof by induction is to make the assumption that what we want to prove is true for a particular value n = k:

  Assume there exists k such that uk=(3k+1)/(3k-1)

We must then prove that it is also true for n = (k+1), we start by finding uk+1 using the original formula:

  uk+1 = (5uk-3)/(3uk-1) = (5*(3k+1)/(3k-1) - 3)/(3*(3k+1)/(3k-1) - 1) = ... = (3k+4)/(3k+2)

We now want to write this in terms of k+1, in this case it is fairly straightforward but other times it may be harder to see:

  uk+1 = (3k+4)/(3k+2) = (3(k+1) - 3 + 4)/(3(k+1) - 3 +2) = (3(k+1)+1)/(3(k+1)-1)

When written in terms of k+1, uk+1 should now be in the form that we want to prove for unor a form that can be rearranged into that one. There is still one step left however which is CRUCIAL for this to be a proper proof by induction. We have to prove this is true for a certain value of n, in this case n = 1:

   u= 2 = (31+1)/(31-1) therefore the assumption is true for n = 1. It is therefore true for n = 1, 2, 3, ...

This last step is usually very simple but can often be overlooked so make sure to include it!

SC
Answered by Samuel C. Further Mathematics tutor

3852 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Expand (1+x)^3. Express (1+i)^3 in the form a+bi. Hence, or otherwise, verify that x = 1+i satisfies the equation: x^3+2*x-4i = 0.


How do I sketch the locus of |z - 5-3i | = 3 on an Argand Diagram?


Solve the equation 3sinh(2x) = 13 - 3e^(2x), answering in the form 0.5ln(k). where k is an integer


How do you prove the formula for the sum of n terms of an arithmetic progression?


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences