Hindawi Publishing Corporation

Journal of Applied Mathematics

Volume 2016, Article ID 4971594, 6 pages
http://dx.doi.org/10.1155/2016/4971594

Research Article
A Method to Construct Generalized Fibonacci Sequences

Adalberto Garca-Mynez1 and Adolfo Pimienta Acosta2

1
Instituto de Matematicas, Universidad Nacional Autonoma de Mexico, Area de la Investigacion Cientfica Circuito Exterior,
Ciudad Universitaria Coyoacan, 04510 Mexico, DF, Mexico
2
Departamento de Matematicas, Universidad Autonoma Metropolitana, Prolongacion Canal de Miramontes No. 3855,
Colonia Ex-Hacienda San Juan de Dios, Delegacion Tlalpan, 14387 Mexico, DF, Mexico

Correspondence should be addressed to Adolfo Pimienta Acosta; pimienta331@hotmail.com

Received 17 September 2015; Accepted 6 January 2016

Academic Editor: Allan C. Peterson

Copyright 2016 A. Garca-Maynez and A. P. Acosta. This is an open access article distributed under the Creative Commons
Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is
properly cited.

The main purpose of this paper is to study the convergence properties of Generalized Fibonacci Sequences and the series of partial
sums associated with them. When the proper values of an real matrix are real and different, we give a necessary and sufficient
condition for the convergence of the matrix sequence , 2 , 3 , . . . to a matrix .

1. Introduction The so-called Golden ratio = (1 + 5)/2 appears in

nature very frequently. It is also considered the most esthetic
The Fibonacci Sequence ratio between the basis and height of a rectangle:

0, 1, 1, 2, 3, 5, 8, 13, 21, . . . (1)

1 + 5
is an interesting numerical sequence that occurs quite fre- = . (4)
quently in many parts of nature. This sequence has a special 2
feature; every element of this sequence, starting from the
third, is the sum of its two predecessors and can be generated
recursively by the formula If we replace the recursive formula by

+2 = + +1 . (2) 2+2 = + +1 , (5)

we obtain a new sequence 0, 1, 1/2, 3/4, 5/8, 11/16, 21/32, . . .

It is clear that we need the first two terms 0 = 0, 1 = 1 and
and this sequence is no longer divergent; in fact, it converges
the recursive formula to define the sequence.
to 2/3.
If we want to know the term without constructing the
To define a Generalized Fibonacci Sequence, we fix a
previous terms, we can use the unexplainable formula (see
natural number and two elements
[1]):
(0 , 1 , . . . , 1 ) ,
(6)
1 1 + 5 1 5
= [( ) ( ) ]. (3) (0 , 1 , . . . , 1 )
5 2 2
in the Euclidean space R . The recursive formula is
What do the irrational numbers 5 have to do with the
original sequence? + = 0 + 1 +1 + + 1 +1 . (7)
2 Journal of Applied Mathematics

The main purpose of this paper is to study the convergence where is the diagonal matrix:
properties of Generalized Fibonacci Sequences and the series
of partial sums associated with them. When the proper values 1 0 0
of an real matrix are real and different, we give a
0 2 0
necessary and sufficient condition for the convergence of the
=( . . .. ) . (12)
matrix sequence , , 2 , 3 , . . . to a matrix : we say .. .. d .
if for every ordered pair (, ), where , {1, 2, . . . , }, the
sequence of the (, )-entries of converges to the (, )- 0 0
entry of . As a particular case, we study when do we have
the convergence of the powers , 2 , 3 , . . . of a Moebius Proof. Let V1 , V2 , . . . , V R be the proper vectors of the
transformation to a constant function. matrix . We have then V = V for each = 1, 2, . . . , .
Then we would like to list the four published monographs If = V1 + V2 + + V and N, we have =
about generalized Fibonacci sequences [14] and several 1 V1 + 2 V2 + + V , = 0, 1, . . . , 1. Since || = 0,
more specialized articles [58]. we deduce that the vectors , , 2 , . . . , 1 are linearly
independent and hence they constitute a basis for R . Calling
2. Main Results B = {V1 , V2 , . . . V }, B = {, , . . . , 1 }, we have
= (, B , B). On the other hand, consider the linear
Consider a Generalized Fibonacci Sequence (GFS) with transformation : R R defined by the formula (V) =
initial terms 0 , 1 , . . . , 1 and recursive formula (7). Define V. Clearly,
the matrices :
= (, B , B ) . (13)
0 1 0 0
0 0 1 0 Therefore,
(. . . . .. )
=(
( .. .. .. ..
)
. ), = (, B , B )
0 0 0 1
= (, B , B) (, B, B) (, B, B ) (14)
(0 1 2 1 ) (8)
= 1 .
+1 +1
+1 +2 +
= ( .. .. .. .. ) , N {0} . In the next theorem, we relate and with .
. . . .
+1 + +22 Theorem 2. One has the following formulas:

The characteristic polynomial of the matrix is (a) = +1 and 0 = for every N.

(b) = 1 0 for every N.
() = 1 1 2 2 0 . (9)
Proof. (a) It is straightforward.
Suppose all the roots 1 , 2 , . . . , of () are real and (b) Using (36), we have
pairwise different; that is, = , for = . Consider
Vandermondes matrix:
= 0 = (1 ) 0 = 1 0 . (15)
1 1 1
1 2
( 2 ) Using the formula = 1 0 , we obtain any mem-
(
= ( 1 22 2 )
). (10) ber of the corresponding Generalized Fibonacci Sequence.
( )
.. .. .. ..
. . . . Theorem 3. Consider
1
( 1 1 1
2 )
1 2 0

Since || = 1< ( ), we deduce that || = 0 and, 1 1 1 0


hence, is invertible. We need the following matrix relation. (1)1
1 2 1 .
= (16)
|| . .. .. ..
Theorem 1. and are related by the following formula: .
. . d . .

1 1
1 = , (11) 1 2 1
1
Journal of Applied Mathematics 3

Proof. The first row of the matrix is the following: If we further assume that 0 = 0 and 1 = 1, we obtain
(1 , 2 , . . . , ). The first column of the matrix 1 0 is
1
= ( 2 ) . (22)
1 2 1
1 1
=1
( ) In the original Fibonacci sequence, we have
( )
(
1 (=1 2 1 )
) 0 1
( ), (17) =( )
|| (
( .
.. )
)
(23)
1 1
( )

1 and hence () = 2 1. The roots of this polynomial
( =1 ) are 1 = (1 + 5)/2 and 2 = (1 5)/2. We justify then the
mythical formula = (1/5)[((1 + 5)/2) ((1 5)/2) ].
where is the cofactor of the entry of in the (, ) In the case 0 = 1 = 1/2, we obtain
position. is the entry in the (1, 1) position of the matrix
. Therefore, 0 1
= (1 1) ,
1 [
= 1 1 1 + 2 2 1 + 2 2
|| (24)
[ =1 =1
1
(18) 1 1
2
() = 1 = .
1

+ 1 ] . 2 2
2 2
=1
]
The roots of () are 1 = 1 and 2 = 1/2. Hence, =
The expression inside the square brackets coincides with
(2/3)[1 (1/2) ]. It is now clear that this last GFS converges
0 to 2/3.
1 2
We give next a sufficient condition for the convergence of
1 1 1 0
the series of a GFS.

1 1 .
(1) 1 2
(19) Theorem 4 (main theorem). Suppose the roots of the charac-

.. .. .. .. .. teristic polynomial () of a GFS { } are pairwise different
. . . . .
and all of them lie in the open interval (1, 1). Then the series
1 1
1 1
1 2 of { } converges to
To see this, develop this determinant by the first row and the 1 1 1
0
last column. The coefficient of 1 is then 1 1
1
1 1 2
1 1 1 0
1 1 1 (1)1



1
2 1 . (25)
1 1 +1 ||
.. .. .. .. ..
.
.. .. .. .. .. .
. . . .
. . . . 1


1 1

1
1
2 1 1
(1)1 (1)+ 1
1 1
1 +1

+1 +1 +1 (20)
1 1 +1 +1

Proof. This is a consequence of the identity


..
. .. .. .. (1)1
. d . . 0 + 1 + + =
||
1 1
1 1 1
1 +1 1 + + 2 + + 1
1 1 1 1 + + 2 + + 1
0

1 1 1 0 (26)
= (1) .


1 1
This completes the proof.
.. .. .. ..
. . . .

In the particular case = 2, we obtain

1
1 1
1
0
2
1
1
= 1 1 . and the convergence
=0 to 1/(1 ).
0 (21)
2 1

1 2 1 We give now two examples.
4 Journal of Applied Mathematics

Example 5. One has = 3, 0 = 1 = 0, 2 = 1, 0 = 1/6, In this case, 0, but

1 = 1, and 2 = 11/6.
1 1 1
The characteristic polynomial () of the corresponding
1 1/2 1 1/3 1 2/3 0
GFS is

1 1 1 1 0
0 = 108 1

= 9.
1 2 (32)
1 = 3 11 2 + 1 2 0
() = 0
=1
3 3
1 11 6 6 1 1 4

1 (27) 1
6 6 4 9 9
1 1 Given different real numbers 1 , 2 , 2 , . . . , , we may
= ( 1) ( ) ( ) .
2 3 construct, for every (0 , 1 , . . . , 1 ) R , a GFS; namely,
Therefore, 1 = 1, 2 = 1/2, 3 = 1/3, and 0
1 2

1 1 0
1 1

1 1

(1)1
1 1 1 = 1 2 1 . (33)

|| = 1 2

3 = 18 . (28) 1< ( ) . .. .. ..
.
1 1 . . d . .
1
4 9 1 1
1 2 1 1


Hence
The missing sequence (0 , 1 , . . . , 1 ) may be obtained from
1 2 3 0
the coefficients of the polynomial:


1 1 1 0 () = ( 1 ) ( 2 ) ( ) .
(34)

= (1) (18) 1 1
31
1
2 3 0 For instance, 1 = 1 + 2 + + and 2 =
1 1
1< .
1 1
4 9 (29)
With the help of this remark, we prove the following.
1 2 3


1 1 1 Theorem 7. Let ( ) be an invertible matrix. Suppose the
= 18 . characteristic polynomial () of factors into the form:
1 1

1
2 3 () = ( 1 ) ( 2 ) ( ) , (35)

Clearly where 1 , 2 , . . . , are pairwise different real numbers. Let

() be the entry in the (, ) position of the matrix . Then
1 0 0


1 1 = 3. 2 0
18 1 (30) 1

1 1
1 1 1 (0)
1
2 3
1 2 (1)
(1)1
2
Example 6. One has = 3, 0 = 1 = 0, 2 = 1, 0 = () = . (36)
|| 1 22 2 (2)
1/18, 1 = 11/8, and 2 = 3/2. In this case, () = 3
.
.. .. .. .. ..
(3/2)2 + (11/18) 1/18 = ( 1/2)( 1/3)( 2/3). . . . .
Therefore, 1 = 1/2, 2 = 1/3, 3 = 2/3, and || = 1/108.
1
Hence, 1 1
2 (1)
(1)

1 1 2 Proof. Let ( ) be the GFS determined by (36). It is clear that

( ) ( ) ( ) 0
= () for 1. Proceeding by induction, suppose
2 3 3


1 1 1 0 = () for every , where 1. We clearly have

= 108 1 1 2 .
(31)
0
2
3 3 (+1) = (1() , 2() , . . . , () ) (1
(1) (1)
, 2 , . . . , (1) )
1
1 4 (37)
1 = 1() 1 + 2() 2 + + () .
4 9 9
Journal of Applied Mathematics 5

Be induction, the terms 1() , . . . , () may be obtained using Therefore

determinants of type (36). We consider the last columns of 0
determinants (36) and we obtain 1 2
1

1 1 1 ;
()
11 =
0 0 1 2

1 2
(0) (0)
( 1 ) ( 2 ) 0
( (1) ) ( (1) ) 1 2
( ) ( ) 1
1 ( 1 ) + 2 ( 2 ) + ()
12 = 1 1 0 ;
( ) ( )
1 2
( .
..
) ( .
..
)
1 2
(42)
0
(1) (1) 1 2
(1 ) (2 ) 1
()
21 = 1 1 0 ;
(38)
1 2
0
1 2
(1) 0
1 2
( )
( (2) ) () 1 1 1 1 ,
( ) 22 =
= ( ) . 1 2




( )
( . )
1 2
..

() where 1 = (1/2)[( + ) ( )2 + 4] and 2 =

( )
(1/2)[( + ) + ( )2 + 4]. If 1 = 1 and | 2 | < 1,
Therefore we have
2 0 1 2
1 ( ).
(43)
1 2 2
1 1 1 (1)


This limit matrix has determinant = 0. So in the case of a
1 2 (2)
(1)1 Moebius transformation

(+1) = 2 . (39)
|| 1
22 2 (3)
+
() = , = (44)
. .. .. .. .. +
.
. . . . .
we have the following corollary.

1 1 (1) ()
1 2
Corollary 8. If 1 is a proper value of the matrix = ( ) and
if | | < 1, then the powers converge to the constant
The GFS on the right side of this equation starts with 0 =
map () = ( 2 )/(1 2 ) = /(1 2 )( 2 ).
(1) , 1 = (2) , . . . , 1 = () and has the same proper values
of the GFS ( ). Hence (+1) = = +1 and the proof is
Conflict of Interests
complete.
The authors declare that there is no conflict of interests
regarding the publication of this paper.
As an exercise, we calculate the powers of a 2 2 matrix:

References
=( ), where = = 0. (40)
[1] A. F. Horadam, A generalized Fibonacci sequence, The Amer-
ican Mathematical Monthly, vol. 68, no. 5, pp. 455459, 1961.
(0) (0) (0) (0) [2] D. V. Jaiswal, On a generalized Fibonacci sequence, Labdev:
In this case we have 11 = 1, 12 = 0, 21 = 0, 22 = 1,
(1) (1) (1) (1) Journal of Science and Technology. Part A, vol. 7, pp. 6771, 1969.
11 = , 12 = , 21 = , 22 = . Hence [3] S. P. Pethe and C. N. Phadte, A generalized Fibonacci sequence,
Applications of Fibonacci Numbers, vol. 5, pp. 465472, 1992.
0
1 2 [4] D. A. Wolfram, Solving generalized Fibonacci recurrences,

1 (0)
The Fibonacci Quarterly, vol. 36, no. 2, pp. 129145, 1998.
() = 1 1 1 1 . (41) [5] G. Sburlati, Generalized Fibonacci sequences and linear con-
1 2

1 2 (1) gruences, The Fibonacci Quarterly, vol. 40, no. 5, pp. 446452,
2002.
6 Journal of Applied Mathematics

[6] G.-Y. Lee, S.-G. Lee, J.-S. Kim, and H.-K. Shin, The Binet for-
mula and representations of k-generalized Fibonacci numbers,
The Fibonacci Quarterly, vol. 39, no. 2, pp. 158164, 2001.
[7] G. Y. Lee, S. G. Lee, and H. G. Shin, On the k-generalized
Fibonacci matrix , Linear Algebra and Its Applications, vol.
251, pp. 7388, 1997.
[8] S. T. Klein, Combinatorial representation of generalized
Fibonacci numbers, The Fibonacci Quarterly, vol. 29, no. 2, pp.
124131, 1991.
Advances in Advances in Journal of Journal of
Operations Research
Hindawi Publishing Corporation
Decision Sciences
Hindawi Publishing Corporation
Applied Mathematics
Hindawi Publishing Corporation
Algebra
Hindawi Publishing Corporation
Probability and Statistics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

The Scientific International Journal of

World Journal
Hindawi Publishing Corporation
Differential Equations
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Submit your manuscripts at

http://www.hindawi.com

International Journal of Advances in

Combinatorics
Hindawi Publishing Corporation
Mathematical Physics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Journal of Journal of Mathematical Problems Abstract and Discrete Dynamics in

Complex Analysis
Hindawi Publishing Corporation
Mathematics
Hindawi Publishing Corporation
in Engineering
Hindawi Publishing Corporation
Applied Analysis
Hindawi Publishing Corporation
Nature and Society
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

International
Journal of Journal of
Mathematics and
Mathematical
Discrete Mathematics
Sciences

Journal of International Journal of Journal of

Hindawi Publishing Corporation Hindawi Publishing Corporation Volume 2014

http://www.hindawi.com
Function Spaces
Hindawi Publishing Corporation
Volume 2014 http://www.hindawi.com http://www.hindawi.com
Stochastic Analysis
Hindawi Publishing Corporation
Optimization
Hindawi Publishing Corporation
Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014