scholarly journals Sums of products of generalized Fibonacci and Lucas numbers

2009 ◽  
Vol 42 (2) ◽  
Author(s):  
Zvonko Čerin
Keyword(s):  
Recent Work ◽  
Recurrence Relation ◽  
Fixed Number ◽  
Binomial Coefficients ◽  
Natural Numbers ◽  
Lucas Numbers ◽  
Alternating Sums ◽  
Explicit Formulae ◽  
Fibonacci And Lucas Numbers ◽  
Sums Of Products

AbstractIn this paper we obtain explicit formulae for sums of products of a fixed number of consecutive generalized Fibonacci and Lucas numbers. These formulae are related to the recent work of Belbachir and Bencherif. We eliminate all restrictions about the initial values and the form of the recurrence relation. In fact, we consider six different groups of three sums that include alternating sums and sums in which terms are multiplied by binomial coefficients and by natural numbers. The proofs are direct and use the formula for the sum of the geometric series.

scholarly journals On the reciprocal sums of products of Fibonacci and Lucas numbers

Filomat ◽  
2018 ◽  
Vol 32 (8) ◽  
pp. 2911-2920 ◽  
Author(s):  
Ginkyu Choi ◽  
Younseok Choo
Keyword(s):  
Lucas Numbers ◽  
Fibonacci And Lucas Numbers ◽  
Sums Of Products ◽  
Reciprocal Sums

In this paper, we study the reciprocal sums of products of Fibonacci and Lucas numbers. Some identities are obtained related to the numbers ??,k=n 1/FkLk+m and ??,k=n 1/LkFk+m, m ? 0.

On factorization of the Fibonacci and Lucas numbers using tridiagonal determinants

2012 ◽  
Vol 62 (3) ◽  
Author(s):  
Jaroslav Seibert ◽  
Pavel Trojovský
Keyword(s):  
Recurrence Relation ◽  
Chebyshev Polynomials ◽  
Fibonacci Numbers ◽  
Second Order ◽  
Tridiagonal Matrix ◽  
Lucas Numbers ◽  
Tridiagonal Matrices ◽  
Fibonacci And Lucas Numbers

AbstractThe aim of this paper is to give new results about factorizations of the Fibonacci numbers F n and the Lucas numbers L n. These numbers are defined by the second order recurrence relation a n+2 = a n+1+a n with the initial terms F 0 = 0, F 1 = 1 and L 0 = 2, L 1 = 1, respectively. Proofs of theorems are done with the help of connections between determinants of tridiagonal matrices and the Fibonacci and the Lucas numbers using the Chebyshev polynomials. This method extends the approach used in [CAHILL, N. D.—D’ERRICO, J. R.—SPENCE, J. P.: Complex factorizations of the Fibonacci and Lucas numbers, Fibonacci Quart. 41 (2003), 13–19], and CAHILL, N. D.—NARAYAN, D. A.: Fibonacci and Lucas numbers as tridiagonal matrix determinants, Fibonacci Quart. 42 (2004), 216–221].

scholarly journals Alternating sums of the powers of Fibonacci and Lucas numbers

2011 ◽  
Vol 12 (1) ◽  
pp. 87 ◽  
Author(s):  
Emrah Kiliç ◽  
Neşe Ömür ◽  
Yücel Türker Ulutaş
Keyword(s):  
Lucas Numbers ◽  
Alternating Sums ◽  
Fibonacci And Lucas Numbers

scholarly journals On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2

2009 ◽  
Vol 2009 ◽  
pp. 1-21 ◽  
Author(s):  
Tian-Xiao He ◽  
Peter J.-S. Shiue
Keyword(s):  
Recurrence Relation ◽  
Chebyshev Polynomials ◽  
Recurrence Relations ◽  
Linear Recurrence ◽  
Lucas Numbers ◽  
Polynomial Sequences ◽  
Fibonacci And Lucas Numbers ◽  
Linear Recurrence Relation ◽  
Humbert Polynomials ◽  
General Method

Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2. The applications of the method to the Fibonacci and Lucas numbers, Chebyshev polynomials, the generalized Gegenbauer-Humbert polynomials are also discussed. The derived idea provides a general method to construct identities of number or polynomial sequences defined by linear recurrence relations. The applications using the method to solve some algebraic and ordinary differential equations are presented.

scholarly journals Some Finite Sums Involving Generalized Fibonacci and Lucas Numbers

2011 ◽  
Vol 2011 ◽  
pp. 1-11 ◽  
Author(s):  
E. Kılıç ◽  
N. Ömür ◽  
Y. T. Ulutaş
Keyword(s):  
Lucas Numbers ◽  
Alternating Sums ◽  
Finite Sums ◽  
Fibonacci And Lucas Numbers

By considering Melham's sums (Melham, 2004), we compute various more general nonalternating sums, alternating sums, and sums that alternate according to involving the generalized Fibonacci and Lucas numbers.

scholarly journals An identity for the Fibonacci and Lucas numbers

1993 ◽  
Vol 35 (3) ◽  
pp. 381-384 ◽  
Author(s):  
Derek Jennings
Keyword(s):  
Recurrence Relation ◽  
Fibonacci Numbers ◽  
Lucas Numbers ◽  
Fibonacci And Lucas Numbers

In this paper we prove an identity between sums of reciprocals of Fibonacci and Lucas numbers. The Fibonacci numbers are defined for all n ≥ 0 by the recurrence relation Fn + 1 = Fn + Fn-1 for n ≥ 1, where F0 = 0 and F1 = 0. The Lucas numbers Ln are defined for all n ≥ 0 by the same recurrence relation, where L0 = 2 and L1 = 1 We prove the following identify.

Sign in / Sign up

Export Citation Format

Share Document