Related papers: Integration Formulas Involving Fibonacci and Lucas…
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…
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…
In \cite{Ka}, the authors obtained a method for deriving special matrices, whose powers are related to Fibonacci and Lucas numbers. In the study, it has been developed a method for deriving special matrices of $3\times 3$ dimensions, whose…
We study an elementary series that can be considered a relative of a series studied by Ramanujan in Part 1 of his Lost Notebooks. We derive a closed form for this series in terms of the inverse hyperbolic arctangent and the polylogarithm.…
We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
By using Cauchy integral formula in the theory of complex functions, the authors establish some integral representations for the principal branches of several complex functions involving the logarithmic function, find some properties, such…
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…
We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is…
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
This paper explores the intricate relationships between Lucas numbers and Diophantine equations, offering significant contributions to the field of number theory. We first establish that the equation regarding Lucas number $L_n = 3x^2$ has…
Horadam introduced a new generalized sequence of numbers, describing its key features and the special sub-sequences that are obtained depending on the choices of initial parameters. This sequence and its sub-sequences are known as the…
In this paper, we present a new approach to the convolved Fibonacci numbers arising from the generating function of them and give some new and explicit identities for the convolved Fibonacci numbers.
It is known in the case of the Stieltjes transform that evaluating the integral by expanding the kernel of transformation followed by term by term integration leads to an infinite series of divergent integrals. Moreover, it is known that…
In this work, we consider certain class of bi-univalent functions related with shell-like curves related to $\kappa-$Fibonacci numbers. Further, we obtain the estimates of initial Taylor-Maclaurin coefficients (second and third…
Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…
We show some of the mathematics that is being developed for the computation of deep inelastic structure functions to three loops. These include harmonic sums, harmonic polylogarithms and a class of difference equations that can be solved…
In this paper, bicomplex Pell and bicomplex Pell-Lucas numbers are defined. Also, negabicomplex Pell and negabicomplex Pell-Lucas numbers are given. Some algebraic properties of bicomplex Pell and bicomplex Pell-Lucas numbers which are…