A generalization of a theorem of Murat Alan
Let \( \{F_n\}_{n \ge 0} \) and \( \{L_n\}_{n\ge 0} \) be the usual classical Fibonacci and Lucas sequences given by the linear recurrence relations \( F_0=0, F_1=1 \); \( L_0=2, L_1=1 \) and \( F_{n+2}=F_{n+1}+F_n \); \( L_{n+2}=L_{n+1}+L_n \) for all \( n\ge 0 \).\N\NIn the paper under review, the authors complete solve the Diophantine equations \N\[\NF_n=b^{d}L_m+L_k \quad \text{and} \quad L_n=b^{d}F_m+F_k, \tag{1}\N\]\Nin nonnegative integers \( (n,m,k) \), where \( d \) represents the number of digits of \( L_k \) and \( F_k \) in base \( b \), respectively. This paper is a generalization of the results of \textit{M. Alan} in [Bull. Iran. Math. Soc. 48, No. 5, 2725--2741 (2022; Zbl 1508.11016)].\N\NTo prove their results, the authors use a clever combination of techniques in Diophantine number theory, the usual properties of the Fibonacci and Lucas sequences, Baker's theory for nonzero lower bounds for linear forms in logarithms of algebraic numbers, and the reduction techniques involving the theory of continued fractions. The computations can be done with the aid of simple computer programs in \texttt{Sage} and \texttt{Mathematica}.
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Balancing numbers which are products of three repdigits in base b
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- Fibonacci and Lucas numbers as products of three repdigits in base g
- scientific article; zbMATH DE number 2186899 (Why is no real title available?)
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- scientific article; zbMATH DE number 1484667 (Why is no real title available?)
- Linear combinations of factorials and S-units in a binary recurrence sequence
- On concatenations of Fibonacci and Lucas numbers
- On the solutions of the Diophantine equation \(F_n \pm \frac{a (10^m - 1)}{9} = k!\)
- On the solutions of the Diophantine equation \(P_n \pm \frac{a(10^m -1)}{9}=k!\)
- Repdigits as products of two Pell or Pell-Lucas numbers
- Repdigits base \(b\) as products of two Pell numbers or Pell-Lucas numbers
- Tribonacci numbers that are concatenations of two repdigits
This page was built for publication: A generalization of a theorem of Murat Alan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021639)
