International Mathematical Forum, 3, 2008, no.

3, 147 - 149

New Identities for F2n and F2n+1

Y
ucel T
urker Ulutas
Kocaeli University, Department of Mathematics
Umuttepe Campus, Izmit, Turkey
turkery@kou.edu.tr
ur
Nese Om
Kocaeli University, Department of Mathematics
Umuttepe Campus, Izmit, Turkey
Abstract
In this study, we obtain a new identities for Fibonacci numbers F2n
and F2n+1 , where n 1.

Mathematics Subject Classification: 11B37, 11B39

Keywords: Fibonacci numbers, Recurrence relation

Introduction

It is well-known that the Fibonacci numbers are given the recurrence relation
Fn+1 = Fn + Fn1 ,

where

n1

(1)

with the initial conditions F0 = 0, F1 = 1. There are a lot of identities about

the Fibonacci numbers. We obtain a new identities for even and odd Fibonacci
numbers.

A New Identities for F2n and F2n+1

Theorem 2.1 F2n = Fn2 + 2Fn Fn1 , where n 1.

Proof. We write the Fibonacci recurrence relation
Fn+1 = Fn + Fn1 .

(2)

148

Y. Turker Ulutas and N. Omur

By squaring of the each side of equation (2), we get

that is

2
2
= Fn2 + 2Fn Fn1 + Fn1
,
Fn+1

(3)

2
2
Fn1
= Fn2 + 2Fn Fn1 .
Fn+1

(4)

Obtained by setting m=n in equation Fm+n = Fm+1 Fn+1 Fm1 Fn1 (Mana,
1969) is
2
2
F2n = Fn+1
+ Fn1
.
(5)
From equalities (4) and (5), it is clearly seen that
F2n = Fn2 + 2Fn Fn1 .

(6)

So the theorem is proved.

Theorem 2.2
2
+ 2Fn Fn+1 , where n 1.
F2n+1 = Fn1

(7)

Proof. Proving the identity is to apply the principle of mathematical induction

(PMI). Since
F3 = 2F1 F2 + F02 = 2.1.1 + 0 = 2,
(8)
the given identity is true when n = 1. Now we assuma that it is true for
arbitrary positive integer k:
2
+ 2Fk Fk+1
F2k+1 = Fk1

(9)

Then, we write
Fk2 + 2Fk+1 Fk+2 = (Fk+1 Fk1 )2 + 2Fk+1 Fk+2

(10)

2
2
= Fk+1
2Fk+1Fk1 + Fk1
+ 2Fk+1(Fk+1 + Fk
2
= 3Fk+1 2Fk+1Fk1 + F2k+1

(11)
(12)

2
= Fk+1
+ 2Fk+1(Fk+1 Fk1 ) + F2k+1
2
Fk+1

=
+ 2Fk+1 Fk + F2k+1 .
Using the Theorem 1, we obtain
Fk2 + 2Fk+1 Fk+2 = F2k+1 + F2k+2 = F2k+3 .

(13)
(14)
(15)

Thus the formula is true for n = k + 1. So, by PMI, the identity is true for
every integer n 1. Since by using Fibonacci numbers, Fibonacci numbers
with negative indices can be written as
Fn = (1)n+1 Fn , n 1.

(16)

we conclude the following result.

Theorem 2.3 For n 1,
2
F2n = Fn2 2Fn Fn+1 F2n+1 = Fn+1
2Fn Fn1 .

(17)

New identities for F2n and F2n+1

149

References
[1] T. Koshy, Fibonacci and Lucas Numbers with Applications, A WileyInterscience Publication, New York, 2001.
Received: August 23, 2007