Article contents
Inductio ad absurdum?
Published online by Cambridge University Press: 22 September 2016
Extract
Suppose that Pn is some proposition about the integer n, which we want to prove for all n≥n0 (usually n0 = 0 or 1). The form of inductive argument most commonly taught in schools is the following:
A. Simple induction. If Pn0 is true, and Pn ⇒ Pn+i for each n > n0, then P" is true for all n > n0
- Type
- Research Article
- Information
- Copyright
- Copyright © Mathematical Association 1975
References
- 6
- Cited by