Abstract
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
Publisher
Cambridge University Press (CUP)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Discrete Mathematics and Its Applications;2010-09-14
2. Do third‐year mathematics undergraduates know what they are supposed to know?;International Journal of Mathematical Education in Science and Technology;1998-05
3. Seeing induction at work;The Mathematical Gazette;1991-12
4. Mathematical induction: A pedagogical discussion;Educational Studies in Mathematics;1984-05
5. Mathematical Induction: A Recurring Theme;The Mathematical Gazette;1982-06