On a problem of Pillai with Fibonacci numbers and powers of 2
classification
🧮 math.NT
keywords
fibonaccidifferencefindhavingintegersleastnumbernumbers
read the original abstract
In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 2.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.