Tribonacci Numbers That Are Products of Two Lucas Numbers
Ama Ahenfoa Quansah
所有作者
Ama Ahenfoa Quansah
文献摘要
Let Tk be the kth Tribonacci number and Ln be the nth Lucas number defined by their respective recurrence relation Tk=Tk−1+Tk−2+Tk−3 and Ln=Ln−1+Ln−2. In this study, we solve the Diophantine equation Tk=LmLn for positive integer unknowns m, n, and k and prove our results.