Академический Документы
Профессиональный Документы
Культура Документы
BROTHER U. A L F R E D
St. Mary's College, California
In the October* 1963 issue of this journal [l] , the author discussed some of the periodic properties of Fibonacci summations.
It
The
Fibonacci characteristics it
would be:
3 3
11
1214
l l
2214
2 I
4 2
3 2"
3 3
21
3 3
3 2
3224
325
5
5 3
5432
3 3
5 3
5Z34
53
5 6 - :L
855
8452
3 3
3 5
8254
8 55
136+86-]L
5
13 8
13482
3 3
13 8
13284
16
Z
86
; iV
1 6 - ]L
-] L
251
2412
- ]L
352
-]
151
13 8
of t h e f i r s t
p r o b l e m c a n b e c h a n g e d t o t h a t of e v a l u a t i n g t h r e e d e t e r m i n a n t s w i t h
f i r s t c o l u m n s a s i n d i c a t e d be low:
81
82
(2)
26
April
(3)
13
D e t e r m i n a n t (3) will be
24
23
22
342
4
5 3
4
8 5
4
13 8
3322
3223
5332
5233
5 3"
8352
8253
13 3 8 2
13 2 8 3
1
13 8'
5
5
13
This d e t e r m i n a n t is a s p e c i a l c a s e of the m o r e g e n e r a l d e t e r m i n a n t
in which the f i r s t row s t a r t s with any F i b o n a c c i n u m b e r w h a t s o e v e r
1964
OF FIBONACCI NUMBERS
4
F F. ,
F5
F?F?,
i l-l
5
F
* i+1
F3+1F2
F
i+1 i
1+1 1
4
F F
i+5 i+4
F
i+5
3 2
F F
i+5 i+4
F.
1 1-1
i l-l
83
i 1
*t
F2 F 3
i+1 i
F.
2
3
F F
i+5 i+4
4
F F
i+5 i+4
F5
1-
F5
1
5
F
i+4
tracting from this F . times the second column; then multiplying the
second column by F . , and subtracting from this
column; etc.
F . t i m e s the t h i r d
be as follows:
4
F
r+i<Fi-iFi+i
- w
f+2<Fi-lFi+2
.4
and so on.
/T_
i+3<Fi-lFi+3'.-
F F
'"
\Wijr2Ft+2..
i i+l)
^w
F F
i i+2)
lA
i ^4
"
i+3
F~, etc.
F, ,
An
84
ApriL
(F4)
|A |
1=1
In g e n e r a l , for a d e t e r m i n a n t of o r d e r
l^nlvn
n,
(F.)-
|Aa
| .
1=1
Fn-X .
In the p a r t i c u l a r c a s e of o r d e r six,
We d i s t i n g u i s h four
The
(ii)
These t e r m s will be e i t h e r a l l
1964
(iii)
O F FIBONACCI NUMBERS
The sign of
85
&z
is
row will be
r e p r e s e n t e d by
A
(k I k + 1)
n
'
the i m p l i c a t i o n being that the absolute value d o e s , not depend on the
p a r t i c u l a r F i b o n a c c i n u m b e r with which it s t a r t s .
When developing
The
86
April
the evaluation in which the order is changed from 9 to 3; in the s e c ond, the f a c t o r s r e s u l t i n g in reducing the determinant from order 8
to o r d e r 7; e t c ,
1
1
0
1
1
1
1
1
0
1
0
1
1
1
1
1
1
1
1
1
0
1 .
1
1
1
1
0
1
1
1
1
1
1
0
1
1
The sum of the quantities in any column gives the power of the F i b onacci n u m b e r in the determinant.
A9(3 | 4) = FJF^FJFJFJFJFJF, .
The s a m e r e s u l t would have been obtained if the gap had been after
the sixth row.
In g e n e r a l ,
after the kth . row or the (n~k)th row gives the same result.
The p a t t e r n o b s e r v e d is as follows: (1) A reduction of 2 in the
p o w e r s of F-. to F
inclusive (if k is l e s s than n-k); (2) A r e duction of 1 from F, M to F , inclusive; (3) No reduction therex
k+1
n-k
'
after. If n-k is l e s s than k, the roles of k and n-k are r e v e r s e d .
Finally,
i=l
FORMULA FOR n - k
A n*(k
k+1]
. , n-k
n F^1"1 n
1
i=k+l
Fn'\
1
LESS THAN k
k
n x l
i=l
F.
X
n
i=n-k+l
.,,
F n " 1+1
n
i=n-k+l
n
i=k+l
Ff-i+1
1964
O F FIBONACCI NUMBERS
87
A (n/2 | n/2+1)
,n-i-l
F
i=l
n
XI
. n,,
Fn-i+l
However,
for the
sake of convenience (in view of future c o n s i d e r a t i o n s ) and a s a p o s sible guide to r e a d e r s the r e s u l t s for o r d e r s 12 and 13 a r e set down
in d e t a i l .
Since, h o w e v e r ,
t h e r e is s y m m e t r y in k and n - k
only
k+1)
F
10
10
10
10
11
10
10
10
10
12
TABLE OF A 1 3 ( k | k+1)
k
1
F,
Fn
11
10
10
10
10
1.0
10
10
9
9
9
9
11
10
12
9
9
9
13
The a p p r o a c h
The r e s u l t s for
88
a l l values of n,
April
4r
4r+l
4r+2
i odd
4r+2
i even
4r+3
i odd
+
+
+
'+
~,
4r+3
i even
-
BPD
l
5
F's
(1)
5
1
1
3
1
2
F o r the sixth o r d e r ,
The p a t t e r n i s a s follows:
F,
BPD
r-3
F's
(2)
5
1
1964
O F FIBONACCI NUMBERS
89
We shall d e s i g -
(k = 1); C with
i
3
(negative)
7
(positive)
F
3
F
3
F
2
F
1
F
1
F,
1
2
1
1
(positive)
(negative)
1
1
(negative)
90
April
(positive
(1)
(2)
+
+
3'
F
1
10
(1)
10
F
^13
12
(2)
10
10
6
6
9
9
9
9
3
4
1964
O F FIBONACCI NUMBERS
Sign
H
I
+
+
9
9
9
9
9
10
10
.+
10
F?
6
6
9
9
9
9
6
6
6
6
6
6
6
6
91
F
12
- 11
2
3
4
4
5
5
5
F
Mo
13
1
2
2
3
3
"2,
2
1
1
1
E and F; D
T h e r e f o r e , the
d e r s 4, 8, and 16.
DETERMINANT OF ORDER 1!
Sign
(1)
(2).
+
+
11
11
11
10
10
+
+
10
10
10
+
+
10
H
I
10
10
11
'+
11
L
M
10
11
10 9
10 9
6 F?
10
ll F
'4
F
12
13
1
1
1
'
10 9
10 9
'2'"
3
9
9
9
9
9
9
9
3' ' \2
1 '
6' 5
1
1
9
10 9
10 9
5
4
4
4
3
3
6
6
6
l'
3
2
2
i
2 . 1
10 9
10 9
8
8
7
7
6
6
5
5
4
4
3
3
,2
2
92
April
following t a b l e .
Sign
9
9
(1), L
B, J
3
12
11
10
D, H
11
10
9
9
4
10
10
11
12
13
14
F4
F5
F6
F?
FQ
F()
F^
12
13
14
combining t h e m and
F o r t u n a t e l y , a s the n u m b e r s to be f a c t o r e d i n c r e a s e d
in size going up to 23 digits in one i n s t a n c e , a p a t t e r n involving F i b onacci and Lucas n u m b e r s w a s d i s c o v e r e d with the r e s u l t that the
f o r m u l a s (1) and (2) on page 38 of [l] w e r e d i s c o v e r e d .
The m a t t e r can be allowed to r e s t h e r e .
The path p u r s u e d h a s
xxxxxxxxxxxxxxxxxxxx
1.
INTRODUCTION
The m a i n p o i n t of this p a p e r is to display some i n t e r e s t i n g p r o p e r t i e s o f t h e (n+1) X (n+1) m a t r i x P
defined by imbedding P a s c a l ' s
t r i a n g l e in a s q u a r e m a t r i x :
0 0 0 1
0 0
11
0 12
P
(1.1)
The m a t r i x P
13
3 1
to evaluate a d e t e r m i n a n t p r e s e n t e d by B r o t h e r U. Alfred.
The d e -
THE PROBLEM:
Evaluate the fifth o r d e r d e t e r m i n a n t
5
+ 1 - ]1
141
I3 I2
1213
5
5
L
2 + 1 - 1
5
5
3 + 2 - ]I
241
2312
2213
342
3322
3223
- .L
543
5332
5233
5
5
8 D + 5 - .L
845
8352
8253
(2.1)
+ 3
94
April
,,
n+1
and
and the
in the l a s t row, w h e r e
d e t e r m i n a n t would extend
u
to
is the n - t h F i b o n a c c i n u m -
ber:
u
n+1
(2.2)
+ u
n
with
,
n- i
u;
0
0, u ,
T h e - d e t e r m i n a n t (2. 1), w h i c h w e w i l l c a l l . D_
(D
in generaL),
w i l l be e v a l u a t e d a s a n e x p a n s i o n of c o f a c t o r s of t h e f i r s t c o l u m n . In
o r d e r to k e e p t r a c k of t e r m s i n t h e e x p a n s i o n it i s c o n v e n i e n t t o d e fine D
f o r a n a r b i t r a r y s e q u e n c e a a. , ' a~, . . . . a ,'
by a p J
r
n
0
1 2
n+1
p r o p r i a t e l y p l a c i n g t h e m e m b e r s of t h i s s e q u e n c e i n t h e f i r s t c o l u m n
of
D :
D 5 {a}
(2.3)
4 '
1i
For
a,
i4i
ar
,5
1 5
u a } - 1 aQ
ar ~
C l e a r l y (2. 1) i s
,J
a,
D r {a} w i t h
241
a^
4
3 2
4
5 3
a,r
845
a n = a, = a~ = . . . = a , = - 1.
s i m p l i c i t y w e w i l l c o n t e n t o u r s e l v e s w i t h t h e r e d u c t i o n of
t h e fifth o r d e r d e t e r m i n a n t
(2. 3) w h i l e m e n t i o n i n g t h e c o r r e s p o n d i n g
r e s u l t s for the g e n e r a l c a s e .
T h e r e d u c t i o n r e s t s on t h e g r o u n d w o r k
of B r o t h e r U* Alfred,,
THE SOLUTION:
B a s i c to t h e r e d a c t i o n i s t h e d e t e r m i n a n t of t h e f o l l o w i n g m a t r i x :
r 4
A
2 ~~
(2.4)
Br
\ .J
\ .4
j 8~
i 3 .i
I2!2
3
2 1
2212
? ?
3 2
5232
3 2
3
5 3
3
8 5
8 5
il
1964
TRIANGLE IN A MATRIX
95
ni
notes the f i r s t row e n t r i e s a s u. ,, and u..
i+l
i
An i n t e r e s t i n g p r o p e r t y of the d e t e r m i n a n t of B - . is that its
D j J.
i.
This fact
(2.5)
where
(2.6)
Since
the d e t e r m i n a n t of Q . is 1 we have
1
5, i '
5, i+l
M o r e p r e c i s e l y we can develop
l,
(2.7)
IQ,
Q
'n- 1
-i,
lQ 2 h
1,
(-i) n ( n - l ) / 2
(2.8)
But
5,0Q4=B5,i
96
April
B5,0
i3i
231
221
3
5^ 3
1 1*
? 2
5- 1
P a s s i n g to d e t e r m i n a n t s w e h a v e
* 5 f i -= - Q4, '
where
B^ ~
D,
.B
- 5c i 0 l
t-l)
1 0 i
l-
2 - 3 - 5
h a s b e e n e x p a n d e d byJ c o f a c t o r s
0 '
|B . |
|B4>i
of i t s f i r s t r o w a n d
Having established a r e -
the g e n e r a l f o r m u l a
maybe
shown:
1B
. = (-1)
v
m'
where
, u
u
.
n - 1 n - 20
n-3
n-2
s = n(n-l)(3i + n-2)/6 .
In a n o t a t i o n w h i c h w i l l b e m o r e c o n v e n i e n t t o u s e , w e d e f i n e
S
= 1,
S ,. = N( - l ) n S
n+1
'
n
F~(x)
=1,
0V '
W (x) = F
(F(x))
for
. . (x) = x . . F v(x)
n+1
n+1 n
n > 0
f o r a n yJ s e q u e n c e / x )
^
^ n>
Then
(2.9)
Q .-l
= S
and
n
IB .1 = S 1 - 1 F (S)W , (u)
' ni'
n
n
n-1
Let us s e e w h a t p r o g r e s s c a n be m a d e with
|Dn |
W r i t i n g ( 2 . 3) a s
t h r e e s e p a r a t e d e t e r m i n a n t s on t h e f i r s t c o l u m n w e h a v e ,
symbolically,
1964
(2.10)
TRIANGLE IN A MATRIX
97
D 5 {a)
third becomes
D.H
Hence
"al
lB5,l
(2.11)
.{a) =
April
( 1 - 2 - 5 - 8 ) ' (I 8 1- 3-5)a.
(2. 12)
I2 1
?
Z 1
^3
the m i n o r being s i m i l a r to
ing.
82 5
1 I2
2
2 \L
I3
3
1*
32
33
8 52
53
Starting with
BJ 5. , I
n3
0
B
2. 13)
5, 1
u ,
3
-2
u ,
2
131
n2
~l
2 1
-l
-2
0 u"
1 0"
4~1
u_2l
-1
4
1 1
22 I 2
2 r
1"
, = u ,, - u . Expanding the d e t e r m i -
|B5>1i
|Q4I"3= ( - u V ^ u ^ H i ^
u2)|B4(_2|
where
u
(2.15)
B4,-2
3
-l
2
-l
n2
-2
-l
2
-2
3
~2
0 u__,
. . 2
0 u ,
3
u^ 1
3
1 .
2
1 0
1* 1
2
1-0
1 . I2
3
0J
l3
1964
TRIANGLE IN A-MATRIX
99
< 2 - l6 >
P a s s i n g to d e t e r m i n a n t s ,
4,i'
l-2Q3 =
ll
-i
and evaluating the known d e t e r m i n a n t s ^
W U)
, 3 .
12
^
l
;
V
I B 4! , 1, ' | = (-1)
-S- S.
"5
3 F,(S)
4 ' F2(u)F^(u)
(2. 17)
\Bl J = ( - D n r S n + 1 S r F n (S)
W (u)
r-1
- ^
n+1 -r(u)
S ,, S = S ,,
n+1 r
n+l-r
and
W (u)
F (u)
vu;
F~~T(u)
F nx+l l - r xTuT "- Wn - l,{u)
F r - 1. (TITF77T5T
r-lx
n+l-r
It s e e m s a.rr
p p r o pr r i a t e , since F \(u)/ = u un - I , un - 2 - . . . u2. u1, is
n
n
a f a c t o r i a l type p r o d u c t for the ssequence / u }* that we define the
s p e c i a l i z e d "binomial coefficient"
100
April
m F M V. W = '.M-'-t:]-'
n-4x
We t h e n h a v e
| B r , | = F (S) W AM) S , ,
f n1] .
1
x
v
n, 1 '
n '
n - l ' n + l - r L^-IJ
T h e r e m a i n i n g d e t e r m i n a n t of (2. 10) m a y n o w b e e x p a n d e d , a n d t h e
general case h a s the form
n+1
F J_1 (u)
F (u)
S (-l) r a r J^LL^LL
U
U
r=2
r-1
'
r
|B
1 J
n
l l
~ '
or
F
, ( S ) W %(u)
n-1
n '
n+1
S
r=2
v(-I)
'
"
S ,,
[~n M a
n+l-r L r J r
T h e f i r s t t w o d e t e r m i n a n t s (2. 11) r o u n d o u t t h e s u m m a t i o n n i c e l y f o r
k=l
a n d 2, s o that w e c a n s t a t e
D v{a} = F . ( S ) W x(u)
n >
n-P
n '
or,
n+1
2
r=0
( - l ) r S ,.
n+l-r
summing backwards^
(2.18)
Dn{a} M - i r
F n _ l ( S ) Wn(u)
"z
r=0
(-l)rSr f ^
At this point w e c o n s i d e r t h e s u m m a t i o n
/:>
T
1 a
L r J
r
1QX
(2. 19)
{a} =
n v/
n+1
2
( - l ) r S ["
l a ,.
_0
r L r J n+l-r
(2.20)
n ( x )
z
r=0
1 }
[n+ljxa+l-r
] an+1.
1964
TRIANGLE IN A MATRIX
101
(2.22)
where
= a
+b
where a
- a - 1= b
- b - 1 =0
<ab)n"1
( x - a n ) ( x - b n ) 0 n _ 2 (x/ab) ,
and we can c o n s t r u c t
0 (x) =
n
The evaluation of
(2. 18). and (2. 19),
D n {a}
for
n
n
(x-a b
r =0
) .
a Q = 3L^ = . . . = - 1
b e c o m e s , from
102
F I B O N A C C I P O W E R S and P A S C A L ' S
(2.24)
D (a) = (-1)
n l '
The
evaluation
F AS) W (u) 0 ( 1 )
n-1
n
n
of 0 (1)
requires
separate c a s e s ,
(2.25)
n
?
XI ( l - ( - l ) n " r a
r=0
0(1)=
n
the
April
investigation
of four
b = - l/a
)= 0
if and o n l y i f n = 4k
0n(x) = (i+x)
(x + ( - i ) r v 2 r + i)
r=l
and
0n(l) = 2
n/2
n
r=l
(v2r + 2(-l)r) .
U s i n g the w e l l k n o w n r e l a t i o n
(2. 26)
For
0 (1) = 2
n
2
v_ = v ?
n/2
7
II v "
, r
r= 1
when
r
+ 2(-l)
we have
n = 4k + 2 .
n = 4k 1 w e h a v e , f r o m (2, 22)
*n(x) =
2
II
r=0
( x Z - ( - l ) r + 1 v 2 r + 1 x - 1) ,
when
n = 4k - 1
( x 2 + ( - l ) r + 1 v 2 r + 1 x - 1) ,
when
n = 4k + 1
n-1
0 (x) =
n
r=0
s o that
2 27
< '
>
n--1
"~2~~
^ >
2k-1
n
" ^^Zr-l^Zk-l
n
r=0
r=0
when
n = 4k - 1
2r+1
'
1964
TRIANGLE IN A MATRIX
103
n-1
T"
,,
2k
r
0 ( i , , n (-D v 2 r + 1 = s 2 k + 1 n
(2.28)
r=0
when
Combining (2. 25),
v2r+1
r=0
(2* 26),
n = 4k 4- 1 .
(2. 27),
sign convention
= (-i) 1 ^ 1 1 " 1 )/ 2
and
F (S) = -1
only when
n = 4k + 2 ,
we have
D
4k=>
2 k
k
D
4k + 1
4k+l< >
2r+1 ,
r=0
2k-1
k
D
4k-1
= (
l)
4k-l
(u)
2r+1 ,
r=0
2k-1
D
4k + 2
= 2 W
4k-2< >
n
r=0
r+1 f
/ v
n n-1 n~2
2
W W = u u
u~
... u , u =
n
1 2
3
n-1 n
_
II
,
r=l
n+l-r
u
r
REFERENCES
1.
Brother U. Alfred, Periodic properties of Fibonacci summations, Fibonacci Quarterly, 1(1963), No, 3, pp. 33-42.
Continued next issue.
xxxxxxxxxxxxxxxxxxxx
April
104
FIBONACCI GEOMETRY
H. E. Huntley
Below a r e s o m e additional o b s e r v a t i o n s about H u n t e r ' s
article.
w+z-jL_JL_E
[1]
.- -- 5
If the r e c t a n g l e A B C D h a s a t r i a n g l e /
D P P ' i n s c r i b e d within it so that
AAPD
= V|
(i)
(ii)
2 2
.
.*.w -z = wz, l. e. ,
F r o m (i)
(iii)
2
2
w -wz-z = 0
+ V7+4z
^>z
~ = *P or y = ^?x
beloved of the
TfT+?]
J ( ^ 2 z 2 + / z 2 ) = i / z 2 ( ^ 2 + l ) = iz2(^+l)(^+2)=iz2(4^+3)
we m a y conclude, t h e r e f o r e , that if the r e c t a n g l e is the Golden R e c tangle, that i s , if its adjacent sides a r e in the Golden Ratio, <p, then
the i n s c r i b e d t r i a n g l e is r i g h t - a n g l e d and i s o s c e l e s , the length of the
equal sides being z "w4^+3 .
E d i t o r i a l Note: P P 1 1(1 AC
1.
REFERENCES
Jo A. H. Hunter, " T r i a n g l e I n s c r i b e d in a R e c t a n g l e " 1(1963) Oct o b e r , pg. 66,
n
X F , , , where
, ,
ak-b
k=l
a > b a r e positive i n t e g e r s and F, a r e Fibonacci n u m b e r s with
F nu = 0, F ,1 = 1, and F n+2
. 0 = Fn+1
In this note,
(1 + F , n = 0, 1, . . . .
n
we will e s t a b l i s h a m o r e g e n e r a l s u m m a t i o n formula which yields the
Recently, Siler [ l ] gave a closed form for
'
r e s u l t of [ l ] a s a s p e c i a l c a s e .
G e n e r a l s u m m a t i o n f o r m u l a s for F i b -
Let p, q, u * and u,
be a r b i t r a r y r e a l n u m b e r s ,
and Let
(i)
n+2
n+1
pun
(n = 0, 1, . . . ) ,
n . n
S = r + r
(n= 0 , 1 , . . . ) ,
1
2
n
2
2
w h e r e r , / r~ a r e r o o t s of x - qx + p = 0 (i. e. , q - 4p / 0). We define
(2)
(3)
u_n = (uQSn - u n ) / p n
(n= 1 , 2 . . . . . ) ,
(4)
(n= 1,2, . . . ) .
-n=Sn/pn
, a 2.
x + rp x )
v
2
in
k=
(5)
- x
u , ,,x
ak+d
Then
a n+2
= rp x
u . j
an+d
uan+a+d
, , -j + xu a+d
, j + x(1-xSa ) ud,
M o r e o v e r , in the r e g i o n of c o n v e r g e n c e , we have
a 2 ' *
k
(1-Sax+P x ) S uak+dx =ud + (ua+d- u d S a ) x
(6)
k=0
l
n
1 1
2 Z
n = 0, 1, . . . , is the g e n e r a l solution of (1). Then
v
k = u ak+d
(Clrl)(rl)k
<C2r2)(r2)k '
k = 0, 1, . . . ,
106
ON S U M M A T I O N F O R M U L A S F O R F I B O N A C C I
<7>
s i n c e (x
k+2 =
aVk+l "P^k
(*=0,1....)
- S o x + p ) = (x - ^ ( x - r ^ ) .
a
V x
. k=0
M u l t i p l y i n g b o t h s i d e s of (7) by x
k+2
k3 w e o b t a i n
T .0
n
kfZ
_ .
v
= x &
k,Z0 Vk+2X
a = V k + l
r e s p e c t to
n
<>
Let
g(x) =
April
, .,
k+1
a 2
- P
n
v
,*
k=0
,.
. k
kX
'
k=0
We n o t e t h a t
x
,~,
(9)
k+2
^
vk+2x
k= 0
(10)
=
k=0
k+lX
If w e s u b s t i t u t e
, , .
=gWtv
x ) + V
6 + 2
n+2 .
n+1
x.
-v
+ v n + 1 x
n+l
for
|x|<R^ v x
Remarks.
-v
s
k=0
v,
V
?s
(5).
c o n v e r g e s for
n->c&<.Thus, for
|x|<R.
Then, f o r u n = 0 a n d u , = 1, w e
~ F , F
= (-1)
F , and S = L , the well-known
n
n
-n
n
n
n
s e q u e n c e , w h e r e L n = 2 a n d L, = 1.
T h u s , (5) a n d (6), f o r u
become, respectively,
(x 1 - L x + ( - l ) a x 2 ) F . , , x k = ( - i ) a x n + 2 F
,,
a
i n
ak+d
an+d
k=0
-x
(12)
n+1
, , , + x F , , + ( 1 - x L ) F , .,
an+a+d
a+d
a d
(1-Lax + (-l)ax2)
Tiien,
have u
(11)
and
i s r e a d i l y o b t a i n e d f r o m (5).
L- X
L e t q = 1 a n d p = - 1 in (1).
0 *
s o l v e f o r g(x), w e o b t a i n o u r p r i n c i p a l r e s u l t ,
Let
l X
~
Fak+dxk = Fd + (Fa+d - FdLa)x
k=0
Lucas
= F ,
1964
107
(13)
K-U
+
<-1)nFan+a4d-Fa+d
<La+1)Fd "
F o r d = 0, (12) yields
(l-Lax + (-l)ax2)
(14)
T Fakxk= Fax.,k=Q
( a = 0 , 1 / . ...) .
(16)
x
~ '
z Lak+dxk= ("Daxn+2L
k=0
- ^n+1Lan+a+d
4- x L a+d
_ + (x l - x L a' ) dW
( 1 - L x + x( - l ); a x 2 ) IT L , , , x k = L , + x(L , , - L L , ) x .
*
a
i r* ak+d
d
a+d
a d'
k=0
REFERENCES
1.
Ken Siler, F i b o n a c c i s u m m a t i o n s , Fibonacci Q u a r t e r l y , Vol. 1,
No. 3, October 1963, pp. .67-69..
xxxxxxxxxxxxxxxxxxxx
108
LETTER TO THE EDITOR
The Editor,
Fibonacci Quarterly.
Dear Dr0 Hoggatt,
I refer to the article, "Dying Rabbit Problem Revived" in the December
1963 issue. The solution given there is patently wrong if only because the alleged number of rabbits tends to minus infinity as n tend
to infinity. It may easily be shown that the correct answer, X , is
given by the recurrence relation
X n o = X ., ~ T X _ . - X
n+13
n+12
ntl 1
n
X, 0 = 232 .
12
2
13
12
In view of the fact that the two equations z - z - 1 = 0 and z
- z
- z** + 1 = 0 have no common root, it is clear that the answer can
never be expressed simply as a-linear expression in Fibonacci and
Lucas numbers whose coefficients are merely polynomials i n n . For,
any such expression, Y, where the highest power of n which occurs is
n m , satisfies
(E 2 - E - l ) m + 1 Y = 0 .
In particular the expression found by Bro. Alfred satisfies
(E 2 - E - I ) 2 Y = 0 .
The error made by Bro. Alfred stems from his table on p. 54 where
the number of dying rabbits in the (n+13)th month is seen to be F for
n = 1, 2, . . . 11 and it is then assumed without proof that this is true for
other values of n. In fact the very next but one value on n, namely
n = 13 shows that this is false. In fact of course the number of dying
rabbits in the (n+13)th month equals the number of bred rabbits in the
(n+l)th month, and this will be less than F for all n exceeding 12.
Yours sincerely,
(John H. E. Cohn)
BEDFORD COLLEGE
(University of London)
INTRODUCTION
An old conjecture about Fibonacci n u m b e r s is that 0, 1 and 144
a r e the only p e r f e c t s q u a r e s .
Recently t h e r e a p p e a r e d a r e p o r t that
This is not s u r p r i s i n g ,
The
referred
I might
Of c o u r s e the F i b -
onacci c a s e is s i m p l y D = 5.
PRELIMINARIES
In the f i r s t p l a c e ,
onacci Q u a r t e r l y ,
n-th.
I h e r e u s e the s y m b o l s
and
to denote the
F i b o n a c c i and Lucas n u m b e r r e s p e c t i v e l y ; in o t h s r p a p e r s I
if l e s s logical, notation u
n, m, k will denote i n t e g e r s ,
not
Also,
We shall then r e q u i r e
the following
formulae,
elementary
(1)
x
'
and v
2F
, = F L + F L
m+n
mn - n ~ - m
109
all of which a r e
HO
(2)
2 L , = 5 F F + L L
m+n
m n
m n
(3)
L0 ' = L2 + (-I)"1 2
2m
m
(4)
(F-
, L.
) = 2
(5)
( F , L ) = 1 if
(6)
2 L
1
(7)
3>n
if a n d o n l y if
. J
3 L
'
F_n=(~-Dn-1Fn
(9)
v
'
< 12 >
(13)
,
= - L
m + 20k1 " " . . m
a+2k= m +
Lk=3.(mod4)
L
= (-l)nL
-n
(10)
3 m
'
if a n d o n l y if m = 2 ( m o d 4)
m
(8)
(11)
V. '
April
1 2 ^
if
2'|k,
3 ^
( m o d L. )
.
k
k>
^md8)
THE MAIN T H E O R E M S
T h e o r e m 1.
If
= x
then
n = 1 or 3.
Proof.
If n
i s e v e n , (3) g i v e s
= y2 2 / x2
L
n
If 115 1 ( m o d 4 ) , t h e n L , = 1, w h e r e a s if n & 1 w e c a n w r i t e n = 1 +
r
2* 3 # k w h e r e k h a s t h e r e q u i r e d p r o p e r t i e s , a n d t h e n o b t a i n b y (11)
L
and so
2
Ln^x^
since
=. - Li = - 1 ( m o d L, )
- l i s
a n o n - r e s i d u e of
L^. by ( 1 0 ) .
Finally,
1964
Ill
-?
= - 4 (mod Lj-^)
and again
&
L / x .
n
This concludes the proof of T h e o r e m 3.
T h e o r e m 2.
2
If L = 2x , then n = 0 or 6.
n
Proof.
If n is odd and L is even, then by (6) n = 3 (mod 12) and
so, using (13) and (9),.
L
= 4 (mod 8)
and so
L ^ 2x .
n
Secondly, if n = 0 (mod 4), then n = 0 gives
r
if n ^ O , n = 2 * 3 k and so
2L
= - 2L
2L / y
n
2
, i . e .
L ^ 2x
n
2
L, - 2 3
whereas
and again,
a s before
= 2, w h e r e a s
= ~ 4 (mod L, )
k'
2
whence
= - 2Lx = - 36 (mod L, )
o
k
- 36 is a n o n - r e s i d u e of
L
n
Finally,
L,
Thus
^ 2x".
if n =. 2
= L
w h e r e now
11= - 6 .
112
April
Theorem 3.
If
Proof.
If n = 1 (mod 4), then n. = 1 gives
r
n = 1 + 2e 3 k and so
F
whence
F, = 1, whereas if n / 1,
= - F, = - 1 (mod L, )
1
k'
= 2x Z , then n = 0, 3 or 6.
Proof.
If n = 3 (mod 4), then n = 3 gives
F~ = 2, whereas if n ^ 3,
n = 3 + 2" 3 * k and so
2F
and so F
get
B
only
y
= - 2 F a = -4
3
(mod L, )
k
must have if
F.
If
is
even,
then
since
= F
and we
-n
n
F = F,
L
we
n
i/2n y2n
= 2x
2
= y ,
/2n
2
F
L,
= 2z ; then by Theorems 2 and 3 we
i/2n
i/2n
see that the only value which satisfies both of these is y2n - 0
2
2
or
F
= 2y ,
L
= z ; then by Theorem 1, the second
J
3
i/2n
i/2n
'
either
1964
1.13
REFERENCES
1.
M. Wunderlich,
On the n o n - e x i s t e n c e of Fibonacci S q u a r e s ,
J. H. E, Cohn,
On Square Fibonacci N u m b e r s ,
Proc.
Lond.
G. H. H a r d y and E. M. Wright, Introduction to Theory of Numb e r s , 3rd. Edition, O. U. P . 1954, p. 148 et seq.
XXXXXXXXXXXK< KXXXXXX
EDITORIAL NOTE
B r o t h e r U. Alfred cheerfully acknowledges the p r i o r i t y of the
e s s e n t i a l method, u s e d in " L u c a s S q u a r e s " in the last i s s u e of the
Fibonacci Quarterly Journal,
This
114
April
+']=[!]
F~ + F , + F , + . , . + F~ = F~ , 1 - 1
Z
4
6
Zn
2n+l
and that P 0 + F r + F + . . . + 'B\ , = F n - 1. The proof of the f i r s t
3
D
{
In-1
Zn
p a r t of this is given by induction and the second p a r t is s i m i l a r l y p r o v e d .
Proof,
J
F o r n = 1, we have P 7 = \ - 1
n = 2, we have F ? + F . = F r - 1 which c l e a r l y shows the L e m m a
holds for 11 = 1, 2ff,
Now a s s u m e that it holds for a i l n <. K? w h e r e K is a fixed but u n specified positive i n t e g e r g r e a t e r than or equal to 3.
i . e . P.^ + F , + . . . + F \ _ = F T , . . - 1, t h e r e f o r e by addition to both '
2
4
ZK
2K+1
sides we have that F n + F" + . . . + F-,,- + F,,,T7.,.., = F~ _ _,v + F O T f ..^ - T"
2
4
2K
ZK+2
2K+1
ZK+Z
= F
- 1
M
2K+3
which i m p l i e s the L e m m a holds for a l l positive n,
Using this Lemm-* which we shall c.?U L e m m a 1, p a H A ion the
f i r s t c a r t whica was last proved, arid p a r t B for the second p a r t with
the odd \ n d i c e s ; we c-,n now prove the g e n e r a l t h e o r e m that for
F < N . I F ., , we car. r e p r e s e n t N es a s\im o at l e a s t a l t e r n a t i n g
rj
n M"
'
a
n+I
t r i v i a i l v is iu;'t F . , iC^eLf when IN - F . .
n+J
nid
Proof. F o r N - i ,' we have 1 - f\2' aiulior N = 2 we have 2 = F o3s Now
a s s u m e the t h e o r e m t r u e for a l l M <. k where- k i H a fixed but unspecified
positive i n t e g e r and n is such that F < k 5. P . , , n > 3*
n
n+1
Now if
PARTITION ^NUMLI'AM'^ l\
v irA^$
D'^Uk
i
GeoiMG in i .<* il ,
i ILLL CR
r u l t v " , #,< , n t a / G c .
p m o n i l o i s , . ' oi- . t i c
of these range-
Properties
13 Mv-, d >^
of both lyp^s of
partitions.
2.
To u &,
P t - J1.
-- "> -, ,
rO
e n u m e r a t i o n o 1 p a r t i ! io "> ^ o T ^ . u
elusive, no partition ba " j e. t
each member being not >^-i
spe m e s tJtie
11 tc n v in-
.'an
1 .H m ire than q ? .
rio^' = v e i ,
- ; :^-> " 3 - / ,
V is appended
P ^ i ^ n ^ <r.n^ | ^ p l f 4 p J
=^qi , 4q ? ) denotes the 5 ^t oi ,< -i ior. " ' u v ^ g rbe properties of the
enumeration counterpar c,
The existence cu^/'jLioor t ^
q p , 4 n ^ simultaneous I -y.
Mc; *
'
Brackets [ J except W J ^ I P o r r c
1
Heaslet [3] .
1 * rt )jt.
V=pr
f[
2p2^nr
i l iese a re
0 ? t-ai
^ integer
116
(1)
P l opt_
W
If
p,
P2 opt.
ApriL
= " [-(n/q^l .
= [
Vql
to p ?
, but if p
Lt O p t .
p7
, p
cannot be changed.
&
tit O p t .
Ct
the
p, -member
partitions are
set is as follows:
p q, ' s .
If the sum of
n?
(or both).
in n, .
members
adding one to the member second from the right and replacing all
members to the rightwith the new value of the changed member.
The
desired reinitiating partition is found from the sum of the p members, as before.
third member from the right and the process repeated all over again.
Eventually, all p-mernber
ample for
2.6
2.7
3,5
3, 6
3,7
4.4
4.5
4, 6
5,5
2,2,4
2,2,5
2,2,6
2, 3, 3
2,3,4
2,3,5
2,4,4
3, 3, 3
3,3,4
2,2,2,2
2,2,2,3
2,2,2,4
2, 2, 3, 3
2,2,2,2,2
An ex-
1964
OF SIMPLER PARTITIONS
3.
117
P(n|p|<q)
of the parti-
simultaneously.
In the terminology of
this paper,
(3)
where
P(n|p|<q)
ta = 0 , 1 ,
S [ i ( n - p + 2 - 3 t r 4 t 2 - . . . -pt
~ j*y
2)]
typical term is
n-p+2-w
(4)
ta - 0, always 3 for
t ' s.
= 1, and al-
P(n|p|<q)
(5)
(6)
p = 1,
P(n|p|<q) =
n-p+2
2
n-p+2-w.
+ 2
i
(n-p)<3.
(7)
p = 2, and/or
P(n 11 I <q) = 1
118
P A R T I T I O N E N U M E R A T I O N BY M E A N S
Vs w a s s t a t e d f a i b ^ ,
(n
ru^lu^
risscxihtd
April
To ilias end ? t h e a u t h o r
cars s u p p l y -d i i m i t e a u r a b c r *. " I ^ O S U n g u a g e p r o g r a m s a n d t e s t
e x e m p l a r s for e n u m e i d L n ^ h i h l JS
with t h e B u r r o u g h s ZZO d i g i t a l
computer*
ft1] P E R B" 11C D 3
1.
2..
G, C h r y s t a l ,
T ^ U J O O ! ^ 2LJ*JeL!S"
Publishing Co.,
3
"'*
2j
(Reprint)
Mo^ v i K, i ;b^
I ler^ntaxy
Number
x 1% 1 9 3 9 , p p . 9 4 - 9 9 .
xxxxxxxxxxxxxxxxxxx*
i ^ M I ^ J I P L V : 1 1P-JLI^LLM gJ.A._TJ-Q._3
P a g e 44;
On l i n e 4 r e s d "0 ^ k ; ^
P a g e 4-9;
On l i n e 8 :>:id \i\ir
P a g e 80:
In B - 7 l i n e 2 x = 1/4
VV
and
I
J or
s Tri2 / 4 i
L2
i ^ O ^ i ^ ~ 25
'
Chelsea
H i e i i r i a u t h o r :,- i^v^L^cLVJJN ,
(i, j = 1, 2, 3 , 4 )
Theory,
k
k
k
S, = x " + x'~ + . . . Jr x' u m a yJ be e xlp r e s s e d in
k
I
2
n
t e r m s of e l e m e n t a r y s y m m e t r i c functions or in t e r m s of the coefficients
Sums of rp o w e r s
of:
f(x) = (x-x, )(x--x 9 ) . . . (x-x ) = x'"+p,x ' " + . . +p^
J.JL
i^i
A,
XX
S,
where
k = 1,
k.
2, 3. . . , f i r s t c o n s i d e r the q u a d r a t i c
2
x"
(1)
If we denote the r o o t s by a
(2)
px
q = 0 .
x " + px + q = (x~a)(x--/3) ,
After m a k i n g the t r a n s f o r m a t i o n
x = 1/y
obtain^
(3)
I + py + qy" = (1-ay){l-/3y)
120
A N O T E ON WARING'S F O R M U L A F O R SUMS
April
Equations,
k+1
_,_ 2 ,
, k k - 1 , <*
k
-=a+o: y +. . . +a y
+ - y
J
1-ay
^
1-ay 7
a
(5)
N
'
and
k+1
(7)
v
'
T^
1-r
k-1
2
. n
series
rJ + 1
1-r
J=0
for e x a m p l e ,
l e t r = a y a n d m u l t i p l y b y a . A d d i t i o n of (5) a n d (6)
r e s u l t s in.,
)
(8
v
'
__+T4_=S1+S?y
1 - a y 1-py
2'
k+1
where
k+1
. . . +S7v y k - 1 + i^M+^Iil^l)
k
S, = a
+ /?
(1 ~ a y ) ( l - / ? y )
In o r d e r t o e x p a n d t h e l e f t - h a n d m e m b e r of (4) u s i n g (7), l e t r = - p y
~qy , t h e n
k_1
(9)
k k
z = & ( - D W q y 2 ) j + ( - p - q y ) I
1+py+qy
1+
Py-qy
E m p l o y i n g the b i n o m i a l t h e o r e m we m a y w r i t e
1964
121
w h e r e the s u m m a t i o n i s taken o v e r a l l t w o - p a r t p a r t i t i o n s of j , i . e . ,
for a l l g>0 and h > 0
-P" 2 c iy
1+py-qy
(10)
such that g + h = j .
, ^
v /
l x g+h+l
Therefore,
(g+h).r
*
g h g+2h ,
k k
(-p-2qy)(-p-qy) y b ^
1+py+qy
(11)
w h e r e w e have r e p l a c e d
m a t i o n s in (11) now extend over all i>0 and j >0 such that i + 2j = k,
Combining both s u m m a t i o n s in (11) we have,
(12)
sk=kZ(-l)i+J(i^PV
(13)
-k
C l e a r l y , for
p - q
T
^
i>0
j>0
i+2j=k
( i + J " 1 ) i~iTjT
122
April
nth
degree polynomials.
The m a i n point to o b s e r v e is not n e c e s s a r i l y the m e a g e r r e s u l t
given by (13) but the fact that i m p l i c i t in the development of W a r i n g ! s
formula lies the generating function (4) for the Lucas n u m b e r s .
REFERENCES
T h e o r y of Equations,
1.
J. V. Uspensky,
2,
McGraw-Hill,
1948,
Wiley, 1922,
xxxxxxxxxxxxxxxxxxxx
OMISSIONS
H-3 and H-8 w e r e a l s o solved by John L. Brown, J r . , The P e n n s y l vania State University, State College, Penn.
The solution to H-16 given in the l a s t i s s u e was compounded from
solutions given by L. C a r l i t z and John L9 Brown, J r .
The v a r i t y p i s t
U n i v e r s i t y of Colorado at
Colorado.
Pro-
Proposed
San Jose,
California
D e r i v e the s e r i e s expansions
sj0
4_1
J ( ) = I, ( ) +
(-1)
I m+k
m= 1
(k = 0, I j 2, 3, , . . ) fortheBessel functions
where
H-35
m-k 1
J^,
2m
Pa.
Generalize.
8U1U6
U
+U
3U5U7
+u
4u9a2 =
124
H-36
Proposed
by J.D.E.
Konhauser,
Consider a r e c t a n g l e R.
State College,
April
Pa.
D e t e r m i n e the l i n e a r r a t i o K = L 0 / L
if the c e n t r o i d of the
N.Y.
Generaliza-
1-7.)
Show
(u
, + s( - b ) r u
)/u =
v
n+r
n-r ' n
H-39
Proposed by Verner E. Hoggatt, Jr., San Jose State College, San Jose,
California
I O
n+Z
= C
,,+C
n+1
+ F
n+Z
where
Let U, V, A and B be i n t e g e r s ,
N.Y.
ditions
(i) U > 1 ,
(ii) (U, 3) = 1;
(iii) (A, V ) = l ;
(iv) V= V^- 1 )/ 5
Show A U+BV is not a s q u a r e .
Give
1964
125
SOLUTIONS
EXPANSIONS OF BESSEL FUNCTIONS IN TERMS OF
FIBONACCI NUMBERS
P-Z
Proposed
by P.F.
San Jose,
California.
D e r i v e the s e r i e s expansions
j 0 ( ) = t (-Dk ( . ) - ij +1 ()
F 2k+1 ,
k=0
where
and I
a r e B e s s e l functions, with F 9 1
being F i b o n a c c i
numbers.
Solution
by the proposer,
P.F.
Note: This is a c o r r e c t e d v e r s i o n .
San Jose,
California
Initially this r e a d J ( x ) = . . .
in [l] . Since
2p(a)=k^0
? 2 k
PM ^k+l(x)
'
('\,2k
5
2k, p ^
0
being the F i b o n a c c i polynomials defined in [ 1 ] ,
with
_. ,,
Zk+1
known (e. g. , see [2]) that
dv ,
Now it is
7T
J \ (-2i cosv) c o s 2 m v dv = 7T J ,
(~i) J
(-i) >
2p
p+m
p-m
0
and a l s o that J (iz) = i n I (-z) = ( - i ) n l (z). Hence we e a s i l y obtain
5
2k, P = ( - 1 ) P + k [ W t t ) I k - P ( a ) - W i ( t t ) W i ( 0 ) ]
126
Finally,
April
(1/2) = F . _, we have
the f o r m a l expansions
J
()=
P
E (-Dk+Prj
()I
(*)-I
()T
(all F
k
k=0
' k+P
~P
k + p + l l M k-p+l v JJ 2k+L
REFERENCES
1.
2.
Note;
C o r r e c t e d statements, to P - l . '
Verify
(x)
equation
'
[l]
CORRECTIONS IN SAME P A P E R
P a g e 19 Replace 2 ] by [ 2 ] in line 1 1 .
3
P a g e 20 In line 5 r e a d (3) a s r e l a t i o n r e f e r r i n g to footnote 3 In view
of . . . .
'
Proposed
"Symbolic relations
For example,
if
11
Corvaiiis,
Oregon
a r e s o m e t i m e s used to e x p r e s s identities.
F n and L n denote,
respectively,
.r
J
Fibonacci and
1964'
127
(l+F)n=F2n
are known identities* where = denotes that the exponents on the symbols are to be lowered to subscripts after the expansion is made,
(a) Prove
(L + F ) n = (2F) n .
(b) Evaluate
(L + L) .
(c) Evaluate
(F + F) . .
u/2
2 e ' cosh(u/5/2) =
u /n!
1
z L u "/n.
n:
n=0
From these and the product formula for power series we can write
F L
(a)
/ 5 s F 2 u ' / /nl = 2 e sinh(ui/5)
= i/5
Tt~"TTT7 u
x /
x v
*
ix
n=0
kf
n=0 k=0
(n-k):
'
'
n
/u\
(b)
^T
k n~l
n
^ u ,
,
/r,n
n
n
s
2 T T - r T T i u. = 2 e (cosh uy5 +1} = -
u .
v
i
n^O k~0
n=0
_
n F, F ,
o^> L 2 - 2 ^
k n-k
n
^ u ,
/=- , , /=- _
n
n
y ,
1
(c)
x
7T""T~~"rTT u ~ ^ e ' ( c o s h u i / b - i ) / 5 = - - u
n=0 k-0
'
,
.n=Q
Equating coefficients and multiplying by nj then gives
n
(a)
(b)
1
(c).
k=o F* L - k
" F-
( f ) L, L 1 = 2 n L + 2
, ~ \k/
ic n-k
n
k=u
n
s ( ) F k F n _ k = (2 n L n - . 2)/5
k=0
' or
or
(L + L) n =' (2L) n + 2 ,
'
(F + F ) n =. (2L) n - 2)/5
Durham, NX.
128
bx
oo
n
^ x
n
n n!
n= 0
- e
a-b
^
1
A
n
x
ni
n=0
a =i(l +^,
It f o l l o w s a t o n c e t h a t
c^
,
bx
ax
April
= i(l
-f5)
2ax
2bx
n=0
so that
(L + F ) n = 2 n F
(a)
.
n
Similarly
x /r . T . n ,
2ax
p ( L + L) = e
2ax
= e
. - (a+b)x , 2bx
+ 2ev
' + e
. 2bx . 0 x
+ e
+ 2e
,
so that
(L + L ) n = 2 n L
(b)
+ 2 ,
while
/
\2
( - 5)
so that
TT x .
.n
2ax
2bx
x
s - r r ( F + F) = e
+ e
- 2e
,
n=0 n '
5(F + F ) n = 2nL
(c)
'
- 2 .
n
consider
To g e n e r a l i z e t h e s e f o r m u l a s
, ax , bxxr
(e
+ e ) =
r
_
X
,r
(r-s)ax+sbx
( Jx e x
s=0
r
1
,r x s x . ( r - 2 s ) a x . ( r - 2 s ) b x .
;
j 2 (s) e
(e v
+ ev
)
s=0
,
2
Therefore
r
" V
s=0
~
e
n=0
.n
nl
n
n *
1964
A D V A N C E D . F L O ; - jy.i>/ir. A N D S O L U T I O N S
/ T J_T J
JLT
/*
li
,.
'-
--.
' ^
.k
n-k
129
r.,
>k
n-k
In p a r t i c u l a r
(L+L-l-J,)'"1 -- ^ L
SimilarLy-j
J3L,
since
5 r (r+... +F)n - i r (C \
. w h e r e the n u m b e r of P ! - = /
r
n
1
5r(F+. . . +F)n = T
'
^ i"i)sdr)(2r"2s)ksn~k .
j* H
, ^ ,
-S ?, y-fl
k nk
T( \
)(2r-2s +l ) K s n K ,
L-d
w h e r e the n u m b e r of r 1 : JC ~ i 1
JU p a r t i c u l a r
A f o r m u l a for
,L +
s e
, -f L + F + . . . T F)
c a n be o b t a i n e d b u t i t i s ^ c r y c o m p l i c a t e d .
W h e n the n u m b e r of L ' s
In p a r t i c u l a r
Indeed s i n c e
/ a x , bx.r, ax
bx.r
,' 2 a x
2bx,r
(e
+ e ) ie
~ e ) = (e
- e
)
it f o l l o w s that
In p a r t i c u l a r
(L
+ L + L + F ! ^ + F
K
-= l ~- l (J F
"
D
- 3F, ) .
Z n
130
H-1 9
Proposed
by Charles
April
RACE
University,
Ft. Worth,
Texas
In the t r i a n g l e below [drawn for the c a s e ( 1 , 1 , 3 ) ] , the t r i s e c t o r s of angle, B, divide side, AC, into s e g m e n t s of length F , F
F
10.
n+3
,,
Find:
(i) lime
n-> oo
(ii) lim if
v\_
_/v_
n+3
"n+l
Solution
by Michael
Goldberg,
Washington,
D.C.
As n ^ o o , the r a t i o F , / F
a p p r o a c h e s t = (-v/5~+ l ) / 2 , a n d
, Q / E a p p r o a c h e s t ~ 2t + 1< Hence, the limiting t r i a n g l e ABC
Similarly,
1964
Hence,
131
F r o m w h i c h 20 = 90 - 1 0 8 / 2 = 3 6 ; 6 = 1 8 , ^ = 180 - 108 - 3 6 = 1 8
Also solved by the proposer
Hazelton,
Penn.
FIBONACCI TO LUCAS
H-20
Proposed
San Jose,
by Werner E. Hoggatt,
California.
College
If
snow
Q
1
D(e
)= e
is the n
n
num be r .
Solution
State College,
R e c a l l that
F
Q
n =
F
n+1
nk+1
k.!
k=0
.
n-1
2
k=0
nk
^i
0s5
car
i ^n
k=0
k,
^
^
i ^n
F
nk-1
k=0jr
Penn.
th
Lucas
A D V A N C E D P R O B L E M S AND SOLUTIONS
132
April
it i s w e l l - k n o w n t h a t
oo
J? ,nk
v
k=0 ~'
,
k
x
a x
b x
-e
^5
[ e . g . e q u a t i o n ( 2 . 1 1 ) , p. 5 of G o u l d ' s p a p e r in V o l . 1, N o . 2, A p r i l
1963j , w h e r e
a
1_ +_V E_ T
and
1 - VT
Similarly,
L
nk k
a x .
b x
k,
x = e
+ e
k=0
for the L u c a s n u m b e r s .
But
L , = F , , , + F , ,; therefore,
nk
nk+1
nk-1
^
y
kt0
.
1 ,1 + F .
nk+1
nk-1
kl
, a
(e
2
nk+3.
k=0 "~k!
(1)
n
= e
,n
. b
+ e )
un
. b
+ e .
" ^ -
k=0
Fnk+1 = F ^ + F ^
and
or
k!
i
*-
00
Since
jr
00
-^-
= S
^ _
V^
k=0
from above, we a l s o have
00
/?\
^
k=0
, ,,
00
2bEZ - -^
xv
k!'
k=0
k=0
nk
k
AVe
00
,
k=0
k=0
nk-1 _
x
*"'
e*o
- e
Y5~
,
k=0
XT
nk+1
k!
(3)
k=0
( / * / )
(4)
k=0
Now,
D(e
Q-n
"nk^ 1 _ 1_
K
^
00
2
k=0
F ,
. b
+ e
/ F , ,
n
HK+1 \ I 2
nk-1
kl
M k=0" kl
. n
b
- e
V^r
and
a
e
n .
- e
i^
k=0
nk
kl
nk-1
k!
'
1964
n ltn
a +b
= e
H-21
,n \
+ eb >
/ a
I e
"
L
n
'
yr
9
.
T
since L
of Alaska, College,
,n
b
a
e
- e
f5
n, u n . .
= a +b for n > 0.
n
FIBONACCI PROBABILITY
= e
133
,
q. e d.
___
Alaska
th
F i n d the p r o b a b i l i t y , a s n a p p r o a c h e s infinity, t h a t t h e n" x F i b o n a c c i n u m b e r , F ( n ) , i s d i v i s i b l e by a n o t h e r F i b o n a c c i n u m b e r {/ F ,
orF2).
Solution by proposer
p r o a c h e s unity.
A l s o s o l v e d by J. L. B r o w n , J r . , P e n n . State U n i v e r s i t y , , State
College,
Pennsylvania.
134
April
Continued from P a g e 114
k = F , , , we have that k+1 = F ., + F , and we a r e through.
If
n+1
n+1
2
k = F ,, - 1, we have k+1 = F , , and we a r e through.
If k = F ,-, - 2
&
n+1
n+1
n+1
we have k+1 = F , - 1, which by L e m m a 1 (A or B) ? can be r e p r e sented as c l a i m e d and we a r e through again. T h e r e f o r e let us cons i d e r k i F ., - 3.
n+i
Now the r e p r e s e n t a t i o n f o r k in this form can best be e x p r e s s e d
a s k = F +a
~ F +a - F +a
. F
. + . . . + a^F- + a 0 F n
n - 2 n-2
n-3 n-3
n-4 n-4
3 3
2 2
w h e r e a. = 0 or 1 for 2 . i S n - 2 , and a. = 1, i m p l i e s that a. 1 = 0.
i
E i t h e r a ? = a . = 0, or a
^ a.
If the f i r s t c a s e is t r u e for k,
BEGINNERS' CORNER
Edited by DMITRI THORO
San Jose State College
T H E E U C L I D E A N A L G O R I T H M II
1.
INTRODUCTION
In P a r t I [ l ] w e s a w t h a t t h e g r e a t e s t c o m m o n d i v i s o r
numbers
algorithm.
c o m p u t e t h e g. c. d. of
and
We t h e n h a v e
(1)
s = t q , + r ,
0 < r
< t
(2)
t = r , q^ + r ,
0 < r?
< r
0 < ^
< rz
0 <
< r^
rx = r 2 q
(4)
r2 = r3 q4 + r ^
(5)
r 3 = r 4 q5 + r ^
(n-1)
N
'
(n)
x
'
n-3
= r
+ xy
^ q
-,+r
n-2 ^n-1
l-^
2
>r
3
> r
etc,
135
+ r
2
+
r 4
+ r
, < r
9
n-1
n-2
t > r: + r2
(3')
(5')
0<r
n-1,
q. > 1, t h e a b o v e e q u a t i o n s i m p l y
(2 1 )
(4')
T^
Q < x
~ = r
, q + 0
n-2
n - 1 ^n
Euclidean
s t e p s ( d i v i s i o n s ) a r e r e q u i r e d to
(s > t ) .
(3)
of . t w o
136
(2 r . + 2 r J + r_,
2 r . , etc.
- ~, * -' , , ' /, I r o m (4 f ) ?
r
of Fibonacci n u m b e r s .
April
2 r
+ r
>
^ -! " r . > (3 r . + 3 r . ) +
j
i<^ * he g e n e r o u s abundance
Thus
2. A BASIC RESULT
Since the r e m a i n d e r s form a sti'i^tiy d e c r e a s i n g sequence with
r
, the last n o n - z e r o r e m a i n d e r .
n-1
c
v r
XI-&
"*
11- I
Consequently,
n-1
xi" L
n-L
) j - ! '""
n- 1
n-Z
n+1
3. LAME'S THEOREM
Although the Euclidean a l g o r i t h m is over 2,000 y e a r s old, the
following r e s u l t was e s t a b l i s h e d by G a b r i e l Lame in 1844.
Theorem
The n u m b e r of divisions r e q u i r e d to find the g c. d. of two n u m b e r s is n e v e r g r e a t e r than five t i m e s the n u m b e r of digits in the s m a l l e r
number.
Proof.
Let
1964
BEGINNERS' CORNER
+ F
n
137
we see that
, > F
ii-1
4> + F
or
n-1
> *n
F
n+2
Replacing n by n~l
section yields
t > *n-1
if t has
(ii)
(iii)
Thus d > ( n - l ) / 5
n < 5d .
REFERENCES
1.
2.
D. E. Thoro,
N(F , . ,
n+1
(F . , , F ) and m a x (n, F - l )
n+1
n
n
F ) and m a x N (n, F - l )
n'
n
Computational
Vol. 1,
pp. 5 3 - 5 9 .
xxxxxxxxxxxxxxxxxxxx
No. 3,
Considera-
October 1963,
the t r u l y g r e a t m a t h e m a t i -
It m a y be
Thus F 5 is 5; F
is 514229; F 6 l is 2504730781961. As long as
we have a table of Fibonacci n u m b e r s on hand we can p r o c e e d to m a k e
such v e r i f i c a t i o n s .
F,
nrm-
This
In fact,
once a m i s t a k e in introduced, a l l r e s u l t s
t h e r e a f t e r would be vitiated.
there are several ways.
T h e r e m u s t be a b e t t e r way.
Perhaps
Brother
F r o m r e c o l l e c t i o n of a
r a t i o s would all be from this s e r i e s , the next one was calculated and,
s u r e enough, it was 13.
^
n+^
~- u
+u
n+1
However, it is
from
n = 0 to n - 25 or so, in-
was even.
p r o p e r t i e s of u .
Thus, if z is a factor of u
a factor of u ? , u , e t c .
it will infallibly be
T h e r e f o r e , in general* if n is c o m p o s i t e ,
so is u n x(except
^ for the c a s e n = 4. un = 3),
' but if n is ^p r i m e , un
m a y be p r i m e . My f i r s t g u e s s that, since the density of odd n u m b e r s
139
140
April
the density of
primes would be greater than in the cardinal number domain was proven wrong when the primality of u
prime.
and u . ,
obvious that the density of primes in u was less than that of the
3
r
n
cardinal domain.
Several other interesting details were elucidated after extending
and examining the series,
finally to n = 130.
No u
onacci considerations.
However, the first gain from the extension of study of the series to n = 100 was a remarkable regularity found from the fact that
if P
is a prime factor of u
it will also factor, more generally,
to
J
n
^
n
u.
where j goes from 1 to 00. Consider the multiple j and let this
be expressed as a sum of multiples of powers of P , reduced to a
minimum of terms, and provided that no multiples of the powers of
P
> P .
n
Thus:
(2)
x
'
j = aP + b P 1 + c P 2 + . . . qP1"
n
n
n
^ ii
(n = 3) in the series: U3 = 2.
1964
Ordinal
jn
terms = j
Pn
P1
n
^0
24
P3
30
10
33
11
^1
Pn
^3
+ Pn
n
^3
P n J_
+ p + Pn
r.0
n
is divisible
by P x
J
0 n
+
P
nl +
P
n
+ Pn
n
n
Since P
_L
jn
u.
+1
u.
1
= Pn = 2
= P
= 4
+ 1 _ PX = 2
n
+ 1 P 4 , 16
=
n1 + 1
141
+1
=
=
n2
34
46368
= 4
332040
PX = 2
3524578
n
n
p o w e r s of P
j = 11 should read:
11 = I P
E x a m p l e 2.
Another p r i m e dividing u
tioned,
n
j terms = j
1
P
n
X
10
2P*
n
20
4Pn
25
5 P1
30
n
6 P
n
35
is 5 (P
+2
+ 2
+ P1
2Pn
50
10 2 P
25
25 P
n
P1
n
0
0
1
2
= 1 + 2 + 8.
= 5) and, a s a l r e a d y m e n -
mcike a table:
Ordinal
Sum of P
Jn
+ I P + OP + I P = P + P + P = 2
n '
n
n
n
n
n
n
Again we
u. is divisible
jn
by P_ x+1
J
n
u.
p 0 + l
= P1 = 5
5
n
n
1
p o + i -P
55
= 5
n
n
p0+l ^P1
6765
= 5
n
n
1+1
75025
P
= P 2 = 25
n
n
P o+i ^ P 1 = 5
832040
n
n
p 0 + l = PX
9227465
= 5
n
n
1+1
12586269025
P
= P 2 = 25
n3
n 2+1
P
= P = 125
n 59425114757512643212875125
n
142
A M A T E U R I N T E R E S T S IN T H E F I B O N A C C I
April
T h e m u l t i p l e Z of 2 P
in this c a s e ) is u s e d .
At a l a t e r t i m e ,
recommended
p l a y s no parts
o n l y t h e p o w e r of
in a p r i v a t e c o m m u n i c a t i o n *
D i c k s o n [4] a s a r e f e r e n c e
a c c o r d i n g to
Dickson,
to t h e l i t e r a t u r e .
the above w a s
T h e o r e m V of e i g h t i n t h e f o l l o w i n g
"If
(zero
D r . S M .
stated by
Ulam
In t h i s
In
par-
Lucas
as
form:
i s t h e r a n k of t h e f i r s t t e r m
containing the p r i m e
n
&
ris the f i r s t t e r m divisible by
f a c t o r p to t h e p o w e r A, t h e n u
X+l
X+2
^ >n
p
a n d n o t by p
; t h i s i s c a l l e d t h e l a w of r e p e t i t i o n of p r i m e s
in t h e r e c u r r i n g to; s e r i e s of u . "
n
On r e a d i n g t h i s it i s c l e a r t h a t p r e c e d e n c e i n t h i s f i n d i n g l a y
with Lucas who had,
ically.
moreover,
s t a t e d it m o r e c l e a r l y and e c o n o m -
u p to
n = 130.
Of c o u r s e ,
p r i m e s up to 10009
a r e s u f f i c i e n t o n l y to t e s t u
u p to n = 40 d i r e c t l y b u t t h e f a c t t h a t
if z d i v i d e s u
it w i l l d i v i d e u .
h e l p e d ag r e a t l yJ . N e v e r t h e l e s s i t
^
jii
s p e e d i l y b e c a m e a p p a r e n t t h a t r e p e a t e d d i v i s i o n of u
g r e a t e r than
u . j - on a d e s k c a l c u l a t o r w a s n o t o n l y l a b o r i o u s b u t i n c r e a s i n g l y p r o n e
t o e r r o r a s t h e n u m b e r of d i g i t s in u
r o s e a b o v e 1 0 . If o n l y t h e r e
J
n
w e r e s o m e w a y to e l i m i n a t e s o m e of t h e t r i a l d i v i s i o n s !
A s t u d y7 of 1t h e p r i m e s , P , w h i c h d i v i d e u
r e v e a l e d t h a t t h eJy
n
n
w e r e a l l of t h e f o r m
(3)
P n = an + 1
Since
i s p r i m e it i s o b v i o u s t h a t a n h a d to b e e v e n s o t h a t a n 1
n
could be odd,
T h e r e f o r e e i t h e r a o r n o r b o t h h a d to be e v e n .
C l o s e r s t u d y of t h e p r i m e s i n d i c a t e d t h a t , w h e n
e v e n , it w a s a l w a y s n e c e s s a r y to a d d o n e to
a
and
even,
= a n + 1,
never
a n - 1.
an
and
n w e r e both
to g e t
P , i . e. w i t h
I c a n n o t e x p l a i n t h i s but,
e m p i r i c a l l y , i t t u r n s o u t t h i s w a y . Now i t w a s p o s s i b l e t o c u t d o w n o n
t h e n u m b e r of d i v i s i o n s r e q u i r e d to d e t e r m i n e t h e P
which would
L
1964
divide u n .
Thus:
a.
Calculate
b.
D e t e r m i n e whether
c.
Divide u
d0
If u
2n - 1 a r e p r i m e .
by any p r i m e n u m b e r d e t e r m i n e d in a and b.
3n + 1.
f. If u
is not divided in step e, calculate
n
even, d e t e r m i n e 4n + 1 only).
e.
&
143
4n + 1
If n is
= an + 1 or
=5
which divides u c = 5.
5
the t r u e density of p r i m e s .
b.
They have g e n e r a t e d c o m p o s i t e n u m b e r s ,
c.
The formula given in (3) suffers only in generating v e r y m a n y c o m p o s i t e s . However, the p r o c e d u r e c l e a r l y furnishes a c r i t e r i o n w h e r e by (empirically) it h a s been found that,
divided by P
if n is p r i m e ,
will be
If
144
April
REFERENCES
1.
2.
Dodge and Romig, "Sampling Inspection Tables, " Second E d i tion, 1959, John Wiley and Sons, Inc.
3.
"Sampling P r o c e d u r e s and
July 1961.
4.
Dickson,
5.
R e c u r r i n g S e r i e s , Lucas 1 u , v .
-n
n
Lucas, "Sur la the'orie d e s n o m b r e s p r e m i e r s , " Atti R. Accad.
Sc. Torino (Math. ), 11, 1875-6, 928-937, cited in [ 4 ] .
XXXXXXXXXKXXXXXXXXXX
NOTICE TO A L L SUBSCRIBERS! ! I
P l e a s e notify the Managing E d i t o r AT ONCE of any a d d r e s s change.
The P o s t Office D e p a r t m e n t , r a t h e r than forwarding m a g a z i n e s m a i l e d
t h i r d c l a s s , sends them d i r e c t l y to the d e a d - l e t t e r office.
Unless the
a d d r e s s e e specifically r e q u e s t s the F i b o n a c c i Q u a r t e r l y be f o r w a r d e d
at f i r s t c l a s s r a t e s to the new a d d r e s s , he will not r e c e i v e it.
(This
We show
(1)
r.
A r a t i o n a l n u m b e r is of the form
(and q ^ 0).
p / q with p and q i n t e g e r s
We t h e r e f o r e wish two s e q u e n c e s
p
l*
2'
3S ' * '
(2)
q s
q s
a r e a p p r o x i m a t i o n s which
p r o x i m a t i o n w e r e obtainable s i m p l y from p r e v i o u s o n e s .
We go back to equation (1) and r e w r i t e it as
(3)
\
x = 1 +1 .
This s t a t e s that if we r e p l a c e x by r
(4)
x
'
1 + x
145
in
146
the result Is r
April
and consider
of l / x ,
x,
to be an approximation to r.
tive e r r o r of x ?
(ic e. j
and? if x,
since
that x , if x
The relative e r r o r
is positive, the rela-
> 0.
be a rational number
^pi/qr
*
We therefore choose p ?
to be p, + q,
(n + l ) - s t
p /q
and q ? to be p, .
w ith p
=p
approximation p
(6)
Pn+l
= P
<7>
VU
= P
=p
(8)
%
'
+ q
,,
and q = p . In
has
i. e. , we let p. = q, = 1.
from (8) that p
, /q
-f q
Similarly,
p ,, = p + p
^n+1
n
^n-l
Since
F ,1 -
that q = F
and we see. that the sequence of quotients F , , / F of
^n
n
T.
A
n+1 n
consecutive Fibonacci numbers furnishes the desired approximations
to the root r of (1). It can be shown that this sequence converges to
r in the calculus sense.
1964
way.
147
s = vTO in this
x 2 - 10 = 0 .
(9)
We w r i t e (9) in the f o r m s
2
9 =1
(x - 3)(x + 3) = 1
(10)
( x - 3) = l / ( x + 3)
x = 3 + l / ( x + 3)
and change (10) into
l
*u-=3+
n+1
3 -I- x
(11)
Again,, if x
x
, is an a p p r o x i m a t i o n with s m a l l e r r e l a t i v e e r r o r .
sequence of r a t i o n a l a p p r o x i m a t i o n s
p ... = 3p + lOq ,
^n+1
^n
^n
p /q
T h e r e is a
with
q 1 = p + 3q
^n+1 *n
^n
= 3
3 + xx '
1
x
~3 + x 2
= 1,
148
*3
= 3
April
*1
6+3 +
X;L
be 3,
we obtain
l
x, = 3 +
In this way we
the x .
n
6+
represent the limit
6 +. ..
s of the sequences
ofx
X]
= 3.
- x - 1 - 0
1+
i
1 +...
xxxxxxxxxxxxxxxxxxxx
In 1202, a r e m a r k a b l e m a n w r o t e a r e m a r k a b l e book.
The
m a n w a s L e o n a r d o of P i s a , known a s Fibonacci, a b r i l l i a n t m a n in an
intellectual wilderness.
To find
t h e i r own b i r t h . "
On the m a r g i n of the m a n u s c r i p t , F i b o n a c c i gives the tabulation:
A pair
1
First
2
Second
3
Third
5
Fourth
8
Fifth
13
Sixth
21
Seventh
34
Eighth
55
Ninth
89
Tenth
144
Eleventh
233
Twelfth
377
He s u m s up h i s calculations
149
150
We add to the f i r s t n u m b e r
the second one* i . e M 1 and 2; the second to the third; the t h i r d to the
fourth; the fourth to the fifth; and in this way, one after a n o t h e r , until
we add together the tenth and eleventh and obtain the total n u m b e r of
r a b b i t s 377; and i t i s p o s s i b l e to do this in this o r d e r for an infinite
n u m b e r of m o n t h s . "
T h e r e the m a t t e r lay for 400 y e a r s .
[ 1 ] of a s t r o n o m y fame,
21, . . .
a r r i v e d at the s e r i e s 1, 1, 2, 3, 5, 8, 13,
,f
In 1753,
implied by
Kepler
, u ,, - u 2 = (-i) n + 1
n-1 n+1
'
sf5)n
_n
un -
5 n ( n - l ) ( n - 2 ) , 5 2 n ( n - l )(n-2)(n- 3)(n-4) J
+ - - _ - - _ _ +_^ T ___ r i T ____ + . . .
to the a r r a n g e m e n t of the
a l r e a d y been mentioned,
B e r n a r d Lami,
the s e r i e s
Lame''has
p a r a l l e l o g r a m of f o r c e s .
G e r h a r d t i s probably a m i s - s p e l l i n g of
Girard.
Edouard
the field
of r e c u r s i v e
It i s f i r s t found in p r i n t in a G e r m a n
Among them:
(V i s the n t h Lucas n u m b e r . )
u 2 , + u 2 - u 7 .,
n-1
v"
4n
Zn-t-1
= vt: - 2
2n
152
4n+2 = U L + 1
+ 2
u n + p = u n ~ p (u+i) p
u n " p = u n (u-i) p
1886, E. Catalan [13]
[14]
2
n+2 P
Un +,1l - p Un+l+p
. . . - Un+1
" Up
+. = ( - l )
U2 - U
U x = (-l)n"p+1 U .
n
n - p n+p
n-1
1899, E. Landau [15] r e l a t e d the s e r i e s
"i
n=l
( 1'/ U 92n)
to L a m b e r t ' s s e r i e s and
n
to the theta s e r i e s .
~^
1.
2.
REFERENCES
J. Kepler "De nive s e x a n g u l a " 1611.
B. Concompagni, II Liber Abbaci de Leonardo P i s a n o Pubiicato
da B a l d a s s u r e Boncompagni, Roma MCDDDLVTL
3.
A. G e r a r d .
153
lineaires
a u x d i f f e r e n c e s finies d'u,i o r d r e quelconque, a coefficients v a r i a b l e s " Comp. Ren. Accad. Sci. P a r i s 17, 563 (1843).
B. L a m e .
Catalan.
BlattersteHung
uberhaupt.
" Nova
Acta
Acad.
Caes.
319.
E. Catalan, Mem. Soc. Roy. Sci. Lieges (2), 13, 319-21 (1886).
E. Landau. "Sul la s e r i e des i n v e r s e s des n o m b r e s de F i b o n a c c i
Bull. Soc. Math. F r a n c e 27, 298-300 (1899).
L. Dowling and A. Shaw.
A. P . Hillman,
Mathematics
Department,
We w e l c o m e any
The p r o p o s e r should
and a d d r e s s of the p r o p o s e r
clearly
indicated.
Solutions to p r o b l e m s listed below should be submitted within
two months of publication.
B-38
Proposed
by Roseanna
Torretto,
University
n+2 ~
B-39
Proposed
by John Allen
Fuchs,
n+1
University
California
satisfying
n
of Santa Clara,
Santa Clara,
California
B-40
Proposed
If H
n
by Charles
n > 3 .
University,
Fort Worth,
Texas
is the n - t h t e r m of the g e n e r a l i z e d F i b o n a c c i s e q u e n c e ,
i.e.,
154
1964
= pr , H
155
= pr + q , H = H 1 + H
forn>l,
^
n+2
n+1
n
show that
2 kH. = x(n + 1)H
q .
;
J - - H , , + 2p + H
, 2-,
.*
n+2
n+4
^
k=l
B-41
Proposed
by David L. Silverman,
Beverly
Hills,
California
Proposed
by S.L. Basin,
Sylvania
E x p r e s s the (n + l ) - s t
of F .
n
B-43
Proposed
Electronic
Systems, Mountain
Fibonacci n u m b e r
View,
F ,,
as a function
University,
by x,
Find the l i m i t of x,
f(x) =
v 1 + 2x
V2 + 3x
(d)
California
, = f(x, ) for
as k o.
Generalize.
SOLUTIONS
FIBONACCI AND PASCAL AGAIN
B-16
Proposed
by Mar/or/e Bicknell,
Terry Brennan,
Show that if
Lockheed
Missiles
San Jose,
California,
California
and
156
April
then
2F
n-1
Rx"
,F
n-1 n
,F
n-1 n
- F
n+1
2F
F
n-1
4-1
n n+1
nFn+l
n+1
( T h e r e a r e s o m e m i s p r i n t s in the originaL s t a t e m e n t . )
Solution hy\L. Carlitz, Duke University,
Durham, N.C.
Put
a m a t r i x of o r d e r
k + 1; for example
0
(r, s = 0, 1, . . . , k) ,
(.'.)
k=
1
R
- 1
"0
1"]
_1
1J
2 "
1_
It is e a s i l y verified that
F
(1)
R;
.
n-1
F
n
( n = 1, 2,
...)
n+1
n = 1.
n+1
R"
n-1
n+1
n+1
n+1
n+2
1964
157
y1 = x + y
induces the t r a n s f o r m a t i o n s
,2
:'
=
T2:
x'3
.1
=x
+ 2xy + y
,2 ,
x 1 y1 =
, ,2
x'y1 =
y'
and so on.
xy + y 2
^ x'y =
y
2
y
y
Z
3
+ y
2
2 , 3
x y + 2xy + y
'
= x
+ 3x y + 3xy
Tn.
1
xy
+ y
is given by
\ x ^ = F ,x.+ F y7
/
n-1
n
) y ( n ) = F n~
X +'
n+ly
We t h e r e f o r e get
(x x ( n ) ) 2
'
= F 2 , x 2 + 2 F . F xyJ + F 2Jy 2
n-1
n-1 n
n
2
n ) x (n) (a) = F
T-:
j x ' Vs
= Fn-1
n_lFnx
( n )2 2
(wyM)
)
'
(F 2
F^F^Jxy +
2
2
,= FF 22x X2 2+ +2 F F ,. xy
- + ~F~
,, yn
n n+1 J
n+1 J
F^y 2
158
E L E M E N T A R Y P R O B L E M S AND SOLUTIONS
h a s a v a l u e of z e r o .
n+1.
n+2
n+1
n+2
n+3
n+2
n+3
'n+4
P r o v e t h a t if t h e s a m e q u a n t i t y
k is added to
t h e v a l u e b e c o m e s (-1) n - 1 k.
e a c h e l e m e n t of t h e a b o v e d e t e r m i n a n t ,
Solution
April
State University,
Hazelton
Campus
U s i n g& t h e b a s i c F i b o n a c c i r e c u r s i o n f o r m u l a F
e l e m e n t a r y row and c o l u m n t r a n s f o r m a t i o n s
,, + F a n d
in=F
n+2
n+1
n
we m a y r e d u c e the d e -
t e r m i n a n t to:
n+1
n+1
n+2
-1
-1
which is
(-1)
= k(F F
n n+2 F n + 1 >
by a b a s i c i d e n t i t y .
r e l a t i o n to
"Fibonacci
California
Matrices
and
Lambda
F u n c t i o n s , " b y M, B i c k n e l l a n d V. E . H o g g a t t , J r . , t h i s Q u a r t e r l y ,
V o l . 1, N o . 2; R. M . G r a s s l ,
F.D. Parker, State University
U n i v e r s i t y of S a n t a C l a r a ,
California;
College,
California; H.L. Walton, Yorktown H.S., Arlington, Virginia; and the proposer.
T 9 = a,
...
In-I
2n
2n-2
California
general term(s)
of t h e
where
and
"2n+l
,T7 T9
.
Zn 2 n - 1
sequence
1964
159
The f i r s t few t e r m s a r e
F
F
0
It is e a s y1 to see that
n
k = F,(n+3)/2
IO \ /o ^
F
2 , 1
T
n
is odd.
= a
F
3
F
2
Hunter, Toronto,
Ontario,
Canada
34, 55),
d e t e r m i n e a t h i r d - o r d e r d e t e r m i n a n t having e a c h of
California
the following d e t e r m i n a n t s e e m s to have the m a x i m u m value obtainable with the nine F i b o n a c c i n u m b e r s given:
F .10 F4 *7
F
F10F9F3 + F?F6F5 + F4F3F2 - ( F ^ F g + F ^ F ,
F6
F9 F3
F2
F 5 F8
+F
39796 "
38300.
Also solved
by the
proposer.
1496
8 F 4 F 6>
160
B-29
E L E M E N T A R Y P R O B L E M S AND SOLUTIONS
Proposed by A.P. Boblett,
April
Corona, California
F 0 = b;
2
F
F
n
n
=F
n -02
+ F
.,
n-1
= F , - - F ,. ,
n+2
n+1
Also define a c h a r a c t e r i s t i c n u m b e r ,
n > 3
n < 0
"~
C = (a + b)(a - b) + a b .
Prove:
F , . F , - F 2 = ( - l ) n C , for a l l n .
n+1 n - 1
n
Solution by P.O. Parker, State University
From
N.Y.
we get
_,
b - a r n . b - as n
F(n)x =
-j s + j r ,
1 +s
1 +r
where
- x - 1 = 0.
Using
F(n + l ) F ( n - 1) - F 2 ( n ) = ( - l ) n is the
s p e c i a l c a s e in which a = b = 1.
Also solved by Mor/or/e Bicknell,
Ontario.
California;
California; and