A pretty binomial identity (Q427171)

This paper presents five proofs of the pretty identity \[ \sum^m_{k=0} 2^{-2k} {{2k}\choose {k}} {{2m-k}\choose {m}} = \sum^m_{k=0} 2^{-2k} {{2k}\choose {k}} {{2m+1}\choose {2k}} \] coming from the evaluation at \(a=1\) of the polynomial \[ P_m(a)= 2^{-2m} \sum^m_{k=0}2^k{2m-2k \choose m-k} {m+k \choose m}(a+1)^k \] found by \textit{G. Boros} and \textit{V. H. Moll} [J. Comput. Appl. Math. 130, No. 1-2, 337--344 (2001; Zbl 1011.33005)] while studying \[ P_m(a): ={1\over\pi} 2^{m+3/2} (a+ 1)^{m+1/2} N_{0,4}(a;m) \] introduced in order to evaluate \[ N_{0,4}(a;m): =\int^\infty_0 {dx\over (x^4+2a x^2+1)^{m +1}}, \;a>-1,\;m=1,2, \dots \] which has been further explored by [\textit{G. Boros} and \textit{V. H. Moll}, Irresistible integrals. Symbolics, analysis and experiments in the evaluation of integrals. Cambridge: Cambridge University Press. (2004; Zbl 1090.11075)], [Sci., Ser. A, Math. Sci. (N.S.) 11, 1--12 (2005; Zbl 1105.33001)], by \textit{G. Boros, V. H. Moll} and \textit{S. Riley} [Sci., Ser. A, Math. Sci. (N.S.) 11, 1--12 (2005; Zbl 1105.33001)] and by \textit{T. Amdeberhan} and \textit{V. H. Moll} [Ramanujan J. 18, No. 1, 91--102 (2009; Zbl 1178.33002)]. In the \(introduction\) the authors recall the entertaining works by \textit{G. E. Andrews} [Math. Intell. 16, No. 4, 16--18 (1994; Zbl 1019.00501)] and by \textit{D. Zeilberger} [Math. Intell. 16, No. 4, 11--14, 76 (1994; Zbl 1019.00504)] with the aim to stimulate a reflection on what is admissible as a proof. The \textit{first proof} uses the WZ method introduced by \textit{H. S. Wilf} and \textit{D. Zeilberger} [Invent. Math. 103, No. 3, 575--634 (1991; Zbl 0739.05007)], developed by [\textit{M. Petkovšek, H. S. Wilf} and \textit{D. Zeilberger}, \(A=B\). With foreword by Donald E. Knuth. Wellesley, MA: A. K. Peters. (1996; Zbl 0848.05002)] and by \textit{I. Nemes, M. Petkovšek, H. S. Wilf} and \textit{D. Zeilberger} [Am. Math. Mon. 104, No. 6, 505--519 (1997; Zbl 0905.68082)] and implemented in modern symbolic languages, for instance \texttt{Maple}. The \textit{second proof} is based on producing \textit{Laurent polynomials} whose constant terms give the two sides, respectively. The \textit{third proof} is an excursion into the hypergeometric functions whose terms are evaluated through a classical formula of Gauss reported by [\textit{G. E. Andrews, R. Askey} and \textit{R. Roy}, Special functions. Encyclopedia of Mathematics and Its Applications. 71. Cambridge: Cambridge University Press. (1999; Zbl 0920.33001)]. The \textit{fourth proof} is a contour integration approach based on complex analytic techniques and on the Cauchy's residue theorem in order to establish identities involving binomial coefficients. The \(fifth\) is a combinatorial \(proof\) based on the bijection between \(X\) (the set of lattice paths in the plane that start at \((0,0)\), taking unit \(N=(0,1)\), \(S=(0,-1)\), \(E=(1,0)\) and \(W=(-1,0)\), of odd length \(2m+1\) and ending at the \(y\)-axis) and \(Y\) (a set formed by all paths on the \(x\)-axis that start and end at \(0\), take steps \(e=+1\) and \(w=-1\), and have length \(4m+2\)). The proof is partial since the authors admit to have been unable to find a combinatorial interpretation of the left hand side of the identity, \(i.e.\) of \[ \sum^m_{k=0} 2^{-2k} {{2k}\choose {k}} {{2m-k}\choose {m}} \] and they invite the reader to produce one.