- #1
e(ho0n3
- 1,357
- 0
What do you call this type of induction (if it even exists):
Let P(x) be some statement concerning the integer x. If
- P(m) is true, and
- P(k) is true implies P(k + 1) is true, where m ≤ k < n,
then P(x) is true for all integers x = m, ..., n.
Let P(x) be some statement concerning the integer x. If
- P(m) is true, and
- P(k) is true implies P(k + 1) is true, where m ≤ k < n,
then P(x) is true for all integers x = m, ..., n.