组合恒等式证明的几种方法
Several Methods for Proving Combinatorial Identities
DOI: 10.12677/PM.2021.116128, PDF,    国家自然科学基金支持
作者: 郑欢欢, 靳海涛：天津职业技术师范大学理学院，天津
关键词: 二项式系数；组合恒等式；生成函数；机器证明；Binomial Coefficients； Combinatorial Identities； Generating Functions； Mechanical Proving
摘要: 通过含有二项式系数的一些恒等式，介绍了组合证明法、积分法、差分法、生成函数法和机器证明法五种常用的恒等式的证明方法。
Abstract: By proving some identities involving binomial coefficients, this paper introduces five well-known methods for proving combinatorial identities, including the methods of combination, integration, finite difference, generating functions and mechanical proving.
文章引用：郑欢欢, 靳海涛. 组合恒等式证明的几种方法[J]. 理论数学, 2021, 11(6): 1137-1145. https://doi.org/10.12677/PM.2021.116128

参考文献

[1] Spivey, M.Z. (2019) The Art of Proving Binomial Identities. CRC Press, Boca Raton. [Google Scholar] [CrossRef] 
[2] 许胤龙, 孙淑玲. 组合数学引论[M]. 合肥: 中国科学技术大学出版社, 2010.
[3] Riordan, J. (1968) Combinatorial Identities. John Wiley, New York.
[4] 吴琼扬. 浅谈微积分方法在组合恒等式证明中的应用[J]. 新课程(教育学术), 2011(4): 49-50.
[5] Wilf, H.S. (2006) Generating Functionology. A.K. Peters, Ltd., Natick. [Google Scholar] [CrossRef] 
[6] Petkovsěk, M., Wilf, H.S. and Zeilberger, D. (1996) A = B. A.K. Peters, Wellesley. [Google Scholar] [CrossRef] 
[7] Azarian, M.K. (2012) Fibonacci Identities as Binomial Sums. Mathematical Sciences, 7, 1871-1876.
[8] Azarian, M.K. (2012) Fibonacci Identities as Binomial Sums II. Mathe-matical Sciences, 7, 2053-2059.
[9] Azarian, M.K. (2012) Identities Involving Lucas or Fibonacci and Lucas Numbers as Binomial Sums. Mathematical Sciences, 7, 2221-2227.
[10] Lu, D.W., Song, L.X. and Ma, C.X. (2015) Some New Asymptotic Approximations of the Gamma Function Based on Nemes’ Formula, Ramanujan’s Formula and Burnside’s Formula. Applied Mathematics and Computation, 253, 1-7. [Google Scholar] [CrossRef] 
[11] Paule, P. and Schneider, C. (2003) Computer Proofs of a New Family of Harmonic Number Identities. Advances in Applied Mathematics, 31, 359-378. [Google Scholar] [CrossRef] 
[12] 杨存典, 李超, 刘端森. 广义高阶Fibonacci数和Lucas数的计算公式[J]. 纺织高校基础科学学报, 2007(1): 100-102.
[13] Fürst, C. (2011) Combinatorial Sums: Egorychev’s Method of Coefficients and Riordan Arrays. Master Thesis, Research Institute for Symbolic Computation, Johannes Kepler University, Linz.
[14] 侯庆虎. 组合数学中的代数方法[D]: [博士学位论文]. 天津: 南开大学, 2001.
[15] 孙慧. 特殊函数恒等式[D]: [博士学位论文]. 天津: 南开大学, 2009.

为你推荐