On repdigits which are sums or differences of two k-Pell numbers
Let \( k\ge 2 \) be an integer. The \( k \)-generalized Pell sequence \( \{P_n^{(k)}\}_{n\ge -(k-2)} \) is given by the \( k \)-term linear recurrence relation \begin{align*} P_{n}^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)}, \quad \text{for all} \quad n\ge 2, \end{align*} with the initial conditions \( P_{-(n-2)}^{(k)}=P_{-(n-3)}^{(k)} =\cdots=P_{0}^{(k)}=0\) and \( P_{1}^{(k)}=1 \). When \( k=2 \), this sequence coincides with the classical Pell sequence \( \{P_n\}_{n\ge 0} \). In the paper under review, the authors find all repdigits which are sums or differences of two \(k\)-generalized Pell numbers. In other words, they study the Diophantine equation \begin{align*} P_n^{(k)}\pm P_m^{(k)} = a\left(\dfrac{10^{\ell}-1}{9}\right), \tag{1} \end{align*} in positive integers \( (n,m,\ell,k,a) \) with \( k\ge 2 \), \( 1\le m\le n \), \( \ell \ge 2 \), and \( 1\le a\le 9 \). Their main result is the following. Theorem 1. The repdigits expressible as sums or differences of two \(k\)--generalized Pell numbers are \(11, 33, 55, 88,\) and \(99\). Namely, \begin{align*} 11&=P_4-P_1=P_4^{(k)}-P_2^{(k)} \quad \text{for all} \quad k\ge 3,\\ 33&=P_5^{(k)}-P_1^{(k)} \qquad\qquad\qquad \text{for all} \quad k\ge 4,\\ 55&=P_6^{(k)}-P_5^{(k)} \qquad\qquad\qquad \text{for all} \quad k\ge 5,\\ 88&=P_6^{(k)}-P_1^{(k)} \qquad\qquad\qquad \text{for all} \quad k\ge 5,\\ 99&=P_6+P_5=P_7-P_6. \end{align*} To prove Theorem 1 the authors use a clever combination of techniques in Diophantine number theory, the usual properties of the \( k \)-generalized Pell sequence, Baker's theory of non-zero lower bounds for linear forms in logarithms of algebraic numbers, and reduction techniques involving the theory of continued fractions. All numerical computations are done with the aid of simple computer programs in \texttt{Mathematica} and \texttt{Maple}.
- k-Pell numbers as product of two repdigits
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Common values of generalized Fibonacci and Pell sequences
- Generalization of a theorem of Adegbindin, Luca and Togbé
- Generalized Pell numbers and some relations with Fibonacci numbers
- scientific article; zbMATH DE number 44151 (Why is no real title available?)
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- Linear combinations of factorials and S-units in a binary recurrence sequence
- On a generalization of the Pell sequence.
- Pell and Pell-Lucas numbers as sums of two repdigits
- Pell and Pell-Lucas numbers with only one distinct digit
- Problems in Algebraic Number Theory
- Repdigits as difference of two Fibonacci or Lucas numbers
- Repdigits as sums of four Pell numbers
- Repdigits as sums of three Pell numbers
- Repdigits as sums of two \(k\)-Fibonacci numbers
- Repdigits in generalized Pell sequences
- The generalized Binet formula, representation and sums of the generalized order-\(k\) Pell numbers
- Repdigits in generalized Pell sequences
- Repdigits as difference of two Pell or Pell-Lucas numbers
- Repdigits as sums of three Half-companion Pell numbers
- An exponential Diophantine equation with generalized Pell numbers
- On k-generalized Padovan numbers which are repdigits in base
- On k-Pell numbers which are sum of two Narayana's cows numbers.
This page was built for publication: On repdigits which are sums or differences of two \(k\)-Pell numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180426)
