On a variant of Pillai's problem

Abstract

In this paper, we find all integers $c$ having at least two representations as a difference between a Fibonacci number and a Tribonacci number.

Cited by in corpus (4)

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