On a problem of Pillai with Fibonacci numbers and powers of 2

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.

11 pages

Cited by in corpus (5)

• On a problem of Pillai with $k$-generalised Fibonacci numbers and powers of $2$
• On Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci
• On the Diophantine equation $U_n-b^m=c$
• On Pillai's Problem involving Lucas sequences of the second kind
• On the problem of Pillai with Fibonacci numbers, Padovan numbers, and Tribonacci numbers and powers of $3$