首页> 外文OA文献 >Algebraic properties of generalized Fibonacci Sequence via matrix Methods
【2h】

Algebraic properties of generalized Fibonacci Sequence via matrix Methods

机译:矩阵方法的广义斐波那契数列的代数性质

摘要

Over the past centuries, the fascination over the Fibonacci sequences and their generalizations has been shown by mathematicians and the wider scientific community. While most of the known algebraic properties of these sequences were found based on the well-known Binet formula, new discoveries seemed to have been dwarfed by the nature of the complexity of its methodology. Recently, matrix method has become a popular tool among many researchers working on Fibonacci related sequences. In this study, we investigate the generalized Fibonacci sequence by employing two different matrix methods, namely, the method of diagonalization and the method of matrix collation, making use of several generating matrices. We obtained some new algebraic properties and the sum of the generalized fibonacci sequence with different indices
机译:在过去的几个世纪中,数学家和更广泛的科学界已经表现出对斐波那契数列的迷恋及其概括。虽然这些序列的大多数已知代数性质都是基于众所周知的Binet公式发现的,但新发现似乎因其方法论的复杂性而相形见d。最近,矩阵方法已成为许多研究斐波那契相关序列的研究人员的流行工具。在这项研究中,我们使用两种不同的矩阵方法,即对角化方法和矩阵归类方法,利用几种生成矩阵来研究广义斐波那契数列。我们获得了一些新的代数性质,以及具有不同指数的广义斐波那契数列之和

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号