In this article, we find all integers b≥2 such that the Diophantine equation Fn=(bm−1)/(b−1) has at least two nontrivial positive integer solutions (n,m), where Fn is the nth Fibonacci number.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage All Access membership.
Explore Editage All AccessPublished in last 50 years