相关论文: G\'en\'eralisation du Th\'eor\`eme de Zeckendorf
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 paper we present applications of some special numbers obtained from a difference equation of degree three, especially in the Coding Theory. As a particular case, we obtain the generalized Pell-Fibonacci-Lucas numbers, which were…
A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…
In this paper we announce some results obtained for certain algebraic functions, which we call of cyclotomic type. The main results properly resemble von Staudt-Clausen's theorem and Kummer's congruence for the Bernoulli numbers, and such…
Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Using a continued fraction approach,…
Zeckendorf's Theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. We consider higher-dimensional lattice analogues, where a legal decomposition of a number $n$ is a collection of…
A generalization of the well-known Fibonacci sequence is the $k$-Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,0, \ldots, 1$, and each term afterwards is the sum of the preceding $k$ terms.…
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…
By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of distinct non-adjacent Fibonacci terms. In this paper, we investigate the asymptotic formula of the number of binary expansions $<x$ that have no adjacent terms,…
In this paper, new families of generalized Fibonacci and Lucas numbers are introduced. In addition, we present the recurrence relations and the generating functions of the new families for $k=2$.
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
We evaluate a determinant of generalized Fibonacci numbers, thus providing a common generalization of several determinant evaluation results that have previously appeared in the literature, all of them extending Cassini's identity for…
Zeckendorf's theorem states that every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers ${F_n}$, with initial terms $F_1 = 1, F_2 = 2$. Previous work proved that as $n \to \infty$ the distribution of…
This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…
Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…
Starting with some determinants of binomial coefficients which are related to Fibonacci and Lucas polynomials we study similar determinants for some generalizations of these polynomials and their q-analogues.
In this article we present a generalization of a Leibniz's geometrical theorem and an application of it.
Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…
Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…
Philip Matchett Wood and Doron Zeilberger have constructed identities for the Fibonacci numbers $f_n$ of the form $1f_n = f_n$ for all $n \geq 1$; $2f_n = f_{n-2} + f_{n+1}$ for all $n \geq 3$; $3f_n = f_{n-2} + f_{n+2}$ for all $n \geq 3$;…