2000 character limit reached
Fibonacci or Lucas numbers that are products of two Lucas numbers or two Fibonacci numbers
Published 5 Dec 2023 in math.NT | (2312.02577v1)
Abstract: This contribution presents all possible solutions to the Diophantine equations $F_k=L_mL_n$ and $L_k=F_mF_n$. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two arbitrary Fibonacci numbers are determined herein. The results under consideration are proven by using Dujella-Peth\"o lemma in coordination with Matveev's theorem. All common terms of the Fibonacci and Lucas numbers are determined. Further, the Lucas-square Fibonacci and Fibonacci-square Lucas numbers are given.
- D. Marques, On generalized Cullen and Woodall numbers that are also Fibonacci numbers. Journal of Integer Sequences 17(9) (2014): Article 14.9.4.
- Y. Qu and J. Zeng, Lucas numbers which are concatenations of two repdigits. Mathematics 8(8) (2020): 1360.
- S.E. Rihane and A. Togbé, k𝑘kitalic_k-Fibonacci numbers which are Padovan or Perrin numbers. Indian Journal of Pure and Applied Mathematics 54(2) (2023): 568-582.
- H. Bensella and D. Behloul, Common terms of Leonardo and Jacobsthal numbers. Rendiconti del Circolo Matematico di Palermo Series 2 (2023): 1-7.
- L. Carlitz, A note on Fibonacci numbers. Fibonacci Quarterly 2(1) (1964): 15–28.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.