The question is how to prove this equality <munderover> &#x2211;<!-- ∑ --> <mrow class="

April Bush

April Bush

Answered question

2022-06-18

The question is how to prove this equality
n = 2 k 1 n = n = 2 ( 1 n 1 n + k 1 )

Answer & Explanation

Dustin Durham

Dustin Durham

Beginner2022-06-19Added 31 answers

Write out some terms of the righthand side:
( 1 2 1 k + 1 ) + ( 1 3 1 k + 2 ) + + ( 1 k 1 2 k 1 ) + ( 1 k + 1 1 2 k ) + ( 1 k + 2 1 2 k + 1 ) +
Notice that all of the negative terms are cancelled out by positive terms later in the series: 1 k + 1 in the first term by 1 k + 1 in the k-th term, 1 k + 2 in the second term by 1 k + 2 in the ( k + 1 )-st term, and so on. The only terms that are left uncancelled are the positive parts of the terms in the top line above:
1 2 + 1 3 + + 1 k .
This is precisely the sum on the lefthand side.
Petrovcic2x

Petrovcic2x

Beginner2022-06-20Added 11 answers

We may also try this:
n = 2 k 1 n = n = 2 ( 1 n 1 n + k 1 ) = n = 2 1 n n = 2 1 n + k 1
n = 2 1 n + k 1 = n = 2 1 n n = 2 k 1 n = n = k + 1 1 n .
Q.E.D.

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?