卢卡斯数列
数学
丢番图方程
组合数学
卢卡斯数
序列(生物学)
域代数上的
纯数学
斐波纳契数
正交多项式
遗传学
斐波那契多项式
差分多项式
生物
作者
Jhon J. Bravo,Pranabesh Das,Sergio Guzmán,Shanta Laishram
标识
DOI:10.1142/s1793042115500682
摘要
In this paper, we consider the usual Pell and Pell–Lucas sequences. The Pell sequence [Formula: see text] is given by the recurrence un= 2un-1+ un-2with initial condition u0= 0, u1= 1 and its associated Pell–Lucas sequence [Formula: see text] is given by the recurrence vn= 2vn-1+ vn-2with initial condition v0= 2, v1= 2. Let n, d, k, y, m be positive integers with m ≥ 2, y ≥ 2 and gcd (n, d) = 1. We prove that the only solutions of the Diophantine equation unun+d⋯un+(k-1)d= ymare given by u7= 132and u1u7= 132and the equation vnvn+d⋯vn+(k-1)d= ymhas no solution. In fact, we prove a more general result.
科研通智能强力驱动
Strongly Powered by AbleSci AI