In an induction proof for ∑nk=11k2≤2−1n (for n≥1), I was required to prove the inequality 1(n+1)2+1n+1<1n.
This is my attempt:
1(n+1)2+1n+1=1+(n+1)(n+1)2=n+2(n+1)2=n+2n2+2n+1<n+2n2+2n(since n≥1)=n+2n(n+2)=1n
I am just wondering if there is a simpler way of doing this.
Answer
Instead of comparing 1(n+1)2+1n+1 and 1n, we can compare 1(n+1)2 and 1n−1n+1. Then, what we have is
1(n+1)2=1(n+1)(n+1)<1n(n+1)=1n−1n+1⟹1(n+1)2<1n−1n+1
⟹1(n+1)2+1n+1<1n
Alternatively, by using the same way, we could try to prove
1n−1(n+1)2−1(n+1)>0
For this one, we have
1n−1(n+1)2−1(n+1)=(n+1)2−n−n(n+1)n(n+1)2=1n(n+1)2>0
since n≥1. Therefore, the result follows.
No comments:
Post a Comment