Back to Induction

Exercise 13

Avg difficulty 2.5

The proof in the previous problem does not work. But if we modify the “fact,” we can get a working proof. Prove that n+3<n+7n + 3 \lt n + 7 for all values of n∈Nn \in \N. You can do this proof with algebra (without induction), but the goal of this exercise is to write out a valid induction proof.

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

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.