Difference between revisions of "Proof by induction"
From BRGS Wiki
| Line 1: | Line 1: | ||
| − | |||
| − | |||
A much loved [[Further Maths]] topic, taught by [[Mr Reeves]], this is a form of mathematical proof, whereby a statement is proved true for all natural values of n. | A much loved [[Further Maths]] topic, taught by [[Mr Reeves]], this is a form of mathematical proof, whereby a statement is proved true for all natural values of n. | ||
Revision as of 19:25, 20 October 2006
A much loved Further Maths topic, taught by Mr Reeves, this is a form of mathematical proof, whereby a statement is proved true for all natural values of n.
It is decribed with an analogy of a ladder: If a ladder continues to infinity, can you say that you can climb to the top? If you can get on the first rung of the ladder, and then prove that you can move from one rung to the next at a general point on the ladder, then you can prove that you can climb it to the top.
An Example
Error creating thumbnail: Unable to save thumbnail to destination
