k-Fibonacci powers as sums of powers of some fixed primes
For a fixed integer \( k\ge 2 \), the sequence of \textit{\( k \)-generalized Fibonacci numbers}, \( \{F_n^{(k)}\}_{n\ge -(2-k)} \), is defined by the linear recurrence: \begin{align*} F_{n}^{(k)}=F_{n-1}^{(k)}+ \cdots+ F_{n-k}^{(k)} \quad \text{for all} \quad n\ge2, \end{align*} with the initial conditions: \( F_{i}^{(k)}=0 \), for \( i=2-k, \ldots, 0 \), and \( F_{1}^{(k)}=1 \). When \( k=2 \), this sequence coincides with the classical \textit{Fibonacci sequence}. When \( k=3 \), it coincides with the \textit{Tribonacci sequence}, and so on. Let \( S=\{p_1, \ldots, p_t\} \) be a fixed set of primes arranged in increasing order. In the paper under review, the authors study the integer solutions \( (k,n,s,a_1, \ldots, a_t )\) of the exponential Diophantine equation: \begin{align*} \left(F_{n}^{(k)}\right)^{s}=p_1^{a_1}+ \cdots+ p_t^{a_t}, \end{align*} where \( a_i \) are nonnegative integers such that \( \max\{a_i: 1\le i\le t\}=a_t \). The main result of the authors in this paper is the following. Theorem 1. Let \( p_t\ge 3 \). If \( (k,n,s,a_1, \ldots, a_t) \) is a positive integer solution of the equation (1) with \( n\ge k+2 \) and \( n> C_1(p_t) \), then \begin{align*} \max\{n,s,a_t\}< \dfrac{2\cdot 10^{80}\log^{17}pt}{\log^{5}\delta}, \end{align*} where \( \delta = p_t/p_{t-1} \), with \( p_0=1 \) in the case \( t=1 \). Furthermore, for \( k\ge 2, ~n\ge 3 \), and \( s\ge 1 \), as an application of Theorem 1, the authors find all solutions of the exponential Diophantine equation \begin{align*} \left(F_{n}^{(k)}\right)^{s}=2^{a}+3^{b}+5^{c}, \quad \text{where} \quad 0\le \max\{a,b\} \le c. \end{align*} To prove their results, the authors use a clever combination of techniques in number theory, the usual properties of the \( k \)-generalized Fibonacci sequence, the theory of nonzero linear forms in logarithms of algebraic numbers, as well as reduction techniques involving the theory of continued fractions. All computations are done with the aid of a computer program in \texttt{Mathematica}.
- On prime factors of the sum of two k-Fibonacci numbers
- Terms of generalized Fibonacci sequences that are powers of their orders
- \(k\)-generalized Fibonacci numbers of the form \(1+2^{n_1}+4^{n_2}+\cdots +(2^{k})^{n_k}\)
- An equation related to k-generalized Fibonacci numbers
- A Diophantine equation related to the sum of powers of two consecutive generalized Fibonacci numbers
- 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
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Fibonacci and Lucas numbers of the form \(2^a+3^b+5^c\)
- Fibonacci numbers at most one away from a perfect power
- Fibonacci numbers of the form p^a p^b+1
- Fibonacci numbers of the form p^a p^b
- Generalized Fibonacci numbers of the form \(2^a + 3^b + 5^c\)
- scientific article; zbMATH DE number 4202359 (Why is no real title available?)
- scientific article; zbMATH DE number 4055706 (Why is no real title available?)
- scientific article; zbMATH DE number 3775618 (Why is no real title available?)
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- scientific article; zbMATH DE number 508846 (Why is no real title available?)
- scientific article; zbMATH DE number 1175369 (Why is no real title available?)
- scientific article; zbMATH DE number 6985849 (Why is no real title available?)
- scientific article; zbMATH DE number 1408152 (Why is no real title available?)
- Linear combinations of factorials and S-units in a binary recurrence sequence
- Linear combinations of prime powers in binary recurrence sequences
- Linear forms in two logarithms and interpolation determinants
- Multiplicative dependence between \(k\)-Fibonacci and \(k\)-Lucas numbers
- Multiplicative independence in k-generalized Fibonacci sequences
- Number Theory
- On a conjecture about repdigits in \(k\)-generalized Fibonacci sequences
- On Square Fibonacci Numbers
- On the largest prime factor of the k-Fibonacci numbers
- Powers of two in generalized Fibonacci sequences
- Some identities for r-Fibonacci numbers
This page was built for publication: \(k\)-Fibonacci powers as sums of powers of some fixed primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664017)
