Abstract

Let (𝑃𝑛)𝑛≥0 and (𝑄𝑛)𝑛≥0 be the Pell and Pell–Lucas sequences. Let 𝑏 be a positive integer such that 𝑏 ≥ 2. In this paper, we prove that the following two Diophantine equations 𝑃𝑛 = 𝑏𝑑𝑃𝑚 + 𝑄𝑘 and 𝑃𝑛 = 𝑏𝑑𝑄𝑚 + 𝑃𝑘 with 𝑑, the number of digits of 𝑃𝑘 or 𝑄𝑘 in base 𝑏, have only finitely many solutions in nonnegative integers (𝑚, 𝑛, 𝑘, 𝑏, 𝑑). Also, we explicitly determine these solutions in cases 2 ≤ 𝑏 ≤ 10.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call