On Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci

DOI10.26637/MJM1003/003MaRDI QIDQ6405793zbMATH OpenFDO

Authors Pagdame Tiebekabe, Serge Adonsou

Publication date 22 July 2022

Full work available at URL https://doi.org/10.26637/MJM1003/003

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Abstract: In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses lower bounds for linear forms in logarithms, properties of continued fractions, and a version of the Baker-Davenport reduction method in Diophantine approximation.

This page was built for publication: On Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405793)