Thursday, October 4, 2018

Inductive Step For a Summation mathematical induction

I have a bit of trouble with how I should go about showing the inductive step for my induction problem. I know the general idea is to show that it can work for all numbers based on the base case but I'm still stuck on how to show it.




$\sum_{i=2}^n \frac{1}{i} \leq \frac{n}{2}$ for n $\geq$ 2



I know we have to plug in k+1 instead of n and show that it is also equal to k by using algebra. I'm just stuck on how to show it. I guess the i is the part that confusing me.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...