Related papers: Fibonacci Identities via Fibonacci Functions
We apply the Desnanot-Jacobi identity to give an alternative proof of the determinants whose entries are rising powers of the Fibonacci numbers given by Prodinger. We then generalize the determinants to include entries that are rising…
We give alternative proof of Melham's and Howard's identities on generalised Fibonacci numbers
This paper builds on the research initiated by Boyadzhiev, but introduces generalized harmonic numbers, \[ H_n(\alpha)= \sum_{k=1}^n \frac{\alpha^{k}}{k}, \] which enable the derivation of new identities as well as the reformulation of…
We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson's transformation formula by specialization or through Bailey's method, the second similar formula can…
In 2016, Edgar and, independently of him, Bhatnagar sta\-ted a nice polynomial identity that connects Fibonacci and Lucas numbers. Shortly after their publications, this identity has been generalized in two different ways: Dafnis, Phillipou…
The \emph{Hosoya triangle} is a triangular array where every entry is a product of two Fibonacci numbers. We use the geometry of this triangle to find new identities related to Fibonacci numbers. We give geometric interpretation for some…
Self-consistency-based approaches, which involve repeatedly sampling multiple outputs and selecting the most consistent one as the final response, prove to be remarkably effective in improving the factual accuracy of large language models.…
We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…
This paper is concerned with developing some new connection formulae between two generalized classes of Fibonacci and Lucas polynomials. All the connection coefficients involve hypergeometric functions of the type $_2F_{1}(z)$, for certain…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
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$.
Some generalized multi-sum Chu-Vandermonde identities are presented and proved, generalizing some known multi-sum Chu-Vandermonde identities from literature and adding some quadratic and cubic examples of these identities. Some other…
We give an elegant formulation of the structure equations (of Cartan) and the Bianchi identities in terms of exterior calculus without reference to a particular basis and without the exterior covariant derivative. This approach allows both…
We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…
Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data widely used in observational sciences. In its classical form, ICA relies on modeling the data as a linear mixture of non-Gaussian…
We propose an extension of Poole's independent choice logic based on a relaxation of the underlying independence assumptions. A credal semantics involving multiple joint probability mass functions over the possible worlds is adopted. This…
Knuth [12, Page 417] states that "the (program of the) Fibonaccian search technique looks very mysterious at first glance" and that "it seems to work by magic". In this work, we show that there is even more magic in Fibonaccian (or else…
In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…
In this papier, by the classical umbral calculus method, we establish identities involving the Appell polynomials and extend some existing identities.
In this paper, we first prove that for any strong divisibility sequences $\boldsymbol{a} = \left(a_n\right)_{n\geq 1}$, we have the identity: $\mathrm{lcm} \left\lbrace \binom{n}{0}_{\bf{a}}, \binom{n}{1}_{\bf{a}},\dots,…