On the Diophantine equations \(P_n =b^d Q_m +Q_k\) and \(Q_n =b^d P_m +P_k\) involving Pell and Pell-Lucas numbers (Q6566129)

Let \( (P_n)_{n\ge 0} \) and \( (Q_n)_{n\ge 0} \) be the sequences of Pell and Pell-Lucas numbers, respectively, defined by the linear recurrence relations: \( P_0=0 \), \( P_1=1 \), and \( P_n=2P_{n-1}+P_{n=2} \) for all \( n\ge 2 \); and \( Q_0=Q_1= 2\) and \( q_n=2Q_{n-1}+Q_{n=2} \) for all \( n\ge 2 \). In the paper under review, the authors study the Diophantine equations: \N\begin{align*}\NP_n=b^{d}Q_m+Q_k \quad \text{and} \quad Q_n=b^{d}P_m+P_k,\tag{1}\N\end{align*}\Nin nonnegative integers \( n,m,k \), and where \( d \) represents the number of digits of \( Q_k \) and \( P_k \) in base \( b \), respectively. In their main results, the authors show that for an integer \( b\ge 2 \), the Diophantine equations (1) have only finitely many integer solutions with \( n<9.3\cdot 10^{31}\log^{4} b\). Further more, they apply these results for \( b\in [2,10] \) to effectively compute the solutions.\N\NThe proofs of their results follow from a clever combination of techniques in Diophantine number theory, the usual properties of the Pell and Pell-Lucas sequence, Baker's theory for non-zero lower bounds for linear forms in logarithms of algebraic numbers, and reduction techniques involving the theory of continued fractions. All computations are done with the aid of a simple computer program in \texttt{Mathematica}.