Prove by induction that k = n(n + 1)/2, for all positive integers n.
Added by Natalia R.
Close
Step 1
5)=1.5. This satisfies the inequality k≥n(n+ly2) since 1.5≥1(1+0.5). Inductive step: Assume that the inequality holds for some positive integer k, i.e. k≥n(n+ly2). We want to show that it also holds for k+1, i.e. (k+1)≥(n+1)(n+1+ly2). Expanding the right-hand Show more…
Show all steps
Your feedback will help us improve your experience
Dr Harish Viswanathan and 66 other Algebra 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
Use mathematical induction to prove n^2 + n is even.
Tyna S.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Watch the video solution with this free unlock.
EMAIL
PASSWORD