The r-subsequences of the Fibonacci sequence

The Fibonacci sequence 0, 1, 1, 2, 3, . . . is defined by the recurrence relation

F0 = 0, F1 = 1, Fn+1 = Fn + Fn−1 for n ≥ 1. (1)

In [1] some relations between the odd terms F1 , F3 , F5 , . . . were obtained; here we show
that similar relations hold between the terms of any r-subsequence, by which we mean a
subsequence of the type Fn , Fn+r , Fn+2r , . . . .
Recall that the Fibonacci sequence can be extended to the left by rewriting the re-
currence relation as Fn−1 = Fn+1 − Fn . Now,

Fn = 2Fn − Fn , (2)
and Fn+1 = Fn + Fn−1 . (3)
Adding (2) and (3), we obtain
Fn+2 = 3Fn − Fn−2 , (4)
which is the lemma from [1]. If we now add (3) and (4), we get
Fn+3 = 4Fn + Fn−3 , (5)

and so on. The coefficients 2, 1, 3, 4 of Fn in (2)–(5) are recognised as coming from the
Lucas sequence, defined by

L0 = 2, L1 = 1, Ln+1 = Ln + Ln−1 for n ≥ 1. (6)

So if we continue the above process, we obtain a recurrence relation for any Fibonacci
r-subsequence:
Fn+r = Lr Fn + (−1)r+1 Fn−r . (7)
Indeed, since the Lucas numbers Ln satisfy the same recurrence relation as the Fn , a
similar argument yields
Ln+r = Lr Ln + (−1)r+1 Ln−r . (8)
Note, for future use, that on putting n = r in this, we obtain

L2r = L2r + 2(−1)r+1 . (9)

Likewise (7) gives

F2r = Lr Fr . (10)
(An alternative way of proceeding is to note that, if the quadratic polynomial x2 −x−1
associated to (1) and (6) has zeros σ, τ , then σ + τ = 1 and στ = −1. So σ 2 + τ 2 =
(σ + τ )2 − 2στ = 3, and σ 2 τ 2 = 1. Thus the polynomial x2 − 3x + 1 has zeros σ 2 , τ 2 ,
whence (4). More generally, solving (6) yields Lr = σ r + τ r , and σ r τ r = (−1)r , so the
polynomial x2 − Lr x + (−1)r has zeros σ r , τ r , which gives (7) and (8).)
Next I shall recall some results from [2]. If we put
! !
0 1 F0 F1
A= = ,
1 1 F1 F2

1
then an easy induction shows that
!
Fn−1 Fn
A =
n
.
Fn Fn+1

Taking determinants, and noting that det A = −1, we have the well-known result

Fn−1 Fn+1 − Fn2 = (−1)n . (11)

This should be compared with Corollary 1 of [1], which can be rewritten

Fn−2 Fn+2 − Fn2 = 1 (n odd).

Surely this must come from another determinant? Indeed it does, and more generally if
we put !
Fn−r Fn
Bn, r =
Fn Fn+r
we shall find the value of det Bn, r , that is, of Fn−r Fn+r −Fn2 , in part (iii) of the proposition
below. Note that Bn, 1 = An ; also, if we put
!
0 1
Cr = ,
(−1) r+1
Lr

then it is immediate from (7) that Cr Bn, r = Bn+r, r . However, to avoid having r separate
induction arguments for each value of r, we need a way of obtaining Bn+1, r (rather than
Bn+r, r ) from Bn, r , which we shall do in part (ii) of the proposition below.
First a couple more results from [2]. The equation Am An = Am+n yields

Fm−1 Fn + Fm Fn+1 = Fm+n . (12)

Next, the equation A−n = (An )−1 gives

! !
F−n−1 F−n Fn+1 −Fn
= (−1) n
F−n F−n+1 −Fn Fn−1

from which
F−n = (−1)n+1 Fn . (13)
Now put !
−Fr−1 1
Dr = .
(−1)r+1
Fr+1

Proposition. (i) det Dr = −Fr2 (ii) Dr Bn, r = Fr Bn+1, r

(iii) det Bn, r = (−1)n+r+1 Fr2 (iv) Drr = Frr Cr

Proof. (i) det Dr = −Fr−1 Fr+1 + (−1)r = −Fr2 , by (11).

2
 ! !
−Fr−1 1 Fn−r Fn
(ii) Dr Bn, r =
(−1)r+1
Fr+1 Fn Fn+r
!
Fn − Fr−1 Fn−r Fn+r − Fr−1 Fn
= .
(−1) Fn−r + Fr+1 Fn (−1)r+1 Fn + Fr+1 Fn+r
r+1

In the first column, we have, by (12), Fn − Fr−1 Fn−r = Fr Fn+1−r , as required; and then

(−1)r+1 Fn−r + Fr+1 Fn = (−1)r+1 (Fn−r − F−r−1 Fn ), by (13),

= (−1)r+1 F−r Fn+1 , by (12),
= Fr Fn+1 , by (13),

as required. Similarly for the second column, replacing n by n + r. This completes (ii).

(iii) Since F0 = 0, det B0, r = F−r Fr = (−1)r+1 Fr2 , by (13). So the result is true for
n = 0. The general result now follows by induction on n, using (i) and (ii).

(iv) This is an exercise for the reader. (It is not used elsewhere.)

Writing out (iii) in full, we have

Fn−r Fn+r − Fn2 = (−1)n+r+1 Fr2 , (14)

which generalises both (11) and also Corollary 1 of [1]. Next, we generalise the theorem
from [1]. If we substitute into (14) from (7), we get the generalisation

Lr Fn Fn−r = Fn2 + (−1)r Fn−r

2
+ (−1)n+r+1 Fr2 . (15)

When r = 2 this becomes 3Fn Fn−2 = Fn2 + Fn−2 2

+ (−1)n+1 , which in the case where n is
odd is the theorem from [1].
Finally we shall obtain, in (16) below, a generalisation of Corollary 2 from [1]. First,
replace r by 2r and n by n + r in (15):
2 2 2
L2r Fn+r Fn−r = Fn+r + Fn−r + (−1)n+r+1 F2r .

Substituting for Fn+r Fn−r from (14),

2
Fn+r − L2r Fn2 + Fn−r
2
= (−1)n+r+1 (L2r Fr2 − F2r
2
)
n+r+1 2 2
= (−1) Fr (L2r − Lr ), by (10).

By (9), we deduce
2
Fn+r − L2r Fn2 + Fn−r
2
= 2(−1)n Fr2 . (16)
2
When r = 2 this becomes Fn+2 − 7Fn2 + Fn−2
2
= 2(−1)n , which, in the case where n is
odd, is Corollary 2 from [1].

3
References

1. V. Rajesh and G. Leversha, Some properties of odd terms of the Fibonacci sequence,
Math. Gaz. 88 (2004), 85–6.

2. J. R. Silvester, Fibonacci properties by matrix methods, Math. Gaz. 63 (1979),

188–91.

John R. Silvester 1 July 2004

Department of Mathematics
King’s College
Strand
London WC2R 2LS
(Email: [email protected])