Prove that $2^n > n^2 + n + 1$ for every integer $n \ge 5$.
Added by Joshua S.
Close
Step 1
When n = 2, we have 2^2 > 2^2 + 2 + 1, which simplifies to 4 > 7. Since this is not true, the base case is not satisfied. Show more…
Show all steps
Your feedback will help us improve your experience
Supreeta N and 71 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Prove the following by induction: (n+1)! > 2 ^ (n+3) for all n ≥ 5.
Adi S.
Proof by mathematical induction. Let n be a positive integer. Prove that 1 + 3 + 5 + ... + (2n - 1) = n^2.
Gregory H.
Use mathematical induction to prove each statement. Assume that $n$ is a positive integer. $$1+3+5+\cdots+(2 n-1)=n^{2}$$
Further Topics in Algebra
Mathematical Induction
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Watch the video solution with this free unlock.
EMAIL
PASSWORD