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
3913 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸Prove De Moivre's by induction for the positive integers
Express (X²-16)/(X-1)(X+3) in partial fractions
Particles P and Q move in a plane with constant velocities. At time t = 0 the position vectors of P and Q, relative to a fixed point O in the plane, are (16i - 12j) m and -5i + 4j) m respectively. The velocity of P is (i + 2j) m/s and the velocity of Q
You have three keys in your pocket which you extract in a random way to unlock a lock. Assume that exactly one key opens the door when you pick it out of your pocket. Find the expectation value of the number of times you need to pick out a key to unlock.