Multiple Sums of Circular Binomial Products

Author:

Chen Marta Na1ORCID,Chu Wenchang2ORCID

Affiliation:

1. School of Mathematics and Statistics, Zhoukou Normal University, Zhoukou 466001, China

2. Department of Mathematics and Physics, University of Salento, 73100 Lecce, Italy

Abstract

Five classes of multiple sums about circular products of binomial coefficients are investigated. Their generating functions are explicitly expressed as rational functions, with coefficients being Fibonacci and Lucas numbers. This is fulfilled by a novel approach called “recursive construction”, which also permits us to establish, for the circular sums, both generating functions and recurrence relations through the Lagrange expansion formula.

Publisher

MDPI AG

Reference15 articles.

1. Binomial sum relations involving Fibonacci and Lucas numbers;Adegoke;Appl. Math.,2023

2. Cubic binomial Fibonacci sums;Adegoke;Electron. J. Math.,2021

3. Benjamin, A.T., and Quinn, J.J. (2003). Proofs that Really Count: The Art of Combinatorial Proof. The Dolciani Mathematical Expositions, Mathematical Association of America.

4. Koshy, T. (2001). Fibonacci and Lucas Numbers with Applications, John Wiley & Sons.

5. A proof of the curious binomial coefficient identity which is connected with the fibonacci numbers;Mikic;Open Access J. Math. Theor. Phys.,2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3