Back to Induction

Exercise 14

Avg difficulty 2.5

Find the flaw in the following “proof” of the “fact” that n<100n \lt 100 for every n∈Nn \in \N.

Let P(n)P(n) be the statement n<100n \lt 100. We will prove P(n)P(n) is true for all n∈Nn \in \N. First we establish the base case: when n=0n = 0, P(n)P(n) is true, because 0<1000 \lt 100. Now for the inductive step, assume P(k)P(k) is true. That is, k<100k \lt 100. Now if k<100k \lt 100, then kk is some number, like 80. Of course 80+1=8180+1 = 81 which is still less than 100. So k+1<100k +1 \lt 100 as well. But this is what P(k+1)P(k+1) claims, so we have shown that P(k)→P(k+1)P(k) \imp P(k+1). Thus by the principle of mathematical induction, P(n)P(n) is true for all n∈Nn \in \N.

Levin, Discrete Mathematics: An Open Introduction (3rd ed.), §3.5 Induction, Exercise 14

AI Tutor

Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.