Summation over k to n of Harmonic Numbers over n+1-k
Jump to navigation
Jump to search
Theorem
- $\ds \sum_{k \mathop = 1}^n \dfrac {H_k} {n + 1 - k} = {H_{n + 1} }^2 - H_{n + 1}^{\paren 2}$
where:
- $H_n$ denotes the $n$th harmonic number
- $H_n^{\paren 2}$ denotes a general harmonic number.
Proof
\(\ds \sum_{k \mathop = 1}^n \dfrac {H_k} {n + 1 - k}\) | \(=\) | \(\ds \sum_{k \mathop = 1}^n \dfrac {H_{n + 1 - k} } k\) | Permutation of Indices of Summation | |||||||||||
\(\ds \) | \(=\) | \(\ds \sum_{k \mathop = 1}^n \sum_{j \mathop = 1}^k \dfrac 1 {j \paren {n + 1 - k} }\) | Definition of Harmonic Number | |||||||||||
\(\ds \) | \(=\) | \(\ds \sum_{k \mathop = 1}^n \sum_{j \mathop = k}^n \dfrac 1 {\paren {n + 1 - j} k}\) | Definition of Harmonic Number |
This theorem requires a proof. In particular: all at sea You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.7$: Harmonic Numbers: Exercise $21$