Back to Induction

Exercise 16

Avg difficulty 2.5

What is wrong with the following “proof” of the “fact” that for all n∈Nn \in \N, the number n2+nn^2 + n is odd?

Let P(n)P(n) be the statement “n2+nn^2 + n is odd.” We will prove that P(n)P(n) is true for all n∈Nn \in \N. Suppose for induction that P(k)P(k) is true, that is, that k2+kk^2 + k is odd. Now consider the statement P(k+1)P(k+1). Now (k+1)2+(k+1)=k2+2k+1+k+1=k2+k+2k+2(k+1)^2 + (k+1) = k^2 + 2k + 1 + k + 1 = k^2 + k + 2k + 2. By the inductive hypothesis, k2+kk^2 + k is odd, and of course 2k+22k + 2 is even. An odd plus an even is always odd, so therefore (k+1)2+(k+1)(k+1)^2 + (k+1) is odd. Therefore 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 16

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.