Three forms of mathematical induction: Difference between revisions

Revision as of 23:08, 6 March 2006

Revision as of 23:09, 6 March 2006

Line 26:

* The ''first'' case is [[vacuous truth|vacuously true]];

* the step that goes from the ''n''th case to the (''n'' + 1)th case is trivial if ''n'' ≥ 2 and impossible if ''n'' = 1;

* the substantial part of the proof is the ''second case'', and the second case;

* the second case is relied on in the trivial induction step.