A Stirling Encounter with Harmonic Numbers (Q4670644)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2160671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Stirling Encounter with Harmonic Numbers |
scientific article; zbMATH DE number 2160671 |
Statements
22 April 2005
0 references
Stirling numbers
0 references
combinatorial proof
0 references
A Stirling Encounter with Harmonic Numbers (English)
0 references
0.8150076866149902
0 references
0.7792145609855652
0 references
The paper provides combinatorial proofs to several well-known identities involving harmonic numbers, \(H_n=\sum_{i=1}^n 1/i\). Let \({n\brack k}\) denote the unsigned Stirling number of the first kind, i.e. the number of permutations of \(n\) elements with exactly \(k\) cycles. The key observation is the identity \(n!H_n={n+1\brack 2} \) and its combinatorial proof. Similarly, the identities \[ \begin{aligned} \sum_{k=1}^{n-1}H_k&= nH_n-n,\\ \sum_{k=m}^{n-1}{k\choose m}H_k&= {n\choose m+1} \left(H_n-{1\over m+1}\right),\\ \sum_{k=m}^{n-1}{k\choose m}{1\over n-k} &= {n\choose m}(H_n-H_m) \end{aligned} \] allow combinatorial proofs through the identities \[ \begin{aligned} {n\brack 2}&=(n-1)!+\sum_{k=1}^{n-2} {(n-2)!\over k! }{k+1\brack 2},\\ {n\brack 2}&= {(n-1)!\over t}+t\sum_{k=t+1}^{n}{k-1\brack 2} {(n-1-t)!\over (k-1-t)! }\\ \text{for \(1\leq t\leq n-1\), and} {n\brack 2} &= {m\brack 2}{(n-1)!\over (m-1)!}+ \sum_{t=m}^{n-1} {t-1\choose m-1} {(m-1)!(n-m)!\over n-t}\end{aligned} \] for \(1\leq m\leq n\).
0 references