How do I construct a proof by induction?

There are typically 4 steps: proving the base case, making an assumption, making the inductive step and finally concluding the proof.

The base case consists of proving that a statement is true for n = 1, the assumption to make is that the statement holds true for n = k, the trickiest part is the inductive step which is proving that the statement is true for n = k + 1 as long as it is true for n = k, and finally the simplest part is wrapping up the proof with a concise statement.

An example of a statement to prove is that n^3 + 2n is always divisible by 3 which I can go through using the whiteboard if needed.

AF
Answered by Alex F. Further Mathematics tutor

2932 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

What IS a Taylor Series?


Convert the general complex number z=x+iy to modulus-argument form.


What is the polar form of the equation: x^2+y^2 =xy+1


Find the general solution to f''(x)+ 3f'(x)+ 2f(x)=0


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