Common values of Padovan and Perrin sequences

From MaRDI portal
Publication:6095342





Let \((P_n)_{n\in \mathbb{Z}}\) be the sequence of \textit{Padovan numbers} given by the ternary linear recurrence \(P_0=P_1=P_2=1\) and \(P_{n+3}=P_{n+1}+P_n\) for all \(n\in \mathbb{Z}\). Also, let \((R_m)_{m\in \mathbb{Z}}\) be a sequence of \textit{Perrin numbers} given by the ternary linear recurrence relation \((R_0, R_1,R_2)=(3,0,2)\) and \(R_{m+3}=R_{m+1}+R_m\) for all \(m\in \mathbb{Z}\). In the paper under review, the author studies the Diophantine equation \[ P_n=\pm R_m, \quad \text{for } (n,m)\in \mathbb{Z}^2. \] In other words, the author finds all common values in Padovan and Perrin sequences. As the main result, the author shows that the only common values of Padovan and Perrin sequences are \(0, \pm 1, \pm 2, \pm 3, 4,5,\pm 7, 10, 12, 25, 86\). To prove the main result, the author uses a clever combination of techniques in Diophantine number theory, the usual properties of the Padovan and Pell sequences, Baker's theory for non-zero lower bounds for linear forms in logarithms of algebraic numbers, and reduction techniques involving the theory of continued frastions and well as the LLL algorithm. All computations can be done with the aid of simple computer programs in \texttt{Mathematica}, \texttt{SageMath}, or \texttt{Maple}.











This page was built for publication: Common values of Padovan and Perrin sequences

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