On k-Fibonacci and k-Lucas numbers written as a product of two Pell numbers
\noindent Let \( k\ge 2 \) be an integer and \( (U_n^{(k)})_{n\ge -(k-2)} \) be a linear recurrence sequence of order \( k \) given by \begin{align*} U_{-(n-2)}^{(k)}=\cdots = U^{(k)}_{-1}=0, \quad U_0^{(k)}=a, \quad U_1^{(k)}=b, \quad \text{and} \quad U_n^{(k)}=U_{n-1}^{(k)}+\cdots+U_{n-k}^{(k)}\quad \text{for} \quad n\ge 2. \end{align*} If \( (a,b):=(0,1) \), then \( U_n^{(k)}=F_n^{(k)} \)--the k--generalized Fibonacci sequence and if \( (a,b):=(2,1) \), then \( U_n^{(k)}=L_n^{(k)} \)--the k--generalized Lucas sequence. Also, let \( (P_m)_{m\ge 0} \) be the usual Pell sequence defined by the binary recurrence relation: \( P_0=1 \), \( P_1=1 \), and \( P_{m+2}=2P_{m+1}+P_m \) for all \( m\ge 0 \). In the paper under review, the author proves the following theorems, which are the main results in the paper. Theorem 1. All solutions of the Diophantine equation \begin{align*} F_n^{(k)}=P_{\ell}P_m, \end{align*} in positive integers \( (n,m,\ell, k) \) with \( k\ge 3 \) and \( 2\le \ell\le m \) are: \begin{align*} F_4^{(k)}=P_2^2, \quad F_7^{(3)}=P_2P_4, \quad F_{13}^{(8)}=P_4P_7, \quad \text{and}\quad F_{13}^{(9)}=P_3P_8. \end{align*} Theorem 2. All solutions of the Diophantine equation \begin{align*} L_n^{(k)}=P_{\ell}P_m, \end{align*} in positive integers \( (n,m,\ell, k) \) with \( k\ge 2 \) and \( 2\le \ell\le m \) are: \begin{align*} L_4^{(k)}=P_2P_4, \quad k\ge 5, \quad L_3^{(2)}=P_2^2, \quad \text{and}\quad F_{5}^{(3)}=P_2P_3. \end{align*} The proofs of Theorem 1 and Theorem 2 follow from a clever combination of techniques in Diophantine number theory, the usual properties of the Pell, \( k \)-generalized Fibonacci and Lucas 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 fractions. All computations are done with the aid of a simple computer program in \texttt{Mathematica}.
- \(k\)-Fibonacci and \(k\)-Lucas numbers as product of two repdigits
- k-Pell numbers as product of two repdigits
- On the products of \(k\)-Fibonacci numbers and \(k\)-Lucas numbers
- On Fermat and Mersenne numbers expressible as product of two k-Fibonacci numbers
- On the sum of powers of two k-Fibonacci numbers which belongs to the sequence of k-Lucas numbers
- A Diophantine equation in \(k\)-Fibonacci numbers and repdigits
- A simplified Binet formula for k-generalized Fibonacci numbers
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Fibonacci numbers which are products of three Pell numbers and Pell numbers which are products of three Fibonacci numbers
- Fibonacci Numbers which are Products of two Pell Numbers
- Generalized Fibonacci Numbers and Associated Matrices
- scientific article; zbMATH DE number 44151 (Why is no real title available?)
- scientific article; zbMATH DE number 1175369 (Why is no real title available?)
- On Generalized Fibonacci Numbers
- On the intersection of k-Fibonacci and Pell numbers
- On the intersection of \(k\)-Lucas sequences and some binary sequences
- On the intersections of Fibonacci, Pell, and Lucas numbers
- Perfect Pell Powers
- Powers in products of terms of Pell's and Pell–Lucas Sequences
- Powers of two as sums of two k-Fibonacci numbers
- Powers of two in generalized Fibonacci sequences
- Repdigits in \(k\)-Lucas sequences
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
This page was built for publication: On \(k\)-Fibonacci and \(k\)-Lucas numbers written as a product of two Pell numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151701)
