How prove this H <mrow class="MJX-TeXAtom-ORD"> 2 n </mrow> </m

madridomot

madridomot

Answered question

2022-05-18

How prove this H 2 n H n + 1 4 n > ln 2
Show that, for every positive integer n,
1 n + 1 + 1 n + 2 + + 1 2 n + 1 4 n > ln 2
I know this
lim n 1 n + 1 + 1 n + 2 + + 1 2 n = ln 2
and use this
ln ( 1 + 1 n ) < 1 n
is not useful
But for this inequality I can't. Thank you

Answer & Explanation

floygdarvn

floygdarvn

Beginner2022-05-19Added 12 answers

A not at all tedious computation shows that the expression - which I rearrange a tiny bit -
1 2 n + 1 n + 1 + + 1 2 n 1 + 1 4 n = k = 0 n 1 1 2 ( 1 n + k + 1 n + k + 1 ) = 1 n k = 0 n 1 1 2 ( 1 1 + k n + 1 1 + k + 1 n )
is a trapezium sum for the integral
0 1 d t 1 + t = log 2 ,
and since 1 1 + t is convex, the trapeziums have greater area than the corresponding part of the integral.
skottyrottenmf

skottyrottenmf

Beginner2022-05-20Added 2 answers

Let A n = H 2 n H n + 1 4 n , then a tedious but easy computation shows that
A n + 1 A n = 1 4 n ( n + 1 ) ( 2 n + 1 ) < 0 ,
hence ( A n ) is decreasing, in particular, A n > A where A = lim n A n . Since H n = log n + γ + o ( 1 ) when n , A = log 2. QED.
Remark: The funny thing here (and the subject of the next questions of the exercise as it is usually asked) is that the same technique applies to the sequence B n = H 2 n H n , showing that ( B n ) is increasing, hence B n < B where B = lim n B n . Since B = log 2 as well, this yields some approximations of log 2, namely the fact that, for every n 1,
H 2 n H n < log 2 < H 2 n H n + 1 4 n .
Likewise, for every n 1,
H 2 n H n + 1 4 n + 2 < log 2 < H 2 n H n + 1 4 n ,
thus, the correction 1 4 n is asymptotically of the right order.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?