A proof of Kummer's theorem
Bruno Gauthier
Abstract
Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The second section discusses the new proof, in the third section sketches of similar proofs for Bailey's and Dixon's theorems are given.
Create a lesson
Related papers
Optimal fractional discrete Hardy inequalities on the half-line
František Štampach, Jakub Waclawek
Capacitary-Distance Hardy Inequality
Yiqun Chen, Jie Xiao, Dachun Yang et al.
Microstructure evolution as a game
Michael Ortiz
Optimal differentiability of isotropic positive definite functions on even-dimensional spheres
Yan Ge
Bilinear Bochner--Riesz Means on the Complex Sphere
S. Bagchi, Md N. Molla, J. Singh et al.
Exact-Support Counterexamples to Euclidean-to-Spherical Transfer of Positive Definiteness in Even Dimensions
Wentao Huang, Haizhang Zhang