Diophantine triples of Fibonacci numbers
Abstract
Let F_mbe the mh Fibonacci number. We prove that if F_{2n}F_k+1and F_{2n+2}F_k+1are both perfect squares, then k=2n+4for n\ge 1 or k=2n-2for n\ge 2 except when n=2 in which case we can additionally have...
Paper Details
Title
Diophantine triples of Fibonacci numbers
Published Date
Jan 1, 2016
Journal
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History