Let (F_n)_{n} be the classical Fibonacci sequence. It is well-known that it satisfies F_{n}^2 + F_{n+1}^2 = F_{2n+1}. In this study, we explore generalizations of this Diophantine equation in several directions. First, we solve the Diophantine equation (F_{n}^{(k)})^2 + (F_{n+d}^{(k)})^2 = F_{m}^{(k)} over the k-generalized Fibonacci numbers for every k \geq 2, generalizing Chaves and Marques. Next, we solve F_{n}^{s} + F_{n+d}^{s} = F_m over the Fibonacci numbers for every s \geq 2, generalizing Luca and Oyono. Finally, we solve the Diophantine equation F_{n}^s + \cdots + F_{n+d}^s = F_m for d+1 < n and s \geq 2.
In this paper, we prove that there is no x>=4 such that the difference of x-th powers of two consecutive Fibonacci numbers greater than 0 is a Lucas number.
Let $F_{n}$ be the $n$-th Fibonacci number. Put $φ=\frac{1+\sqrt5}{2}$. We prove that the following inequalities hold for any real $α$: 1) $\inf_{n \in \mathbb N} ||F_nα||\le\frac{φ-1}{φ+2}$, 2) $\liminf_{n\to \infty}||F_nα||\le 1/5$, 3) $\liminf_{n \to \infty}||φ^n α||\le 1/5$. These results are the best possible.
This is the first in a series of papers whereby we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat's Last Theorem. In this paper we give new improved bounds for linear forms in three logarithms. We also apply a combination of classical techniques with the modular approach to show that the only perfect powers in the Fibonacci sequence are 0, 1, 8, 144 and the only perfect powers in the Lucas sequence are 1, 4.
We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of $\{F_n^{(k)}: n\ge 1\}$. This generalizes a previous result (cf. arXiv:1508.07760) where the statement for $k=3$ was proved. The result is ineffective since it is based on Schmidt's subspace theorem.
In this paper we focus on finding all the factorials expressible as a product of a fixed number of $2k$-nacci numbers with $k \geq 2$. We derive the 2-adic valuation of the $2k$-nacci sequence and use it to establish bounds on the solutions of the initial equation. In addition, we specify a more general family of sequences, for which we can perform a similar procedure. We also investigate a possible connection of these results with $p$-regular sequences.
Recent developments in the theory and application of the Hardy-Littlewood method are discussed, concentrating on aspects associated with diagonal diophantine problems. Recent efficient differencing methods for estimating mean values of exponential sums are described first, concentrating on developments involving smooth Weyl sums. Next, arithmetic variants of classical inequalities of Bessel and Cauchy-Schwarz are discussed. Finally, some emerging connections between the circle method and arithmetic geometry are mentioned.
We derive closed form expressions for finite and infinite Fibonacci-Lucas sums having products of Fibonacci or Lucas numbers in the denominator of the summand. Our results generalize and extend those obtained by pioneer Brother Alfred Brousseau and later researchers.
At this paper, we derive some relationships between permanents of one type of lower-Hessenberg matrix and the Fibonacci and Lucas numbers and their sums.
In this paper, we find all the sums of three Fibonacci numbers which are close to a power of 2. This paper continues and extends the previous work of Hasanalizade \cite{Hasanalizade}.
We obtain closed-form expressions for all sums of the form \mbox{$\sum_{k = 1}^n {F_{mk}{}^4 }$} and \mbox{$\sum_{k = 1}^n {L_{mk}{}^4 }$} and their alternating versions, where $F_i$ and $L_i$ denote Fibonacci and Lucas numbers respectively. Our results complement those of Melham who studied the alternating sums.
We obtain explicit factored closed-form expressions for Fibonacci and Lucas sums of the form \mbox{$\sum_{k = 1}^n {F_{2rk}^3 }$} and \mbox{$\sum_{k = 1}^n {L_{2rk}^3 }$}, where $r$~and~$n$ are integers.
Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we characterize.
Let $(F_n)_{n\geq 0}$ and $(L_n)_{n\geq 0}$ be the Fibonacci and Lucas sequences, respectively. In this paper we determine all Fibonacci numbers which are mixed concatenations of a Fibonacci and a Lucas numbers. By mixed concatenations of $ a $ and $ b $, we mean the both concatenations $\overline{ab}$ and $\overline{ba}$ together, where $ a $ and $ b $ are any two non negative integers. So, the mathematical formulation of this problem leads us searching the solutions of two Diophantine equations $ F_n=10^d F_m +L_k $ and $ F_n=10^d L_m+F_k $ in non-negative integers $ (n,m,k) ,$ where $ d $ d…
Using a straightforward elementary approach, we derive numerous infinite arctangent summation formulas involving Fibonacci and Lucas numbers. While most of the results obtained are new, a couple of celebrated results appear as particular cases of the more general formulas derived here.
The paper studies algebraic independence of certain reciprocal sums of Fibonacci and Lucas sequences. Also more general binary recurrences are considered. The main tool is Mahler's method reducing the investigation of the algebraic independence of function values to the one of functions if these satisfy certain types of functional equations.
We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.
We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.
A Pair of Diophantine Equations Involving the Fibonacci Numbers
Carnegie Mellon University（卡内基梅隆大学）；Texas A&M University（德克萨斯农工大学）；Institut Teknologi Bandung（万隆理工学院）；University of California, Berkeley（加州大学伯克利分校）；University of Virginia（弗吉尼亚大学）；Williams College（威廉姆斯学院）；University of Waterloo（滑铁卢大学）
Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive integers satisfying $n>m>0$, unless $y=2,3,4,6$ or $10$.
We show that the diophantine equation $n^\ell+(n+1)^\ell + ...+ (n+k)^\ell=(n+k+1)^\ell+ ...+ (n+2k)^\ell$ has no solutions in positive integers $k,n \ge 1$ for all $\ell \ge 3$.
In this paper, we find all sums of two Fibonacci numbers which are close to a power of 2. As a corollary, we also determine all Lucas numbers close to a power of 2. The main tools used in this work are lower bounds for linear forms in logarithms due to Matveev and Dujella-Pethö version of the Baker-Davenport reduction method in diophantine approximation. This paper continues and extends the previous work of Chern and Cui.
The aim of this paper is to give linear independence results for the values of certain series. As an application, we derive arithmetical properties of the sums of reciprocals of Fibonacci and Lucas numbers associated with certain coprime sequences $\{n_\ell\}_{\ell\geq1}$. For example, the three numbers \[ 1,\qquad\sum_{p\text{:prime}}^{}\frac{1}{F_{p^2}},\qquad\sum_{p\text{:prime}}^{}\frac{1}{L_{p^2}} \] are linearly independent over $\mathbb{Q}(\sqrt{5})$, where $\{F_n\}$ and $\{L_n\}$ are the Fibonacci and Lucas numbers, respectively.
In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport reduction method, we use $p$-adic versions of both tools.
For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are sums of two $k-$Fibonacci numbers. The main tools used in this work are lower bounds for linear forms in logarithms and a version of the Baker--Davenport reduction method in diophantine approximation. This paper continues and extends the previous work of \cite{BL2} and \cite{BL13}.
Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we have determined all the powers of 2 which are sums of five Fibonacci numbers with few exceptions that we characterize. We have also stated an open problem relating to the number of solutions of equations like those studied in this paper.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Cerin and Z. Cerin & G. M. Gianella, more easily.
In this article, we consider the Diophantine equation $σ_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible in terms of Lucas sequences. Meanwhile, we obtain some results relating to other linear recurrent sequences.
There are two main interrelated goals of this paper. Firstly we investigate the sums \[ S_N(α,γ):=\sum_{n=1}^N\frac{1}{n\|nα-γ\|}~~~\text{and}~~~ R_N(α,γ):=\sum_{n=1}^N\frac{1}{\|nα-γ\|}\,, \] where $α$ and $γ$ are real parameters and $\|\cdot\|$ is the distance to the nearest integer. Our theorems improve upon previous results of W. M. Schmidt and others, and are (up to constants) best possible. Related to the above sums, we also obtain upper and lower bounds for the cardinality of \[ \{1\le n\le N:\|nα-γ\|<\varepsilon\} \, , \] valid for all sufficiently large $N$ and all sufficiently small …
In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses lower bounds for linear forms in logarithms, properties of continued fractions, and a version of the Baker-Davenport reduction method in Diophantine approximation.
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.
In this paper, we find the closed sums of certain type of Fibonacci related convergent series. In particular, we generalize some results already obtained by Brousseau, Popov, Rabinowitz and others.
Diophantine approximation with sums of two squares
Ramakrishna Mission Vivekananda Educational and Research Institute（罗摩克里希那使命维韦卡南达教育与研究所）；Indian Institute of Science Education & Research Kolkata（印度科学教育研究学院加尔各答分校）
Let $(F_n)_{n\ge 1}$ be the Fibonacci sequence. Define $P(F_n): = (\sum_{i=1}^n F_i)_{n\ge 1}$; that is, the function $P$ gives the sequence of partial sums of $(F_n)$. In this paper, we first give an identity involving $P^k(F_n)$, which is the resulting sequence from applying $P$ to $(F_n)$ $k$ times. Second, we provide a combinatorial interpretation of the numbers in $P^k(F_n)$.
In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform each case of the above Diophantine equations to a cubic elliptic curve of positive rank, then get infinitely many integer solutions for each case. We also solve these Diophantine equations for some values of n, a, a_i, t_i, and obtain infinitely many solutions for each case, and show among the other things that how sums of four, five, or more cubics can be wr…
The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as the sum of $k$ different and non-consecutive Fibonacci numbers. This property is closely related to, and based on, a prime number theorem for certain morphic sequences. The proof of such a prime number theorem, combined with a corresponding local result, is the central contribution of this paper, from which we derive the result stated in the beginning. Probl…
In this paper, we refine the method introduced by Izadi and Baghalaghdam to search integer solutions to the Diophantine equation $X_1^5+X_2^5+X_3^5=Y_1^3+Y_2^3+Y_3^3$. We show that the Diophantine equation has infinitely many positive solutions.
For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,...,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In 2005, Noe and Post conjectured that the only solutions of Diophantine equation $F_m^{(k)}=F_n^{(\ell)}$, with $\ell>k>1, n>\ell+1, m>k+1$ are [(m,n,\ell,k)=(7,6,3,2) and (12,11,7,3).] In this paper, we confirm this conjecture.
In this paper, we study the diophantine equation ${{σ}_{2}}(n)-{{n}^{2}}=An+B$. We prove that except for finitely many computable solutions, all the solutions to this equation with $(A,B)=({{L}_{2m}},F_{2m}^{2}-1)$ are $n={{F}_{2k+1}}{{F}_{2k+2m+1}}$, where both ${{F}_{2k+1}}$ and ${{F}_{2k+2m+1}}$ are Fibonacci primes. Meanwhile, we show that the twin primes conjecture holds if and only if the equation ${{σ}_{2}}(n)-{{n}^{2}}=2n+5$ has infinitely many solutions.
