• edited by
10,103 views
48 48 votes

Let $H_1, H_2, H_3,$ ... be harmonic numbers. Then, for $n \in Z^+$,  $\sum_{j=1}^{n} H_j$ can be expressed as

  1. $nH_{n+1} - (n + 1)$
  2. $(n + 1)H_n - n$
  3. $nH_n - n$
  4. $(n + 1) H_{n+1} - (n + 1)$

1 Answer

Best answer
130 130 votes

The $n^{th}$ Harmonic Number  is defined as the summation of the reciprocals of all numbers from $1$ to $n$.

$$H_n = \sum_{i = 1}^n \frac1 i = \frac1 1 + \frac1 2 + \frac1 3 + \frac1 4 + \dots + \frac1 n$$

Lets call the value of $\sum_{j = 1}^n H_j$ as $S_n$

Then,

$\begin{align}
S_n &= H_1 + H_2 + H_3 + \dots + H_n\\[1em]
&= \small \overbrace{\left ( \color{red}{\frac1 1} \right )}^{H_1}
 + \underbrace{\left (\color{red}{\frac1 1} + \color{blue}{\frac1 2} \right )}_{H_2}
 + \overbrace{\left (\color{red}{\frac1 1} + \color{blue}{\frac1 2} + \color{green}{\frac1 3} \right )}^{H_3}
 + \dots
 + \underbrace{\left (\color{red}{\frac1 1} + \color{blue}{\frac1 2} + \color{green}{\frac1 3} + \dots + \frac1 n \right )}_{H_n}\\[1em]
&=\small  \color{red}{n \times\frac1 1}+ \color{blue}{ (n-1) \times\frac1 2} + \color{green}{(n-2) \times \frac1 3} + \dots + 1 \times \frac1 n\\[1em]
&= \sum_{i = 1}^n \left (n - i + 1 \right ) \times \frac1 i\\[1em]
&= \sum_{i = 1}^n \left ( \frac{n + 1}{i} - 1 \right )\\[1em]
&= \left ( \sum_{i = 1}^n \frac{\color{red}{n+1}}{i}\right ) - \color{blue}{\left ( \sum_{i = 1}^n 1\right )}\\[1em]
&= \left (\color{red}{(n+1)} \times \underbrace{\sum_{i = 1}^n \frac1 i}_{=H_n}\;\right ) - \color{blue}{n}\\[3em]
\hline
\large S_n &= \large (n+1)\cdot H_n - n
\end{align}$

Hence, the answer is option (B).

• edited by
Answer:
Position:
Show:

Related questions

53 53 votes
14 answers 14 answers
20.8k
20.8k views
Ishrat Jahan asked Nov 2, 2014
20,799 views
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $...
33 33 votes
5 answers 5 answers
9.5k
9.5k views
Ishrat Jahan asked Nov 2, 2014
9,483 views
Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to de...
51 51 votes
6 answers 6 answers
13.7k
13.7k views
Misbah Ghaya asked Nov 29, 2016
13,696 views
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
43 43 votes
6 answers 6 answers
17.2k
17.2k views
Kathleen asked Sep 23, 2014
17,188 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above