On Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci
Number Theory
2022-07-28 v2
Abstract
In this paper, we find all integers 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.
Cite
@article{arxiv.2207.11331,
title = {On Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci},
author = {Pagdame Tiebekabe and Serge Adonsou},
journal= {arXiv preprint arXiv:2207.11331},
year = {2022}
}
Comments
arXiv admin note: text overlap with arXiv:1902.03491 by other authors