斐波纳契数
数学
丢番图方程
一般化
组合数学
卢卡斯数
斐波那契多项式
卢卡斯数列
皮萨诺时期
算术
序列(生物学)
离散数学
数学分析
正交多项式
生物
遗传学
差分多项式
作者
Jhon J. Bravo,Jose L. Herrera,Florian Luca
标识
DOI:10.1016/j.jnt.2021.03.001
摘要
Abstract A generalization of the well–known Fibonacci sequence is the l-Fibonacci sequence ( F m ( l ) ) m whose first l terms are 0 , … , 0 , 1 and each term afterwards is the sum of the preceding l terms. The k-Pell sequence ( P n ( k ) ) n , which is a generalization of the classical Pell sequence, can be defined similarly. In this paper, we find all coincidences between these two families of sequences. That is, we find all the solutions of the Diophantine equation P n ( k ) = F m ( l ) in positive integers n , k , m , l with k , l ≥ 2 . This paper continues and extends prior results which dealt with the above problem for some particular cases of k and l. In particular, it extends the previous work [2] that found all Fibonacci numbers in the Pell sequence.
科研通智能强力驱动
Strongly Powered by AbleSci AI