In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence modulo an integer, $m$ and derive certain interesting properties related to them. Afterwards, we derive some new properties of a class of generalized Fibonacci numbers. In the last part of the paper we introduce some generalized Fibonacci polynomial sequences and we derive some results related to them.
Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when $p=3, 5$. We also compute the first and second moments of Fibonacci polynomials $f_{n}(x)$ over finite fields, which give necessary conditions for Fibonacci polynomials to be permutation polynomials over finite fields.
We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the convolved h(x)-Fibonacci polynomials form a family of Hessenberg matrices.
In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate Fibonacci p-polynomials are general form of, for example, bivariate Fibonacci and Pell p-polynomials, second kind Chebyshev polynomials, bivariate Jacobsthal polynomials etc.
A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are irreducible if and only if $n$ is a prime number. For example, the Fibonacci polynomials, Pell polynomials, Fermat polynomials, Lucas polynomials, Pell-Lucas polynomials, Fermat-Lucas polynomials are irreducible when $n$ is a prime number; and Chebyshev polynomials (second kind), Morgan-Voyce polynomials (Fibonacci type), and Vieta polynomials are reducible when…
In this note, we obtain some identities for the generalized Fibonacci polynomial by using the Q(x) matrix. These identities including the Cassini identity and Honsberger formula can be applied to some polynomial sequences, such as Fibonacci polynomials, Lucas polynomials, Pell polynomials, Pell-Lucas polynomials, Fermat polynomials, Fermat-Lucas polynomials, and so on.
In this paper, we define the incomplete h(x)-Fibonacci and h(x)-Lucas polynomials, we study recurrence relations and some properties of these polynomials
In this paper, we consider the matrix polynomial obtained by using bi-periodic Fibonacci matrix polynomial. Then, we give some properties and binomial transforms of the new matrix polynomials.
A second order polynomial sequence is of Fibonacci type (Lucas type) if its Binet formula is similar in structure to the Binet formula for the Fibonacci (Lucas) numbers. In this paper we generalize identities from Fibonacci numbers and Lucas numbers to Fibonacci type and Lucas type polynomials. A Fibonacci type polynomial is equivalent to a Lucas type polynomial if they both satisfy the same recurrence relations. Most of the identities provide relationships between two equivalent polynomials. In particular, each type of identities in this paper relate the following polynomial sequences: Fibona…
A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials, Pell polynomials, Fermat polynomials, Chebyshev polynomials, Morgan-Voyce polynomials, Lucas polynomials, Pell-Lucas polynomials, Fermat-Lucas polynomials, Chebyshev polynomials. The \emph{resultant} of two polynomials is the determinant of the Sylvester matrix and the \emph{discriminant} of a polynomial $p$ is the resultant of $p$ and its derivative. We study …
In this paper, we give some determinantal and permanental representations of Generalized Fibonacci Polynomials by using various Hessenberg matrices. These results are general form of determinantal and permanental representations of k sequences of the generalized order-k Fibonacci and Pell numbers.
In this paper we generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers satisfying remarkable recurrence relations.
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.
We continue our study on relationships between Bernoulli polynomials and balancing (Lucas-balancing) polynomials. From these polynomial relations, we deduce new combinatorial identities with Fibonacci (Lucas) and Bernoulli numbers. Moreover, we prove a special identity involving Bernoulli polynomials and Fibonacci numbers in arithmetic progression. Special cases and some corollaries will highlight interesting aspects of our findings. Our results complement and generalize these of Frontczak (2019).
We establish new connection formulae between Fibonacci polynomials and Chebyshev polynomials of the first and second kinds. These formulae are expressed in terms of certain values of hypergeometric functions of the type 2F1. Consequently, we obtain some new expressions for the celebrated Fibonacci numbers and their derivatives sequences. Moreover, we evaluate some definite integrals involving products of Fibonacci and Chebyshev polynomials.
In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic and cubic weighted generalized Fibonacci number summation identities are derived, including some infinite series and generating functions. In addition some quadratic and cubic weighted generalized Fibonacci number summation identities with binomial coefficients, and some cubic and quartic Fibonacci and Lucas number summation identities are derived.
In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas numbers and generalized order-k Fibonacci numbers. In addition, we obtain Binet formula and combinatorial representation for generalized order-k Lucas numbers by using properties of generalized Fibonacci numbers.
We show that certain weighted Fibonacci and Lucas series can always be expressed as linear combinations of polylogarithms. In some special cases we evaluate the series in terms of Bernoulli polynomials, making use of the connection between these polynomials and the polylogarithm.
This paper is concerned with developing some new identities of generalized Fibonacci numbers and generalized Pell numbers. A new class of generalized numbers is introduced for this purpose. The two well-known identities of Sury and Marques which are recently developed are deduced as special cases. Moreover, some other interesting identities involving the celebrated Fibonacci, Lucas, Pell and Pell-Lucas numbers are also deduced
It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study the generalized Fibonacci polynomials and classify them in two types depending on their Binet formula. We give a complete characterization for those polynomials that satisfy the strong divisibility property. We also giveformulas to calculate the $\gcd$ of those polynomials that do not satisfy the strong divisibility property. Note. This paper is now published…
In this paper, we consider the new family of recurrence sequences of $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell numbers. We shall obtain a Binet-style formula and study the asymptotic behavior of dominant root of characteristic equation. Moreover, we shall prove some auxiliary results about these sequences. In particular, we characterize the first $(q,k)$-generalized Fibonacci numbers in terms of binary sequences.
One of the best known and oldest identities for the Fibonacci sequence $F_n$ is $F_{n+1}F_{n-1}-F_{n}^2=(-1)^n$ which was derived first by R. Simson in 1753 and it is now called as Simson or Cassini Identity. In this paper, we generalize this result to generalized m-step Fibonacci numbers and give an attractive formula. Furthermore, we present some Simson's identities of particular generalized m-step Fibonacci sequences.
In this paper, we prove identities for members of the k-generalized Fibonacci sequence with negative indices and we apply these identities to deduce an exact formula for its zero-multiplicity.
In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute them, and we also obtain some properties about the quotient of the period and the rank. We find that the polynomial case is much more complicated than the integer case.
In this paper, we present a further generalization of the bi- periodic Fibonacci quaternions and octonions. We give the generating function, the Binet formula, and some basic properties of these quaternions and octonions. The results of this paper not only give a generalization of the bi-periodic Fibonacci quaternions and octonions, but also include new results such as the matrix representation and the norm value of the generalized bi-periodic Fibonacci quaternions.
Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some characteristic situations in which such matrices are involved. Using the columns and rows of these matrices, we will build the bases of the space of formal power series and the space of polynomials, the properties of which allow us to call them "Fibonacci bases".
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and double binomial summation identities, partial sums and ordinary generating functions. Explicit examples are given for small $n$ values.
We study some divisibility properties related to the factors of the discriminant of the characteristic polynomial of generalized Fibonacci sequences $(G_n)_{n\ge0}$ defined by $G_0=0$, $G_1=1$ and $G_n=pG_{n-1}+qG_{n-2}$ for $n\ge2$, where $p,q$ are given integers. As corollaries, we give some divisibility properties on some well known sequences.
For an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all integers $ c $ with at least two representations as a difference between a $ k $-generalized Fibonacci number and a power of $ 3 $. This paper continues the previous work of the first author for the Fibonacci numbers, and the Tribonacci numbers.
We study ratio limits of the consecutive terms of weighted $n$-generalized Fibonacci sequences generated from arbitrary complex initial conditions by linear recurrences with arbitrary complex weights. We prove that if the characteristic polynomial of such a linear recurrence is asymptotically simple, then the ratio limit exists for any sequence generated from arbitrary nontrivial initial conditions and it is equal to the unique zero of the characteristic polynomial.
For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,\ldots,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of two of the form $F_n^{(k)}+F_m^{(k)}$. This work is related to a recent result by Bravo and Luca concerning the case $k=2$.
In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence (g_n) of order 2. Using these formulas we prove that some approximation methods, as secant, Newton, Halley and Householder methods, can generate subsequences of (x_n). Moreover, interesting properties on Fibonacci numbers arise as an application. Finally, we apply all the results to the convergents of a particular continued fraction which represents quadratic …
In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a new recurrence relation for the r-th partial derivative sequence of bivariate Fibonacci polynomials.
We provide a formula for the $n^{th}$ term of the $k$-generalized Fibonacci-like number sequence using the $k$-generalized Fibonacci number or $k$-nacci number, and by utilizing the newly derived formula, we show that the limit of the ratio of successive terms of the sequence tends to a root of the equation $x + x^{-k} = 2$. We then extend our results to $k$-generalized Horadam ($k$GH) and $k$-generalized Horadam-like ($k$GHL) numbers. In dealing with the limit of the ratio of successive terms of $k$GH and $k$GHL, a lemma due to Z. Wu and H. Zhang [8] shall be employed. Finally, we remark that…
Let $(U_{n}(P,Q) $ and $(V_{n}(P,Q) $ denote the generalized Fibonacci and Lucas sequence, respectively. In this study, we assume that $Q=1.$ We determine all indices $n$ such that $U_{n}=5\square $ and $U_{n}=5U_{m}\square $ under some assumptions on $P.$ We show that the equation $V_{n}=5\square $ has the solution only if $n=1$ for the case when $% P$ is odd. Moreover, we show that the equation $V_{n}=5V_{m}\square $ has no solutions.
We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to the first term of this Binet-style formula to generate the desired sequence. These results were also found (independently) at about the same time by Zhaohui Du of Singapore, China. We are working on a joint paper.
For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms. In this paper, for an integer $d\geq 2$ which is square free, we show that there is at most one value of the positive integer $x$ participating in the Pell equation $x^{2}-dy^{2} =\pm 1$ which is a $k$--generalized Fibonacci number, with a couple of parametric exceptions which we completely characterise. This paper extends previous work from [17] for the ca…
The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent paper, Amdeberhan, Chen, Moll, and Sagan considered some arithmetic properites of the generalized Fibonacci sequence. Specifically, they considered the behavior of analogues of the $p$-adic valuation and the Riemann zeta function. In this paper, we resolve some conjectures which they raised relating to these topics. We also consider the rank modulo $n$ in more d…
In this paper, firstly, we define the Qq-generating matrix for bi-periodic Fibonacci polynomial. And we give nth power, determinant and some properties of the bi-periodic Fibonacci polynomial by considering this matrix representation. Also, we introduce the Hadamard products for bi-periodic Fibonacci Qnq generating matrix and bi-periodic Lucas Qnl generating matrix of which entries is bi-periodic Fibonacci and Lucas numbers. Then, we investigate some properties of these products.
In this study, we find continued fraction expansion of sqrt(d) when d=a^2+2a where a is positive integer. We consider the integer solutions of the Pell equation x^2-(a^2+2a)y^2=N when N={-1,+1,-4,+4}. We formulate the n-th solution (x_{n},y_{n}) by using the continued fraction expansion. We also formulate the n-th solution (x_{n},y_{n}) via the generalized Fibonacci and Lucas sequences.
We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence $\{F_n\}_{n=0}^\infty$ misses a congruence class modulo every prime large enough. On the other hand, if $Q \neq \pm 1$, we prove that (under GRH) the sequence $\{F_n\}_{n=0}^\infty$ hits every congruence class modulo infinitely many primes.
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.
We prove recurrence relations and modulo periodic properties of multiple derivatives of Fibonacci polynomials. We apply the obtained results to present the dynamic structures of Fibonacci polynomials over the ring of 2-adic integers by investigating minimal decompositions which consist of minimal subsystems and attracting basins.
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.
The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential) generating functions to each other. As a consequence, we also establish new combinatorial identities for balancing polynomials and Fibonacci (Lucas) numbers.
