An identity for the Fibonacci and Lucas numbers
Derek Jennings
Abstract
Open-access reader
Derek Jennings
Abstract
Open-access reader
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Fibonacci number, Lucas number, Mathematics, Pisano period, Recurrence relation, Lucas sequence, Identity (music), Fibonacci polynomials