prove that log(n+1) to the base n > log(n+2) to the base (n+1)
Answers
Answered by
0
Answer:
Just simply look at the function f(t)=t−log(t). You can show that this function is always increasing and that f(n)≥f(1)=1 for every n.
Answered by
4
Without loss of inequality, n > 1
We know,
Taking log to the base n on both sides, we get
Now,
Let assume that
For equality to be maintained,
As,
We know that,
So, using this we get
We know,
So, using this, we get
Hence, Proved
Additional Information :-
Similar questions