Back to Mathematical Induction

Exercise 6

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.

Hammond, Discrete Math for Shockers, §4.3 Mathematical Induction, Exercise 6

AI Tutor

Adapted from Discrete Math for Shockers © 2021 John Hammond. Licensed under CC BY-SA 4.0. Source: Discrete Math for Shockers. Imported at revision 2538beb.