2. Prove that $n^2 > 2n$ for $n ge 2$
Added by Iker I.
Close
Step 1
To do this, we need to find two equations in which both n2 and 2n are equal. However, because n>2, only one of these equations will be true. This equation will be n2=2n, which is a contradiction. Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 78 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 by induction that 2n <= 2^n for n greater than or equal 2
Tyna S.
Prove that 9n 2 + n is even for any integer n.
Nathan S.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD
