Computer proofs of a new family of harmonic number identities. (Q1415382): Difference between revisions

For \(n\geq1\), the \(n^{th}\) harmonic number \(1+\frac{1}{2}+ \frac {1}{3}+\cdots+\frac{1}{n}\) is denoted by \(H_n\) (\(H_0\) is conventionally considered to be \(0\)). Five identities involving \(H_n\) are considered, of the form \(R_n^{(\alpha)}+ S_n^{(\alpha)}=a_\alpha\), with \(a_1=1, a_2=0, a_3=(-1)^n, a_4=(-1)^n{{2n}\choose{n}}, a_5=(-1)^n \sum_{j=0}^n{{n} \choose{j}}^2{{n+j}\choose{j}}\), for \(R_n^{(\alpha)}=\sum_{j=0}^n {{n}\choose{j}}^\alpha S_n^{(\alpha)}=\alpha \sum_{j=0}^n(n-2j) H_j{{n} \choose{j}}^\alpha\) with \(\alpha=1,\dots,5\). Identities 1 through 5 are proved using the Newton-Andrews-Zeilberger algorithm or a new algorithm which fits the requirements better. The same identities are proved with algorithms derived from those of Karr and Gosper and using the Sigma package, which proves its utility especially for large values of \(\alpha\).