On the problem of Pillai with Fibonacci numbers, Padovan numbers, and Tribonacci numbers and powers of 3
Abstract
Consider the sequences: \Fn\n≥ 0 of Fibonacci numbers defined by F0=0 , F1 =1 and Fn+2=Fn+1+ Fn for all n≥ 0 ; \Pn\n≥ 0 of Padovan numbers defined by P0=0 , P1 =1 = P2 and Pn+3=Pn+1+ Pn for all n≥ 0 ; and \Tn\n≥ 0 of Tribonacci numbers defined by T0=0 , T1 =1= T2 and Tn+3=Tn2+Tn+1+ Tn for all n≥ 0 . In this paper, we find all integers c having at least two representations as a difference between: a Fibonacci number and a power of 3 ; a Padovan number and a power of 3; and a Tribonacci number and a power of 3.
0