3 2

THE CHARACTERISTIC POLYNOMIAL OF A CERTAIN
MATRIX OF BINOMIAL COEFFICIENTS

L. C A R L I T Z
Duke University, North Carolina
1.
Put
A
(1.1)
a m a t r i x of o r d e r
n+1
[<n-s>]
(r. s = 0, 1, . . . . n)
n+1; for example

0
0
0
1
0
0
1 1
0
1 2
1
1 3
3
1
A,
Let
n + 1 (x)
(1.2)
="det(xI-An+1)
denote the c h a r a c t e r i s t i c polynomial of A

cated the following r e s u l t to the w r i t e r .
Let
F = 0, F . = 1,
o
1
F ,. = F + F .
n+1
n
n-1
denote the Fibonacci n u m b e r s .
(1.3)
(n > 1)
Define
F F . ... F
,,
n n-1
n-r+1
F ,1F29 . . . F r
n, r
, . Hoggatt has c o m m u n i -
(r > 1),
F n,
n ft = 1.
o
Then we have
n+1
W >
(1.4)
Z <-X>
r(r+l)/2
F^
X n+l-r
n+1, r
r=o
In the p r e s e n t paper we prove the t r u t h of ( 1 . 4 ) .

show that
(1.5)
f + 1 (x)
n+L
n
81
( x - aJ pn"J)
M o r e o v e r we
82
April
where
(1.6)
a = (l+/5)/2,
p = (1 -. y / 5 ) / 2
T h u s t h e c h a r a c t e r i s t i c v a l u e s of
(1.7)
a ,
Since they
are distinct
,,
n+1
are
P, . . . , aP
it follows that
(3
,,
is s i m i l a r to a d i a g o n a l
matrix,
2.
We r e c a l l f i r s t t h a t f o r a n y m a t r i x
characteristic roots
X,, XOJ . . . .
1 2
of t h e
nth
order
with
we have
n
t r ( A k ) = Xk + . . . + X k
i
n
(2. 1)
(k = 0, 1, . . . )
k
k
w h e r e t r ( A ) d e n o t e s t h e t r a c e of A . M o r e o v e r o n c e t h e s e t r a c e s
a r e k n o w n it i s a s i m p l e m a t t e r t o g e t t h e c h a r a c t e r i s t i c p o l y n o m i a l .
We s h a l l a c c o r d i n g l y a t t e m p t to e v a l u a t e
tr
(2.2)
For
<An+l)
( k = 0, 1. . . . )
k = 1 it i s e v i d e n t f r o m ( 1 . 1 ) t h a t
<2-3>
tr
<An+l>
= F
<n-r>
n+l
r
F o r k = 2 we have
tr
(A 2 + 1 ) = T < r ) ( s ) = T < n ~ r x n ~ s >

n+1
^
r, s
X"
~ 2-
n-s/xn-r
^
r, s
(n-r)l(n-s)!
, ,
r
nl
r s ((n-r-s) )
xx
r, s
' '
.
k
'
= a(a+l)...(a+r-l)
S i n c e [1] p a g e 37
("n)r(a)r
z TTfcl
x
we get
(c-a)n
~JZ)' n
r!(-n)
'
'r
where
(a)r
(-k)r(n-k+l)r ,
,, x2 ~2-k(n-k)J 2 -
1965
MATRIX OF BINOMIAL C O E F F I C I E N T S
2
^^n+i*
n!
(-2n+k-l)k
X ki (n-k)i F n j ;
k
n!
(n-k)!
n!
X k! ((n
n-k)!
(2n-k+l)!
(2n-2k+l)
Y 1 ( 2n-k+l
2L. l k
k
so that
<2'4>
tr
<An+l>
2n+2
'
In t h e n e x t p l a c e w e h a v e
J. / A 3 V
tr A
< n+l>
-v^ # * w s w t .
^- , n ~ r w n - s w n - t x
(
S
n-s>(n-t>W = S ( s ) ( t ) ( r >
r , s, t
r , s, t
b u t i t d o e s n o t s e e m p o s s i b l e to e v a l u a t e t h i s s u m b y t h e a b o v e m e
We s h a l l i n s t e a d e m p l o y t h e m e t h o d u s e d i n [2] .
Starting with the identity
/n
rM ,
cx
(2.5)
replace
x^ /n"r\
xn-r
x (1+x)
x b y 1+x
= 2^ < s )
"
We g e t
/-> L \
/i . \ r / i n \ n _ r
(2.6)
(1+x) (l+2x)
XT , n - r w n - s *
= 2., (
n-t
)x
s,t
N e x t m u l t i p l y b o t h s i d e s by x
and s u m over
n-rwn-sx n+r-t
x
s
2 x (i+x) (i+2x) - = x (n;r)(n"ts^
r =o
T h e c o e f f i c i e n t of x
nr
r . This gives
r , s, t
o n t h e r i g h t i s e q u a l to
J (n'r)(n"s) = y ( r )( s ) = M A 2 , , )
Zr, s
/x
r '
-* v n - s / x n - r '
r, s
n+1
84
April
On t h e left w e g e t
2n r S
Z 0<T> ^ - Z 0 0
r+s+t=n
say.
' - = n
r+s<n
Then
n
U
^-
nX
n=o
,r.
( )
Z
s
r, s =o
r+s
X
,n-rwo
n-r-s
)(2X)
Z
< s
n=r+s
,r, r +r +
s/T ^ , - s - l
0s * S ( I - 2 x ) -
Z
r, s = o
Zx
2s._
- s - 1 ._ _ - s - 1
(1-x)
(l-2x)
l-3x+x2
where
a2 - p 2
a, p a r e d e f i n e d by ( 1 . 6 ) .
a2n+2
U
\ 1 - a2x
F2n+2
=
R e t u r n i n g t o (2. 6), a g a i n r e p l a c e
1 - (3 2 X /
We h a v e t h e r e f o r e
_ p2n+2
Z_
A2
2 n + 2
i n a g r e e m e n t w i t h (2. 4 ) .
(l+2x)r(2+3x)n-r
(2.7)
by
1+x
(n~Brnn~tBnn~f)
We find t h a t
x ^
s, t, j
M u l t i p l y by x
and sum over
r.
We g e t
n
(2.8)
]T xr(l+2x)r(2+3x)n"r
r=o
T h e c o e f f i c i e n t of x
Z
r , s, t
(ngr)(n"tS)(n:t)
r , s, t, j
on t h e r i g h t of ( 2 . 8) i s e v i d e n t l y
, n - r v ,n- s v ,n-t>
(
)(
)(
/A
~- t r ( A n + 1 )
,
.
xll+r
"j
'
1965
85
On t h e left w e g e t
n r) 2S2n r_t 3t
2 3
0<
"
"
=
I
OO
^'
t
r+s+t=n
r+s<n
,rwn-rv^Zs0n-r-s
say.
Then as above
nX
,r,,,Zs r + s,, 0 x - s - l
I
<s>2 X
<X"3x>
r, s = o
V (2x)Zs(l-xf ^ ( l ^ x f
*-*
s =o
1
2
1
a -p
"
1
(l-x)(l-3x)-4x
l-4x-x
(l-a x)(l-p3x)
/ a
3
p3
.
3
l-(33x / '
\l-a x
so that
3n+3
03n+3
- (3
3
3
a - ^
F 0 l0
3n+3
F3
It f o l l o w s t h a t
, /A3
(2.9)
3.
x
3n+3
We a r e n o w a b l e t o h a n d l e t h e g e n e r a l c a s e .
by
(3.1)
1 +x
In (Z. 6) r e p l a c e
and we get
(2+3x)r(3+5x)n-r
( n ; r ) ( n ' t B , < n j t ) ( n k >x "

s, t, j , k
T h e g e n e r a l f o r m u l a of t h i s t y p e i s
(3.2)
(Fk.1+xFk)r(Fk+xFk+1)n-r
=
r
n r
( ; )(
n-r,
r
\..(
n-r.
r
k-
n-r.
^=1,2,3,...) .
86
Indeed for
April
k = 1, 2, 3, 4, (3. 2) reduces to (2. 5), (2.6), (2.7), (3.1),
respectively.
Assuming that (3. 2) holds for the value k we replace x
by 1+x
and multiply the result by x .
The left member becomes
<xFk-i+
x F
k+
/<xFk+
<Fk+
xE
x F
k +
Wr<Fk+i
+xF
k+i>n"r
k+2>n"r
while the right member becomes
^
r , r k+i
k+l
This evidently completes the proof of (3. 2).

r
Next multiply (3. 2) by x
and sum over
This gives
n
(3.3)
*/,-,
, -r^ , r r , , _
,n-r
x (F k _ 1 + xF k ) /(F
k + xF k + 1 )
n r
( r,rr...,r
The coefficient of x
n-r,
)(
n-r,
n+r-r,
k l
V . t - )x
r
on the right of (3. 3) is equal to
7 r w n-r,
^ r - s ^s ^ n - r - t
t
k+1
r+s+t=n
r+s<n
say.
n=o
Then
r, s=o
CO
Z F_2s x2s,,d - F_ _
k
.-s-1,,
lX)
x-s-l
d-Fk+1x)
-1
T~2
~ TIZ
x
1
F
<1-Fk-lx)(1-Fk+lx,-Fk
-< k-l
r,
+i F
k+l)x+<"1)
kX 2
1965
87
But
l - ( F k - 1 + F k + 1 ) x + ( - l ) k x 2 = l - ( a k + p k ) x + ( a p ) k x 2 = < 1 - a k x ) (1-p k x)
and
1
U-akx)(l-pkx)"
ak
pk
ak-(3k \ l - a k x
1 - (3kx
It f o l l o w s t h a t
.
(k) _
U
n
nk+k
ank+k
- p
~TE
Ik
a - p
F . ,_
nk+k
F\
k
C o m p a r i s o n w i t h ( 3 . 4) y i e l d s
(3.5)
tr(A^+1) = 5 * * . .
k
4.
We n o w r e t u r n t o t h e c h a r a c t e r i s t i c
f
n+1
(x)
= det(xl - A
If w e d e n o t e t h e c h a r a c t e r i s t i c
j=o
k=o
,
= x'^
values by
ank+k
k"Pk
~
It foLlows t h a t
(4.1)
X , X, . . . ,
o
1
X , we have
n
k=o
.,
= x^" X a P
k=o
=y
,.)
n+1
j=o
nk+k
polynomial
k=o
.X1
jô
x-aJPn-J
fn+1(x)
(xaJpn"J)
a n d t h e r e f o r e t h e c h a r a c t e r i s t i c v a l u e s of
(4.2)
, p
a , a
We s h a l l n o w s h o w t h a t
p, . . , . , aP
,
n-1
a r e the n u m b e r s
.
88
April
n+1
(4.3)
n (x-aJp -J) = ( - D r ( r + 1 ) / 2
j=o
r=o
n + l j r
n + 1
with F ,.
defined by ( 1 . 3).
n+1, r
J \
i
To prove (4. 3) we m a k e u s e of the f a m i l i a r identity
n-1
n
(4.4)
d-qjx)
(-I)rqr|>1/2
j=o
p x
r=o
where
nwl
n-L
,,
n-r+1.
/T
= (1-q ) d - q
).--(l-q
)
(l-q)(l-qZ)...(l-qr)
(4.5)
[n]
If we r e p l a c e
q by |3/a we find that

r-n-i
J
L- r
2
r -nr _
nr
Thus (4. 4) b e c o m e s
^(l-a-Vx)
j=o
= 2 (-!,' a r ( r + 1 ) / 2 - P r ( r " 1 ) / 2
r=o
Now r e p l a c e x by a
n-1
x.
Then
" n d - a - J " 1 pJx) = X < - D r ( a P ) r ( r - 1 ) / 2

F n
j=o
r=o
n
r(r+l)/2 ^
2 (-D"
'" F.n, ..r x'
r=o
Replacing x by x
Fnj r x
we get
"n ( x - a a - J " V )
j=o
X (-l)r<r+1)/2
r=o
x - '
T h i s evidently p r o v e s (4. 3).

Incidentally we h a v e p r o v e d the s t r o n g e r r e s u l t that (4.3) holds
when a, (3 a r e any n u m b e r s such that aP = -1
and
1965
MATRIX OF BINOMIAL COEFFICIENTS

F
89
^n-^)(-n~1-^'\)-..(^'r+1-^'r+l)
(a-P)(a'i-pZ)...(ar-pr)
n , r
If we now compare (4. 3) with (4. 1) it is clear that we have proved

(1.4).
5.
It is of interest to note that the particular characteristic values
a , (3
can be predicted directly as follows.
, r .
We have
nr^, r .
= a Z (n-s> Q
n.
-l.r
n-r
r
n+r
= a (1+a ) = a
(a+1) = a
This shows that
[ l , a, . 0 . , a ] is the characteristic vector c o r r e s -
ponding to a .
Similarly
[ l , (3, . . . ,
(3 ]
is the characteristic
vector corresponding to (3
However it is not evident how to find the remaining characteristic
vectors when n > 1. We canfor example show that there are no other
characteristic vectors of the type
[ l , 7, . . . , 7 ] .
Indeed assume
that
(5.1)
X (n!s) ^ =
X7r
(r = 0, 1, . . . , n) .
s
Then since
1 r
I< n ! B > ^ = A i + ^ ) = ^n-re+Dr .

s
it follows from (5, 1) that

^"2r(7+l)r = X7'n
( r = 0, 1, . . . , n) .
Since the right side is independent of r we must have

that
2
7+ 1 = 7 , so
7 = a or (3 .
REFERENCES
1.
W. N. Bailey, Generalized Hypergeometric Series, Cambridge,

1935.
2.
L0 Carlitz, "A Binomial Identity Arising from a Sorting Problem, "

Siam Review, Vol. 6(1964), pp0 20-3Qo
xxxxxxxxxxxxxxxx
A RECURSIVE OPERATION ON TWO-DIGIT
INTEGERS
CHARLES W. TRIGG
San Diego, California
Let d be the sum of the digits of the i n t e g e r

w
S ? + d ? = S^, . . . , S, + d, = S , , , '
100.
S, and S, + d
= S?,
i t h a c h S being reduced modulo
Since t h e r e a r e only 100 two-digit i n t e g e r s (with initial z e r o s
being p e r m i t t e d ) ,
this o p e r a t i o n m u s t eventually r e p e a t one or m o r e
i n t e g e r s with the production of one or m o r e c l o s u r e s of the s e r i e s into

loopSo Indeed, the 100 i n t e g e r s fall into four groups of branched chains
of 2, 11, 25 and 62 i n t e g e r s t e r m i n a t i n g in loops of 1, 11, 13 and 20
members, respectively.
The loops c o n s i s t of the i n t e g e r s between the
a s t e r i s k s (**) in the following s e r i e s .

(1)
86*00*00
(2)
#52 59 73 83 94 07 14 19 29 40 44*52
(3)
2 0 2 2 2 6 3 4 4 1 4 6 56 67 8 0 ^ 8 |
0 4 0 8 1 6 2 3 2 8
38 49 62 70 77 91 01*02
(4)
64 741 85
85 98
98 )
31 35 43 50 55 65 76 89) nZ1 ^ [ 15 21
53 61 68 82 92 031} 06 12 j
24 30 33 39 51 57 69 84 9 6 \
42 48 60 66 78 93 05 10 j
| 13*17 25 32
37 47 58 71 79 95 09 18 27 36 45 54 63 72
81 90 99*17.
86
Thus all the n u m b e r s can be g e n e r a t e d from the eleven i n t e g e r s

52, 20, 75, 64, 31, 53, 24, 42, 97 and 47.
If the S's
a r e r e d u c e d modulo 10, two groups a r e formed
loop of one with one a t t a c h m e n t ,

attachments, '
5*0*0,
and a loop of four with four
J X Q, so that it takes five digits to g e n e r a t e the set.

xxxxxxxxxxxxxxx
90
THE CHARACTERISTIC POLYNOMIAL OF THE

GENERALIZED SHIFT MATRIX
V.E.
HOGGATT, JR. and A . P . H I L L M A N
San Jose State College and University of Santa Clara
T. A. B r e n n a n [3] obtained the c h a r a c t e r i s t i c oolynomial for the

k by k
matrix
element
P..
special c a s e s .
P, = [P..].with the binomial coefficient
in the i-th
row and j - t h column.
( " .J as the
See [6] and |.7| for
L. C a r l i t z |5J used another method involving some
v e r y i n t e r e s t i n g identities to achieve the s a m e r e s u l t .
In this paper
we find the c h a r a c t e r i s t i c polynomial for a g e n e r a l i z a t i o n of the

Let F be a field of c h a r a c t e r i s t i c z e r o , let p and q be in
P. .
F,
and let
(i)
yn+2
= qy n + p y n + l v
q/o
be a second o r d e r homogeneous linear difference equation over

restrict
n to be an i n t e g e r in (1).
F.
We
Let a and b be the z e r o s of the
a u x i l i a r y polynomial
x
of (1).
- px - q = (x - a)(x - b)
We deal only with the c a s e in which (1) is o r d i n a r y in the s e n s e
of R. F . T o r r e t t o and J. A. Fuchs [ 4 ] , i . e . , we a s s u m e that e i t h e r

a = b or a / b for all positive i n t e g e r s n. Using the notation of
E. Lucas [ l ] we let U be the solution (a*1 - b n ) / ( a - b) of (1). Also
n
we use the notation of [3] and [4] for the g e n e r a l i z e d binomial coefficient
U U
, . . . U -.,,
rnri _
m m-1
m-j+1
|~ml ~ 1
L Jj J "
Dy07T77~tr;
1
of D. J a r d e n [2] .
J a r d e n showed that the product
r
of the n-th t e r m s of k-1

n
solutions of (1) satisfies
<*>
L o J~
I <-nh[hk] <-q> h(h - 1)/2 =v h
h=0
91
92
T o r r e t t o and F u c h s
April
s h o w e d t h a t (1) i s o r d i n a r y if a n d o n l y if t h e " s e -
q u e n c e s " ( i . e . , f u n c t i o n s of t h e i n t e g r a l v a r i a b l e
n)
zn(i, k) = u _ : V ; J ; i= 1, 2, . . . . k
(3)
f o r m a b a s i s f o r t h e v e c t o r s p a c e of a l l s e q u e n c e s s a t i s f y i n g (2).
Let
= C (k) be t h e k - d i m e n s i o n a l c o l u m n v e c t o r w i t h
n
n*
t h e e l e m e n t i n t h e i - t h r o w a n d l e t S = S(k) be t h e k by k
z ( i , k)
n
'
matrix
[ s . ] with
'ij-
(4)
s..
= (
)q
We s h o w b e l o w t h a t
S h a s t h e s h i f t i n g p r o p e r t y SC = C , , a n d t h a t
to r
J
^
n
n+1
t h e c h a r a c t e r i s t i c p o l y n o m i a l of S i s t h e a u x i l i a r y p o l y n o m i a l
k
(5)
(~D h [J;](- q ) h(h - 1)/2 x n - h
f(X) =
h=0
of t h e d i f f e r e n c e e q u a t i o n (2).
U s i n g (3) a n d (1) w e h a v e ,
IL\
/ i \
TT^"i / TT i TT
i-1
"V / ' i - 1 \
\i-l
(6) z n + 1 ( i , k ) = U n + 1 ( q U n + P U n + 1 )
= 2 . ( h )
h i - 1 - h T T h T T k - l ~h
nUn+l
'
h=0
Letting
/-7\
<7>
h = k - j
i n (6) a n d r e v e r s i n g t h e o r d e r of t h e t e r m s l e a d s to
/ i \
(l k)
n+l '
k
V"1
/i-l\
( k -j) * ' P
k-j
i+j-k-1
T T k-j
TTj-l
n+1
'
j=k+l-i
U s i n g (4) a n d t h e f a c t t h a t (
j = 0 for
m < r,
w e c a n r e w r i t e (7) a s
<8>
n+l^k> = X
ijZn^k>
'
j=l
Let
T =jTt..l
be t h e m a t r i x
f(S), w h e r e
f(X)
i s a s d e f i n e d i n (5).
In
m a t r i x n o t a t i o n (8) i s SC = C ., . By i n d u c t i o n it f o l l o w s t h a t
J
'
n
n+1
S C = C . . . S i n c e t h e e l e m e n t s of t h e C
in a f i x e d pr o s i t i o n s a t i s f y
n
n+i
n
1965
GENERALIZED SHIFT MATRIX
the difference equation (2), so do the v e c t o r s

to TC n = 0 for all i n t e&g e r s n, i. e. ?,
C .
n
93
This is equivalent
(9)
t u z n ( l , k) + t . 2 z J Z , k) + . . . + t . k z n (k, k) - 0
for all n.
Since it was proved in [3] that the sequences

z n ( l , k ) , . . . , z j k , k)
a r e l i n e a r l y independent, (9) i m p l i e s that each t.. = 0.

and we have shown that S satisfies
Hence
T =0
f(X) = 0.
Let g(X) = 0 be the
monic polynomial equation of lea st d e g r e e over
K for which g(S) = 0.
Then g(X) divides
f(X).
C l e a r l y the last column of S is

of S
S'S
C, . Since only the last column
is involved in finding the last column of S

= S
and since SC
n
last column of S
and k - t h
follows.
is
C .
n
column of S is
= C ., , it follows by induction that the

J
n+1
In p a r t i c u l a r , the e l e m e n t in the f i r s t row
r
z (1, k), which we s h o r t e n to z in what

n
n
By definition
=n=Un "=[(an-bn)/(a-b)]
r, n . nx /,
. . ~| k-1
T k-1
Expanding the b i n o m i a l
/ir\
(10)
by the formula
(a -b )
we see that
/ k-l.n .
. k-2 x n
/Uk-Ln
zn=Cl(a
) + cz(a
b) + . . . + c R (b
)
with each c, different from z e r o .

h
Since g(S) = 0, the e l e m e n t s in the S in a fixed position, and
in p a r t i c u l a r the z , s a t i s f i e s the difference equation for which g(x)
r
n
is the a u x i l i a r y polynomial. J a r d e n showed in [5] that the z e r o s of
f(x)
are
k-1
(11)
, a
k-2,
k-3,2
,k-l
b, a
b , ..., b
The z e r o s of g(x) thus a r e some or all of t h e s e z e r o s of f(x).

f(x) / g(x), then g(x) has lower d e g r e e than f(x) and so
z n = d 1, r 11 + 2d ~ r 2^ + . 0 . + d
mr m
If
94
with m < k, the d. in F, and each r.

Since no c,
April
one of the e l e m e n t s of (11).
in (10) is z e r o , this would m e a n that (10) is not unique and
hence that the s e q u e n c e s
(a b
) , 0 h < k - 1 , are linearly de-
pendent. As in [4] , this would c o n t r a d i c t the fact that (1) is o r d i n a r y .

Hence f(X) = g(X).
Since the c h a r a c t e r i s t i c polynomial
0(X) of S
is monic, of d e g r e e
k, and a multiple of g(X), 0(X) m u s t a l s o be f(X)
and (11) gives the c h a r a c t e r i s t i c values of S. This c o m p l e t e s the proof.
REFERENCES
1.
E. Lucas, T h e o r i e des Fonctions N u m e r i q u e s Simplement P e r iodic, A m e r . J o u r , of Math. , 1 (1878) 184-240 and 2 8 9 - 3 2 1 .
2.
D. J a r d e n , " R e c u r r i n g Sequences, " published by Riveon L e m a t i m a t i k a , J e r u s a l e m ( I s r a e l ) , 1958.
3.
T. A. Brennan,
" F i b o n a c c i P o w e r s and P a s c a l ' s T r i a n g l e in a
Matrix]' Fibonacci Q u a r t e r l y ,
4.
2(1964) pp. 93-103 and 177-184.
R. F . T o r r e t t o and J. A. F u c h s ,
" G e n e r a l i z e d Binomial Coef-
ficients, " Fibonacci Q u a r t e r l y , 2(1964) pp. 296-302.

5.
L. C a r l i t z ,
"The C h a r a c t e r i s t i c P o l y n o m i a l of a C e r t a i n M a t r i x
of Binomial Coefficients, Fibonacci Q u a r t e r l y , 3(1965) pp.

6.
V. E. Hoggatt, J r . and M a r j o r i e Bicknell, " F o u r t h P o w e r F i b onacci Identities F r o m P a s c a l ' s T r i a n g l e , " Fibonacci Q u a r t e r l y

2(1964) D e c , pp. 261-266.
7.
V. E. Hoggatt, J r . and M a r j o r i e Bicknell, "Some New Fibonacci

Identities, " Fibonacci Q u a r t e r l y 2(1964) F e b r u a r y , pp. 2 9 - 3 2 .
XXXXXXXXXXXXXXX
(Continued from page 134)

A m o r e extensive a n a l y s i s of the g e n e r a t e d compositions which
yield Fibonacci n u m b e r s will be jointly a t t e m p t e d by D r . Hoggatt and
the author in a subsequent p a p e r . In addition, the author is planning
to submit some p a p e r s in the future, which will furnish some o r i g i n a l
m o d e l s and t h e o r e m s connected with Fibonacci n u m b e r s and t h e i r
p r o p e r t i e s . These m o d e l s and t h e o r e m s have been i n c o r p o r a t e d in p a r t
in the a u t h o r ' s d o c t o r a l t h e s i s , which has been cited a s a r e f e r e n c e in
this a r t i c l e .
SUMMATION FORMULAE FOR

MULTINOMIAL COEFFICIENTS
SELMO TAUBER
Portland State College, Portland, Oregon
1.
INTRODUCTION
In [ 1] we have given some h i s t o r i c a l background to the m u l t i n o m i a l

coefficients and proved some of the b a s i c s u m m a t i o n f o r m u l a e .
More
of the s u m m a t i o n formulae can be found in [ 2 ] . In this p a p e r we shall

prove additional r e l a t i o n s involving m u l t i n o m i a l coefficients.
Some of
t h e s e can be c o n s i d e r e d a s g e n e r a l i z a t i o n s of c o r r e s p o n d i n g f o r m u l a e
for binomial coefficients.
2.
We shall r e f e r to [3] for t h e s e f o r m u l a e .
FIRST SET OF FORMULAE
In o r d e r to simplify the notation used in [l] , at least for the

proof, we shall w r i t e
n
N:/n
ks:
= (
and, for,
(
k
V
8=1
k1+k-+.-..+k
k
N
Z
= N+l,
\ - l
),
' " "
with,
kg = N ,
8=1
we shall have the simplified notation
k ) = [N.(k.-l),k
Under t h e s e conditions equation (6) of [ l ] can be w r i t t e n

n
(1)
For
[N,(k.-l),kn]
[N+l,kn]
j=l
0 = p = n, we can w r i t e (1) in the form
p-1
2[N.(krl).kpfkn]+[N,kp-lfkn]+
j=l
n
X
[N,kp5(krl),kn]
j=p+l
= [~N+1, k , k 1
L
p n J
and s i m i l a r r e l a t i o n s for
N - l , N-2,
aso
, N-q, . . . , N-k , thus,

P
[LN - l , (k.-l),k
- l , k n Jl + [LN - l , k p -2,k n J1+ S fLN - l , k p - l , ( k .j - l ) , k n1J
j
' p
j=l
, ,
-i
J=P+1
95
96
p-1
1 [N-q,(kj-l)Ap-q,kjH{N-q,kp-q-l,kn]+
j=l
n
1
[N-q, k p - q , ( k . - l ) , k j
j=p+l
= [N-q+l,k
p-1
-q.kj
2 [ N - k , (k.-l), 0,kn]+
j=l
2
J=P
By adding the f i r s t
q
April
[N-.k , 0 , ( k - l ) , k n ] = [ N - k + l , 0 , k n ]
+1
q equations and simplifying we obtain
"p-1
2
2 [NTQ, ( k . - l ) , k -a, k ] + 2 [N-a, k - a , ( k . - l ) , k 1
a=0 J = l
J=P+1
o r , using the c l a s s i c a l notation,

q rp-1
(2)
N-a
I ( K 1 , K 0 , 9 . . , K . . . , K . - l , l c . - , # . . , K - a, . . . , K, +
1 L
j-i j
j+1
p
n
2
a=0|
x
.=
(
+1
N a
"
l' 2'
kp-a,
....k.^.k.-l.k..^....,^
N+l
N-q
( k, , k-j, o o , k , . . , k
k, , k~, . c, k- - q , . . , k
F o r q = k , we obtain
P
(3)
rp-i
2 2 (k , ,
a=0
u=i
N-a
K~, . , K. , j K. - 1 , k. ,, , , k - a, . . . , k )
c*
j -1
J"'"-'-
. 2 . ( k-,
N-a
9
iC0, . . , k
- CL, . , K .
1 Z
p
j= P +l
= ( R., , K^> # . . ,N+l
K- f
I L
p
. , K
, K . - 1 , K .
j-1
"
, . . . , K
j+1
1965
97
It "will be noted that in both (2) and. (3) the sum i s independent of p, thus
by s u m m i n g on p we obtain
k _
n
p -p-i
(4)
p=l
s ( k., , k~,
i
a=0|j = l
n
N-a
. . , k. 1 , k . - l , k . . , , . . . , k - a j e
j-l j
j+1
p
N-a
(l k, , k ? , . . . , k - a , . . . , k. , , k . - l , k. , , . . . , k
i+r
J-l' J
j=p+l
N+l
= n( k , k , . . . , k , . . . , k
x
2
g
n
For
n = 2, (2) and (3) r e d u c e to (3) and (4) of [3] , p. 246.

3.
SECOND SET OF FORMULAE
Consider the f o r m u l a e leading to (2) and (3). If we multiply the

f i r s t r e l a t i o n by +1, the second by - 1 , . . . , the ( q + l ) - t h
(-1) , e t c . , . . .
2
we obtain
p-1
q
(5)
r e l a t i o n by
(-1)
N-a
2 (
k j , ^ , .B.,k.^rk.-l,k.+r ...,kp-a, ...,kn
a=0L
n
,=
N-a
+1
ki'V-'-'V'0"
",kJ-l,kj"1,kJ+l""",kn
q
N-l
2 2 ( - l ) a ( k, , k . . .N-a+l
, k - a , . . . , k )+d
^ , k-, . . . , k , . . . , k ) +
oJ
1 2
p
n l Z
p
n
a=l
(-l)q+1(
and,
k
(6)
k-. k_ j . o . , k
2
a=0
"q
-q- Ij . . . , k
D-l
* \.k
2
j= P +l
k
kj.^kM'Vl
a , , , , k
N-a
k r k2, . . - k p - a ' k j - l , k j " 1 , k j + l ' ' ' * , k n
N+l
N-a+l
22 (
i k, , k~, . . . , k - a, . . o , k
a=l
k, , k 9 , . . - . , k , . . , k )
April
98
(5) and (6) for n = 2 r e d u c e to (7) of [3] , p . 247.

4.
THIRD SET OF FORMULAE
Using the notation of section 2 we w r i t e for

n
2 k = N+l, k = 0 ,
^
s
p
s=l
p-1
2 [N, ( k . - i ) , o , k n ]
[N, 0, ( k . - l ) , k n ] = [ N + l , 0 , k
J=P+1
2 [N+l, (k.-l), l , k n ] + [ N + l , 0 , k n ] +
[N+l, l . ( k . - l ) , k n ]= [N+2, l . k j
j=p+l
j=
2 [N+q, (k.-l), q, k n ]+ [N+q, q - l , k j +
2 [N+q, q, (k.-l), k j = [N+q+1, q, k n ]

J=P+1
j=
P"
2 [N+h, (k.-l).h, k ]+[N+h, h - l , k n ] +
[N+h, h, (k.-l), k 1= [N+h+1, h, k n ] ,
j=p+l
j=
By adding and simplifying we obtain
q
p-1
2 [N+a, ( k . - l ) , a, k ] +
[N+a, a, ( k . - l ) , k
[N+q,q,k n ] ,
J=l
j=P+l
or, using the c l a s s i c a l notation
p-1
Q=0
(7)
S
A
n
2
k , , k 0 , . . . , k . ^ k . - ^ k . , . , . . . , a, . . . , k '
1
(k
j=p+i
j-1
l ' k2
l+l
N+a
j - l * k j - 1 ' k j+l
N+q+1
k
l' 2"-" p-l'
q + 1
'kP+l',','kn
.
k
1965
99
and s i m i l a r l y
h -p-1
(8)
N+a
K-i > K _ , . , . , K .
1 , K . - I , K ,
i . ,
1
L
l-l
i
l+l
a=q|_j=l
J
J
J
1 '
j=p+i
2'
" '
,
l'
2'''kp~1'
(
k
For
, a ,
. . , K
n
N+a
.(
h+1
i_i
' k.~l,
n+h+1
' kp+l'
i-i-i "
-r,
,
B
' kn
n+q-1
rk2' ,kp-i,q'1'kP+r
^
e e , , k
n = 2 (8) r e d u c e s to (11) of [3] p. 248.

5.
FOURTH SET OF FORMULAE
(8) of [1] can be simplified in writing by introducing the notation

k ,
k
1
2
^n-1
n-1
s
(9)
...
= (n
2 )
j =0 j =0
j . n
.s=l
j =0
J
J
J
J
l
2
n-1=0
s
II o p e r a t e s on the o p e r a t o r 2 . Under t h e s e conditions (8) of
where
[ l ] can be w r i t t e n for,
n
k g = p+q,
s=l
i
=p
s=l
n-1
(io) ( n 2
s=l
j =0
)(,h'h'-'->
Let us substitute
p+r
for
)-d.
= k
j )(,.
k
n l "V V j 2 ' ' V j n

p in (10),
we obtain for
p+q
l ' k 2' ' k n
(j. , j _ , . . . , j )
n-1
p+r
'h'h'""3n
with
) = ( n 2 )L
\ t=l
"
h
j
h
h
h, =0 ' J r l ' 2 - 2 ' - - " V n
)(vh
l'h2'-'-'hr
100
h. = r ,
i=l
j . = p+r,
i=l
April
k. = p + q + r
i=l
s o t h a t s u b s t i t u t i n g i n t o (10) w e o b t a i n
n-1
(ii)
( n
s=l
)(n
j =0
J
v(
n-1
t=l
)(, _ k
K
Jl
!
h =0
:
i
!
JT
.
JJ
J
n
S J
)(k
. ) .
K, - J , , . . . , K -J
1 Jl
r
) = l/
P+cl+r
)
h,,h9, .. .,h ;
kl3k0, . . . ,k '
1 Z
n
1 Z
n
'
M o r e g e n e r a l l y a s c a n be p r o v e d by i n d u c t i o n w e c a n w r i t e
m-1
(12)
i=l
n-1
'
( n
'
i=l
i, j
m-1
}
=0
i=l
in
m, 1
J j l
-k
J + 1 , 1
j+l,i
. /
x _ , ^1
m, 2
m, n
11
-kqj
'
J+1'2
2
2 * * '
12
'
J + 1
m v
In
where,
<kj,t~Vl,t)
= q
j'
rj
J= 1 . 2 - - - n
t=l
REFERENCES
S. T a u b e r , " O n M u l t i n o m i a l C o e f f i c i e n t s , " A m e r , M a t h . MonthLy,
70(1963),
1058-1063,
L. C a r l i t z ,
" S u m s of P r o d u c t s
Elemente der Mathematik,

E. Netto,
Chelsea,
Lehrbuch der
of
Multinomial
18(1963), ppe
Combinatorik,
N . Y. , 19-58.
xxxxxxxxxxxxxxx
Coefficients, "
37-39.
r e p r i n t of s e c o n d Ed ,
>
'n
EXPANSION OF ANALYTIC FUNCTIONS IN TERMS

INVOLVING LUCAS NUMBERS OR SIMILAR NUMBER SEQUENCES
P A U L F. BYRD
San Jose State College, San Jose, California
1.
INTRODUCTION
In a p r e v i o u s a r t i c l e [_ 1J , c e r t a i n available r e s u l t s concerning
polynomial expansions w e r e applied in o r d e r to i l l u s t r a t e a simple gene r a l technique for obtaining the coefficients p (a) in the s e r i e s
(1.1)
f(a) =
where
f(a)
X P n (a) F n + 1
n=0
is an " a r b i t r a r y " analytic function of a, and F
onacci n u m b e r s .
are Fib-
The s a m e method m a y a l s o be applied to develop
s e r i e s expansions of the form
(1.2)
x
f(a) = i - A (a) L
'
where
for
+ 2 A (a) L
o
n=l
a r e t h e L u c a s n u m b e r s ( L = 2, L , = 1; L ,~ = L ., + L
n
~
o
1
n+2
n+1
n
n - 0 , 1, o . . ) . S u c h s e r i e s , w h i c h c a n be d e r i v e d a s s p e c i a l c a s e s
of m o r e g e n e r a l e x p a n s i o n s , a r e of u s e w h e n o n e d e s i r e s t o m a k e
given function
Lucas
s e r v e as a g e n e r a t i n g function
sequence t w o
famous
some
of t h e F i b o n a c c i o r
sequences whose many number-theo-
r e t i c a l p r o p e r t i e s a r e of p r i m a r y c o n c e r n t o t h i s j o u r n a l .
'in general,
a n y i n f i n i t e s e r i e s of t h e f o r m
00
f(a) = G[a; j y n [ ] = 2 gâ) y n

n=0
is called a generating function of a n u m b e r sequence jy | if g (a)
l i n e a r l y independent functions of a.
is taken to be
or
The f a m i l i a r type, when
a /nl , is a special c a s e of the m o r e
definition.
101
are
g (a)
general
102
ApriL
The main purpose of the present article is to review one technique for finding the coefficients of (1. 1) or (1. 2), and to give explicit
expansions of a variety of transcendental, functions in terms involving
Lucas numbers. Another objective is to point out how certain extensions
might be made to considerations involving similar sequences of integers.
2.
EXPANSIONS IN TERMS OF GEGENBAUER POLYNOMIALS

We begin by first seeking a formal series expansion expressed by
(2.1)
(2ax) = Do> k (2a) Co> k(x)
D ^ k<2a) C ^
fc(x)
m=l
where the functions
^(x)> the well-known Gegenbauer polynomials
[2 J , are given by C
, (x) = I, and
fm/2]
( 2.2)
, = ^
m.k 1 "' _ rTk)
s
(-D^ ^ : : ; r : (
^ v " ' r(m-r + l)
r=o
C m
;r)(2
X )
(for k > - l / 2 , k / 0 )
[/2]
=
(-1)
~~^
/ m-r\n
\
r / (
.m-2r
*
'
,-
'
. nx
> 0)
r=o
These polynomials satisfy the orthogonality relation
1
(2.3)
2k
Ai^J_ c
'
( X )C
2 77r(2k+m)
k(x)dx=-E
1 /ST?
jHE-,^
= 2 TT
/m
mp
with
(kÔ),
4 K (m+k)r(m+l)[r(k).r
for
k = 0, m / 0,
'
being equal to 0 when m 4 p and to 1 when m = p. If we

P
2 k-1/2
multiply both sides of (2.1) by (1 - x )
' C , (x) and then integrate
m
p, K
from -1 to 1, we obtain (upon setting x = cosy
and making use of (2. 3))
the coefficient formulas

We find it convenient to write
k
notation
r-
CmV
(x).
C
, (x) instead of using
& the standard
m, k
1965
INVOLVING LUCAS NUMBERS OR SIMILAR

103
NUMBER SEQUENCES
.2
D
,(2a)
=
^
^
^
v
Vf(2a c o s y ) C
, (cosy)dy
7
m, k
2 rr (2k+m)
m, k
(2.4) D
i, o ( 2 a )
o, k
(2a
T F J" f ( 2 a
r ( k + i)
\ATrr
c o s y )C
7T
(-i)JI
>
sin
m, o ( c O S
(for m = 0, 1, . . ; k ^ 0)
y
)dy(for
= ) >
2k
7 f(2a c o s y )dy
Now it will be seen that both (1.1) and ( 1 . 2) can e a s i l y be obtained as

s p e c i a l c a s e s of the m o r e g e n e r a l s e r i e s (2 1).
3.
RELATIONSHIP BETWEEN GEGENBAUER POLYNOMIALS AND

THE SO-CALLED FIBONACCI AND LUCAS POLYNOMIALS
The Gegenbauer ( u l t r a s p h e r i c a l ) polynomials
m and o r d e r
,(x) of d e g r e e
k satisfy the r e c u r r e n c e formula, given in r e f e r e n c e |_2 J ,
(3.1) ( m + 2 ) C m + 2 > k ( x )
= 2(m+l+k)xCm+ljk(x) - (m+2k)Cmjk(x)
which r e d u c e s to
,, . (x) + C
. (x) = 0
x _ . (x) - 2xC
C m+2,
1
m+1,1
m, 1
(3.2)
when k = 1.
C,
1,1
Relation (3.2), with conditions
(x) = 2x,
C n , (x) = 1 and
is the well-known r e c u r r e n c e
Chebyshev polynomials
formula
defining
the
(x) of the second kind, and one m a y thus
write
(3.3)Cm>1(x)
= U m (x) = U m ( c o s y )
= ^
(x = cos y )
When k = 0, formula (3 1) b e c o m e s
(3.4)
(m+2)Cm+2)0(x)-2(m+l)xCm+1)0(x)-mCm)0(x)
so that, since
(3.5)
we have
m, o
o, o
(x) = 1,
C,
(x
1, o
( x ) = T (x) = T
m
m
2x,
= 0
and
(cos y) ^ -
COS m y
: , (x= cos y , m / 0 ) ,
104
E X P A N S I O N O F A N A L Y T I C F U N C T I O N S IN T E R M S
(3.6)
v
'
,7(x) - 2x T
(x) + T (x)
m-l-2N
m+1
m
= 0
April
w h i c h is the r e l a t i o n s a t i s f i e d by C h e b y s h e v p o l y n o m i a l s
(x)
of t h e
first kind.
Now, a s p o i n t e d o u t i n r e f e r e n c e s [1] a n d [3] , t h e F i b o n a c c i p o l y n o m i a l s <f> (x) a n d t h e L u c a s p o l y n o m i a l s X (x) a r e s i m p l y m o d i f i e d
m
m
Chebyshev polynomials having the relationship
(3.7)
<m+1(x) = ( - i ) m U m ( i x ) ,
Xm(x) = Z ( - i ) m T m ( i x ) ,
(i = / T
In v i e w of ( 3 . 3) a n d ( 3 . 5), w e h a v e
(v 3 . 8 ) 4> ^ ( x ) = ( - i ) m C
,(ix),
' ^m+l
m, 1
X (x) = m ( - i ) m C
(ix),
m
m, o
(m > 1) ,
thus showing that the F i b o n a c c i and Lucas p o l y n o m i a l s a r e r e l a t e d to

modified
G e g e n b a u e r p o l y n o m i a l s f o r t h e s p e c i a l c a s e s of
k = 1
and
k = 0.
M o r e o v e r , the Fibonacci and Lucas n u m b e r s a r e p a r t i c u l a r valu e s of ( 3 . 8) w h e n
V
o > 1
x = 1/2; t h a t i s
<i/2)
I,
m + 1
(3.9)
L
= 2C
o
( i / 2 ) = 2,
o, o v ' '
With the above r e l a t i o n s h i p s ,

a givenfunction
(-i)mCmfl(i/2)
= m(-i)mC
(i/2)
v
m
'
m, o '
(m > 1)
t h e s e r i e s e x p a n s i o n s ( 1 . 1) o r ( 1 . 2 ) f o r
f in t e r m s involving F i b o n a c c i or Lucas n u m b e r s can
b e o b t a i n e d f r o m ( 2 . 1) by t a k i n g
( 3 . 10)
= i/2
and
2a
-2ia
Thus, we have the s e r i e s
f(a) = \ D
(-2ia)L +
2 o, o
o
D
m
(-2ia)L
m, o
in
m=l
(i= f^)
(3.11M
f(a) =
1
m=o
,.
1(-2ia)F
m, 1
' m+1
1965
I N V O L V I N G L U C A S N U M B E R S OR S I M I L A R
NUMBER SEQUENCES
105
w h e r e , f r o m ( 2 . 4 ) , ( 3 . 3 ) , and ( 3 . 5 ) , the coefficients m a y be e x p r e s s e d

by the definite i n t e g r a l s
n
D
o, o "
2ia)
W f
( " 2 i a c o s y )dy = AQ(a)
o
(3.12)
(-2ia) = f f(-2ia cos y )cos m y d y = ( - i ) m m A
(a),
(m>l)
f f ( - 2 i a c o s y ) s i n y s i n ( m + l ) y d y = ( - .i .)m
" 1r( 3 _ ( a )
m
D _ , (-2ia) = m, T
( m > 0)
4.
EXAMPLES
S i n c e m a n y s p e c i f i c e x a m p l e s w e r e p r e s e n t e d i n r e f e r e n c e [l ] f o r
c e r t a i n s e r i e s i n t e r m s of F i b o n a c c i n u m b e r s , w e s h a l l n o w o n l y g i v e
s o m e explicit e x p a n s i o n s in t e r m s involving Lucas n u m b e r s .
C o n s i d e r first the function
(4.1)
= ea
f(a)
s o t h a t f r o m ( 3 . 12) w e h a v e
n
(4.2)
x
e"2ia
( - 2 i a ) = \-[
O, O
'
COSy
d y = J ( - 2 a ) = J (2a)
TT J
'
and
77
IA o\
(4. 3)
T-N
/ o- \
ni f - 2 i a c o s y
D
(-2ia) = I e
'
m, o
77 J
where
. .,m_
cos m y dy = m(-i) J
r
r
.
(2a)
m*
lo
a r e B e s s e l functions
of o r d e r m [41 . ( E v a l u a t i o n of t h e
m
a b o v e i n t e g r a l s , a s w e l l a s o t h e r s t o f o l l o w , w a s m a d e b y u s e of t a b l e s
and f o r m u l a s
i n [2] , |4] ,
a n d [5] . )
S u b s t i t u t i n g t h e v a l u e s of ( 4 . 2 )
a n d ( 4 . 3) i n t o ( 3 . 11) t h e n y i e l d s t h e e x p a n s i o n
(4.4)
e a = I J x(2a) L +
2 ox
~
o
(2a) L
m
m =l
106
which converges for
0 <_ j a ) < , since
J
(2a) L
,m
r
._
m+l
m ^7 <*> ~ J ( Z a ) L
m
m
(4.5)
April
for all finite values of a.
m lim
.-^ co
a
-TTT
m+1
1 + \f~5
r~
If application is now made of the familiar
relations
(
(4.6)
cosh a = (e
+e
)/2 ?
sinh a = (e
. ia
-ia, ,
cos a = (e
+e
)/2,
{
I
(ia) = i
- e
.
.. -la
ia. /
sm a = i(e
- e )/2 ,
V"^*-1*
I (a),
m
)/2 ,
J Q
m< >
the following series expansions' can be easily derived from (4, 4):
sin a =
(4.7)
s(-1) -L,
. (2a)L
- ,
**
'
Zm-r
2m-l
m=l
{
cos a = I (2a) +
o
(-1)
I (2a)L
2m
2m
m=l
where
a r e modified Bessel functions of order

sinh a =
(4.8)
Jo
i (2a) L_
2m-1
2m~l
m, and
m=l
cosh a = J (2a) +
o
J n (2a) L
,
2m
2m
m=l
The four examples in (4.7) and (4.8) ail converge for
0 .<_ | a | < .
Although these series are apparently not found in the literature in the
specific form we have given for our purposes, they are modified cases
of some expansions due to Gegenbauer ( e . g . , see [4] , pp. 368-369).
Series for such functions in t e r m s involving certain powers of Lucas
numbers may also be obtained and will be presented in a later article.
1965
NUMBER SEQUENCES
107
N e x t , c o n s i d e r t h e odd f u n c t i o n
(4. 9)
Now
f(a)
(4.10)
D9
(-2ia)
2m, o
'
= arctan
= 0,
for
= 0, 1,
'
'
but
(4. 11)
D?
(-2ia) =
arctan(-2ia cosy )cos(2m-l)y dy ,
o
w h i c h c a n be i n t e g r a t e d by p a r t s to give
iA i o \ T-*
/ -> \
îa f sin(2m-l)y siny
' 1 2 ) D 2 m - l , o ( - 2 l a ) = --7T-J - \
2
1 *
J
l - 4 a cos y
,
^
( 4
li a
__ _
or,
,
, 0
.
(m=l,2,...),
cos(2m-2)y
fr c o s 2 m y - co
|
2
7"
^
1-4a
co
s y
dy
finally,
(4.13)
-2 -m - l' , o> 2 i a ) = i
U s e of ( 4 . 10) a n d ( 4 . 13) i n t h e f i r s t e q u a t i o n of ( 3 . 11) y i e l d s t h e s e r i e s

expansions
( 4 . 14)
arctan a =
(-l)'1
^ ^ T T -
(I
(
- J ^ 4 j \ Z
Z H J
2m-1
( a
0 )
'
m=l
which will converge
we obtain,
for
since arctan
(4.i5),= 8 I
0 <. | a | < l / \ / 5 .
If w e n o w t a k e
a = \ / 2 - 1,
( J~Z~ - 1) = TT/8, t h e i n t e r e s t i n g e q u a t i o n
t^lri^+Dd-yrTf^Ti)'
Zm - 1
2m-l
"2m-1
m=l
For
form,
a = 0, t h e r i g h t - h a n d s i d e of ( 4 . 14) b e c o m e s a n i n d e t e r m i n a t e
but the c o r r e c t r e s u l t is obtained in the l i m i t .
108
April
C e r t a i n higher t r a n s c e n d e n t a l functions such as the B e s s e l function J (a)

bers.
expande* in t e r m s involving Lucas numcan a l s o be e a s i l y expanded
Thus, if f(a) = J (a), we have

o
(4. 16)
D Q} Q (-2ia) = i
J J Q ( - 2 i a cos y )dy = [ l Q ( a ) ]
and
(4. 17)
D^
(-2ia) = 2L I J (-2ia cos y )cos 2m y d y = 2m [l
(a) 1 ,
and hence from (3. 11) we obtain, since for an even function D~
.
= 0,
2m-l, o
the s e r i e s
00
Jo(a) 4 [lo(a)] 2 L Q + 2 (-1) [l m (a)]
(4.18)
L ^
m=l
It can be shown in a s i m i l a r m a n n e r that the expansions of B e s s e l functions for all even o r d e r s a r e given by
CO
(4.19)
J ?2n (a) = I2 [i
x
Ln ( a )J] oL
( - l ) m " n I m+n
, (a)I m - n (a) L ,2m ,
m=l
(n= 0,1,2, . . . )
and a r e convergent for
0 <. \a\ < co .
A p r o p o s e d p r o b l e m for the r e a d e r is to show that the B e s s e l

function
J, (a) m a y be e x p r e s s e d in the f o r m
CD
(4.20)
x
'
JA*)=
Is '
( ~ l ) m I (a)I
,(a) L 9
.
' m x ' m-1
2m-l
m=l
The r e a d e r m a y a l s o u s e the l a s t equations in (3. 11) and (3. 12) to show
that, in t e r m s of Fibonacci n u m b e r s
..
(4.21)
s
'
arctana^
and whence
F0 ,
2m
(-l)"1 [ *
- ^ L 1 l, 2 " 1 " 1 F 2m
** \ t
L2m-1
2m+l J
m=l
1965

NUMBER SEQUENCES
(4.22)
TT=
(-1)
m-1
2m-l
m=l
2m+l
109
2m
where
b = ^L [l - Jl-4*2\,.
(4 .23)
d = I [( JZ + 1)(1 - /8 /T"- 11
The r e s u l t s (4.21) and (40 22) can a c t u a l l y be obtained m o r e r e a d i l y ,

a s indicated in the following r e m a r k s ,
5.
REMARKS
If one has a l r e a d y found the coefficients
A (a)
in (12) for an
expansion in t e r m s of Lucas n u m b e r s , it is not n e c e s s a r y to c a r r y out

the i n t e g r a t i o n in the last equation of (3, 12) in o r d e r to obtain the c o efficients
P (a)
in (1.1) for a s e r i e s in t e r m s involving Fibonacci
numbers.
For,
since
0, L
=2,
and
e a s y to show that
(5.1)
P n (a) = A n + 1 ( a ) + A n _ 1 ( a )
+ F
n+1
.,
n-1
it is
and thus that
f(a)
(5.2)
n=o
[ A n< Q > + A n + 2< Q >
n+1
Expansions in t e r m s of Fibonacci n u m b e r s or of Lucas n u m b e r s ,

however, a r e not v e r y efficient for computing a p p r o x i m a t e values of a
function.
F o r e x a m p l e , to compute
n c o r r e c t l y to 6 p l a c e s using
f o r m u l a (4. 15) r e q u i r e s 36 t e r m s in c o m p a r i s o n to 9 t e r m s using the

series
(5.3)
2 fe^r- (vT- i) 2m+l
which is based on a slowly convergent M a c l a u r i n expansion.

series
But the
110
April
n = 16 2 IU^- [ (/T-+1H/4-2 A - X)] 2m+l

2m
based on a m o r e rapidly convergent expansion in t e r m s of Chebyshev

polynomials, yields 6-place a c c u r a c y with only 5 t e r m s .
As pointed out by Gould [6] , if
(5.4)
f(a) = I
f(a) h a s a power s e r i e s expansion

ynan
n=o
then the s e r i e s
CO
(5. 5)
G(a) = f(a 1 a) + f(a 2 a) =
y an Ln
n=o
where
,(5.6)
, M
a x = 1 + 2/ 5~ ,
5" ,
a 2 = 1 -z/
will furnish a whole s p e c i a l c l a s s of generating functions for the Lucas

sequence.
S i m i l a r l y , the s e r i e s
CO
(5. 7)
H(a) = f(a 1 a) - f(a a) = 1
/ ? y a11 F n
n=o
yields a c l a s s of generating functions for the Fibonacci s e q u e n c e . It
is to be noted, however, that this technique of Gould for obtaining gene r a t i n g functions for Lucas or Fibonacci n u m b e r s is not intended to a c c o m p l i s h our p u r p o s e of making some given function f s e r v e a s the
g e n e r a t i n g function by the expansion (1.1) or ( 1 . 2). C l e a r l y the functions G( a) and H( a) in (5.5) and (5.7) a r e not the s a m e a s the given
function f.
6.
CERTAIN EXTENSIONS
In r e f e r e n c e [1] , we c o n s i d e r e d the expansion of functions in

t e r m s involving n u m b e r s (those of Fibonacci) a s s o c i a t e d with modified
1965

111
NUMBER SEQUENCES
Gegenbauer polynomials for the special c a s e when k = 1, and in the
p r e s e n t a r t i c l e in t e r m s of n u m b e r s (those of Lucas) for the c a s e when
k = 0.
Now from the g e n e r a l c l a s s , t h e r e a p p e a r to be other special
c a s e s w h i c h m a y a l s o prove of i n t e r e s t to students "devoted to the study

of i n t e g e r s with s p e c i a l p r o p e r t i e s . "
F o r i n s t a n c e , upon taking k'= 1/2,
polynomials R (x) defined by
(6. 1)
(x) = 4 ( - i ) m C
R
iii
where
m j
/?(ix)
/ d
one m a y c o n s i d e r the set of
= 4m(-i)mP
(ix),
(m = 0, 1, . . . ) ,
a r e the Legendre p o l y n o m i a l s .
F r o m equation (3.1) Ave
then have the r e c u r r e n c e r e l a t i o n

(6.2)
(m+2)R
^ ( x ) = 4(2m+3)xR L. (x) + l 6 ( m + l ) R (x)

m+2
m+1
m
with R (x) = 1 and R, (x) = 4x; or, m o r e explicitly, from (2. 2), we
can w r i t e
[m/2]
RmW = 2m
(6.3)
2 (T)(2mm2j)
x m
"2j'
which has a g e n e r a t i n g function e x p r e s s e d by

(6.4)
= S Rn(x)zn,
_
i
yi-8xz-l6z
( | 8 x z | + | l 6 z 2 I < 1) .
Now let H
be the sequence of n u m b e r s (which we shall call

m
" H - n u m b e r s " )/ obtained from R m (x) by taking x = 1/2. Thus
,6.5,
="
()
^ ) 4 i .
>0,
j=o
with H
= 1, H, = 2, H~ = 14, H- = 68, . . , ), and one m a y i n v e s t i g a t e

O
what p a r t i c u l a r p r o p e r t i e s ' t h e s e n u m b e r s might h a v e .

im
''What, for i n s t a n c e , is
(H / H ,, ) ? A r e t h e r e any i n t e r e s t i n g
3
&
'
m â> m / m+1
identities, etc. ?
112
April
By the p r o c e d u r e we have i l l u s t r a t e d , one m a y a l s o find expansions which would m a k e a given function s e r v e a s a g e n e r a t i n g function
for such n u m b e r s .
Thus, from (2. 1), (2.4), (3.10), and (6.1), we ob-
tain the s e r i e s
(6.6)
x
'
f(a)
= D . , X9 (-2ia) H +
x
o, 1/2
' o
X
** /m
D
. / 9X( - 2 i a ) H
,
m , 1/2
' m
m=l
w h e r e the coefficients a r e e x p r e s s e d by
(6.7)
m, l/2 "
2ia) =
2 +1 n
~2T~^f S i n y
o
(-2iacosy)Pm(cosy)dy(m=0, 1,...).
F o r e x a m p l e , if we take the analytic function

(6.8)
f(a) =
ea
then
iL n\ T^
(6.9) D ^
/ o- A 2m+l
/2(-2ia) = j
r ' +. - 2 i a c o s y _ /
x , ,
r
I sin y e
Pm(cosy)dy
o
1
2m+l
-2iaz_
/
x,
2m+l , ..m nj~
...
(z)dz = = (-1)
&J
/ 9 (2a),
m
2
y a m+l/2x '
(m = 0 , 1 , 2 , . . . )
and hence from (6. 6) we have the expansion
1
(*'10>
where
**-lzK
J
functions
J,l // 72( 2âu) H

^ o x+
1* ^
H i^l 1
m=l
JJ
m +.,l / 2/ 9^( 2 a )' H m
, / ? a r e B e s s e l functions of o r d e r half an odd i n t e g e r .
(a/0)
Other
f m a y be expanded in a s i m i l a r way.
The Lucas n u m b e r s , the F i b o n a c c i n u m b e r s , and our s o - c a l l e d

H - n u m b e r s , in t e r m s of which we have expanded a given analytic function, a r e a l l s e e n to be m e r e s p e c i a l c a s e s of a m o r e g e n e r a l sequence
<V
. /, w h e r e
I m , kj
[m/2]
(6.11)
=a<Sk)
m, k
r(k)
t
Hm-r+k)
T(m-r+l)
/m-r\
\
r /
{ k >
l / 2 )
'
1965
NUMBER SEQUENCES
Our t h r e e p a r t i c u l a r
r
k = 1,
q ( m , k) = 1,
q ( m , k)
(6. 12W k = 0,
L
c a s e s of t h e s e m a y be s u m m a r i z e d
m,
r(k)
In t h e f a m i l y
(6. 11),
then
however,
then
= L
(m = 0 , 1 , 2 , . . . )
m
H
i3l/2
t h e r e m a y be m a n y o t h e r i n t e r e s t i n g
s e t s of i n t e g e r s w o r t h y of c o n s i d e r a t i o n .
integer
as follows:
m+1 '
m, 1
m, o
q(m,k) = 4 m ,
k = 1/2,
then
113
F o r e x a m p l e , ' if
k is any
> 1, t h e n
[m/z]
(6.13)
q ( m , k)
(FT)]
m, k
(m-r+k-l)J
(m-r)I
m - r
r =o
w i l l o b v i o u s l y l e a d to v a r i o u s s e q u e n c e s of i n t e g e r s w h e n e v e r
(k-1)1
is any a r b i t r a r i l y
chosen function yielding a positive i n t e g e r .
E x p a n s i o n of a g i v e n f u n c t i o n
V
q(m, k ) /
f( a)
in t e r m s
involving the
numbers
, m a y e a s i l y be m a d e b y t h e f a m i l i a r p r o c e d u r e a l r e a d y d e s c r i b e d .
m, k
B e s i d e s t h e G e g e n b a u e r p o l y n o m i a l s , t h e r e a r e of c o u r s e o t h e r
w e l l - k n o w n f a m i l i e s of o r t h o g o n a l p o l y n o m i a l s w h i c h m a y b e m o d i f i e d
to f u r n i s h still o t h e r
s o u r c e s of i n t e g e r - s e q u e n c e s .
A given function
c o u l d be e x p a n d e d i n t e r m s of s u c h n u m b e r s b y a t e c h n i q u e s i m i l a r t o
the one p r e s e n t e d in r e f e r e n c e [ l ] , or in this a r t i c l e .
It c a n b e e a s i l y s h o w n t h a t
V
Lim
m, k
Vm + l , k
a n d t h u s t h a t t h e v a l u e of t h i s
family has the c o m m o n factor
Lim
q(m,k)
m _ ^ oo q ( m + l , k)
Limit f o r a l l s e q u e n c e s of t h e g e n e r a l
( J5 - l ) / 2 ,
which is the
"golden m e a n " for the F i b o n a c c i or L u c a s s e q u e n c e .

a p p r o p r i a t e c h o i c e of
q ( m , k)
right-hand side exists. )
classical
(Of c o u r s e ,
an
s h o u l d be m a d e s o t h a t t h e l i m i t on t h e
114
April
REFERENCES
1.
P, F. Byrd,
"Expansion of Analytic Functions in Polynomials
Associated with Fibonacci Numbers, " The Fibonacci Quarterly,

Vol. 1, No. 1 (1963), pp. 16-28.
2.
A. Erdelyi, et al. , Higher Transcendental Functions,
Vol. 2,
McGraw-Hill, New York, 1953,

3.
R. G. Buschman, "Fibonacci Numbers, Chebyshev Polynomials,

Generalizations and Difference Equations, " The Fibonacci Quarterly, Vol. 1, No. 4(1963), pp 1-7.
4.
Go N. Watson, A Treatise on the Theory of Bessel Functions,

Cambridge, 2nd Edition, 1944.
5.
WB Groebner,
6.
H. W. Gould,
and N. Hofreiter,
Integraltafel
(zweiter
Teil,
bestimmte Integrale), Springer-Verlag, Vienna, 1950.

"Generating Functions for Products of Powers of
Fibonacci Numbers," The Fibonacci Quarterly, Vol. 1, No, 2

(1963), pp. 1-16.
xxxxxxxxxxxxxxx
INFORMATION AND AN OMISSION

Reference related to H-37..
References by R. E. Greenwood:
Problem 4047, Amer. Math. Mon,
(issue of Feb, 1944, pp. 102-104), proposed by T. R. Running, solved

by E. P. Starke, Problem #65, Nat. Math. Mag. (now just Math, Mag. )
issue of November 1934, p. 63,
Omission H-37.
Also solved by J. A. H. Hunter.
CORRECTION
H-28
Let
r11"1
N +JSL+. . . N
o
GO
S(r,a,b)
C.(r,n)aVn-n-j
= b(r"1)n
(I)
n - 1
ADVANCED PROBLEMS AND SOLUTIONS

Edited by VERNER E. HOGGATT, JR.
San Jose State College, San Jose, California
Send all
communications concerning
Advanced
Problems and
Solutions to Verner E. Hoggatt, Jr. , Mathematics Department,

Jose State College, San Jose, California.
San
This department especially
welcomes problems believed to be new or extending old results.
Pro-
posers should submit solutions or other information that will assist

the editor.
To facilitate their consideration, solutions should be sub-
mitted on separate signed sheets within two months after publication

of the problems.
H-59
Proposed by D.W. Robinson, Brigham Young University,
Show that,
if m > 2, then the period of the Fibonacci sequence
0, 1, 1, 2, 3, . . . , F , . . .
n
positive integer n such that
H-o0
Provo, Utah
reduced modulo
F . , = (-1) F
m
1
is twice the least
(mod m).
Proposed by Verner E. Hoggatt, Jr., San Jose State College, San Jose,
California
It is well known that if p, is the least integer such that F n i ,

k
mod 10 , then p
= 60, p 2 = 300 and p
Q(n, k) is the kth digitofthe

is periodic, that is q,
mod 10.
H-61
=1.5x10
for
0< n < k - Z , . f .
, =
n, k
for
q, .
f . ,
n-j, k
. . =1
k-l,k
for
n, k
z < r
^ 1 , 1
<
2 + 2k
for
n 1
n+1, k
lim
k->
lim
n - ^
115
n, k
.
n+1, k
xl
California
and
j= l
Show that
1
"Pk
= Fn
k > 3.
If
k, Q(n, k)
is the least integer such that Q(n+q, , k) = 0(n, k)
Proposed by P.F. Byrd, San Jose State College, San Jose,
. =0
n, k
nth Fibonacci, thenfor fixed
Find an explicit expression for
Let f
Hence
1
~ 1
116
ADVANCED P R O B L E M S AND SOLUTIONS
April
See E . P . M i l e s , " G e n e r a l i z e d F i b o n a c c i N u m b e r s and t h e i r A s s o c i a t e d

M a t r i c e s , " The A m e r i c a n M a t h e m a t i c a l Monthly,
H-62
Vol. 67, No. 8.
Proposed by H.W. Gould, West Virginia University, Morgantown, West Va.
Find all polynomials
f(x+l)
f(x) a n d g ( x ) , of t h e f o r m
a.x ,
a. a n integer
b.x ,
b. an integer
s
g(x)
such that
2]x2f3(x+l) - (x+l)2g3(x)[
+3Jx2f2(x+l) - (x+l)2gZ(x)[
+ 2(x+l)jxf(x+l) - (x+l)g(x)|
H-63
= 0
Proposed by Stephen Jerbic, San Jose State College, San Jose, California
Let
F
_>,
T-/
F ( m , o) = 1 a n d F ( m , n)
. . .
m-1
F
m-n+1
_ ~
=
o < n <. m ,
r r
, ... r,
n n-1
1
be t h e F i b o n o m i a l c o e f f i c i e n t s , w h e r e F
is the nth Fibonacci numn
b e r . Show
2m-l
2
m-1
F(2m-l,n)
n= o
H-64
L^,
m > l
i= o
Proposed by Douglas Lind, University of Virginia, Charlottesville, Va.
Show
Fn+1
where
n (1 - Z i c o s ^ )
is the nth Fibonacci number.
1965
117
A L L THE SOLUTIONS
H-30
Proposed by J. A. H. Hunter, Toronto, Ontario, Canada
Find all non- z e r o i n t e g r a l solutions to the two Diophantine equations,

(a)
2
+ xy + x - y = 0
(b)
- xy - x - y
Solution by John L. Broivn, Jr., Pennsylvania
We f i r s t o b s e r v e that
(-x
=0
State University,
State College,
Pa.
(x , y ) is a solution of (a), if and only
y ) is a solution of (b).
Thus we m a y limit our c o n s i d e r a t i o n s
to just one of the equations, say (b).

Equation (b) has the form
x 2 - (y+l)x - y 2 = 0
which, c o n s i d e r i n g
y a s a p a r a m e t e r , has solutions
_ (y+1) / ( y + l ) 2
x 2
+4yZ
F o r x to be an i n t e g e r , it is c l e a r l y n e c e s s a r y and sufficient that

2
2
(y+1) + 4y be a p e r f e c t s q u a r e , that i s , t h e r e e x i s t s an i n t e g e r z
such that
(y+1) 2 + 4y 2 = z 2
or,
(y+1) 2 + (2y) 2 -
z2
Let us look f i r s t for solutions with y > 0.

(y+l)/d a r e r e l a t i v e l y p r i m e i n t e g e r s ,
where
Note that
2y/d
and
d >. 1 is the g r e a t e s t
c o m m o n d i v i s o r of 2y and y+1, so that, by the well-known t h e o r e m

2
2
2
on solutions of x + y = z , t h e r e exist two r e l a t i v e l y p r i m e positive
integers
r and
s of different parity, with r > s,

2 2
/ y+1 = d(r - s )
(i)
(
2y = d(2rs)
such that e i t h e r
118
April
i y+1 = d(2rs)
(2)
V 2y = d ( r 2 - s 2 )
F o r c a s e (1), it follows e a s i l y that

d - 2.
d = 1, while in c a s e (2),
Hence, solving c a s e (1) is equivalent to finding r e l a t i v e p r i m e
positive i n t e g e r s
r and s of different p a r i t y satisfying

2
(3)
= 1 .
- rs
Now, in c a s e (2), let

r'
= r+s
Then, r e c a l l i n g that d = 2 in c a s e (2), we have

r ',2 - s ,2
(4)
which has f o r m a l l y
the
v 2y
= 2 r' s ' ,
same
appearance
as c a s e (1) and i m p l i e s
2
2
r - r ' s ' - s !
= 1 .
Thus, since
yr'+s"
Uc1
r '- s'
and
s = =
solving c a s e (2) is equivalent to finding odd positive i n t e g e r s
r'
and s'
satisfying (3).
In e i t h e r c a s e , we see that e v e r y solution of (b) with y > 0 is
g e n e r a t e d by an a p p r o p r i a t e solution of the diophantine equation:
(*)
2
r
2
- rs - s
Note that any solution (r, s) of (*) i n p o s i t i v e i n t e g e r s has

s r e l a t i v e l y p r i m e and r > s.
and
Note that the c a s e (r even, s even)
cannot occur as a solution of (*).

Now, if (r, s) is a solution of (*) with positive i n t e g e r s
s of different p a r i t y , then c a s e ( l ) i s indicated with y = r s
and
and e i t h e r
1965

119
2
x=r
or x = - s . Thus, we obtain two solutions (x,y) of (b), n a m e l y
(r , r s ) and (-s , r s ) .
If (r' ? s') is a solution of (*) with odd positive i n t e g e r s r ' and
2
2
s', then we have c a s e (2) and y = r ' s ' with both x = r '
and x = - s ' ,
again giving two solutions of (b).
Thus, e v e r y positive solution (r, s) of (*) leads to two solutions
2
of equation (b) having positive values for
y, n a m e l y
(r , r s )
and
(-s , r s ) .
It r e m a i n s to c o n s i d e r solutions of (b) having y < 0.
If y < 0, let y = - | y | ; then, from (b),
(-lyl + i ) 7 ( | y | - i ) 2 +4y 2
so that ( l y l - 1)
+ 4|y|
t h e r e e x i s t s an i n t e g e r
m u s t be a perfect s q u a r e , or equivalently,
z such that
i
As before,
and 2 | y | ,
integers
(i)*
or
(2)*
i 2
i r + {2\y\r
= *
letting d = the g r e a t e s t common divisor of
|y| - 1
we deduce the e x i s t e n c e of two r e l a t i v e l y p r i m e positive

r and
s of different parity, with r > s,

2
At
ly|-i
such that e i t h e r
d(r - s )
2|y|
d(2rs)
d(2rs)
lvl-1
II
2 2
2 |y I = d(r - s )
Clearly, d = 1 i n c a s e (1)* and d = 2 for c a s e (2)*. I n c a s e (1)*,
we find that r and s m u s t satisfy
2 2
r -s -rs
while in c a s e (2)*, the substitution
(**)
r ' = r + s,
d'= 1 for c a s e (1)* and d = 2 for c a s e (2)*)

|y|-i
,2
-s
Z | y [ = 2r's'
,2
,
s' = r - s
yields (using
1Z0
which shows that (r',
s') i s a l s o a soLution i n p o s i t i v e i n t e g e r s of (**).
Note that any solution

and
r e l a t i v e l y p r i m e and
A l s o t h e c a s e (r
even,
April
( r , s)
of (*#) i n p o s i t i v e i n t e g e r s h a s
r > s
if w e e x c l u d e t h e s o l u t i o n
r = s = 1.
e v e n ) c a n n o t o c c u r a s a s o l u t i o n of (**).
Thus,
e v e r y s o l u t i o n of (**) i n p o s i t i v e i n t e g e r s e i t h e r h a s b o t h t e r m s odd o r
r
even and
o d d . T h e l a t t e r c a s e g i v e s a s o l u t i o n of (b) w i t h | y | = r s
2
2
and both x = - r
a n d x = s , s o t h a t t h e t w o g e n e r a t e d s o l u t i o n s of (b)
2
2
a r e ( - r , - r s ) a n d (s , - r s ) .
S i m i l a r l y , if ( r 1 , s') i s a s o l u t i o n of (**) w i t h r 1 a n d s ' b o t h
II
2
2
odd a n d r ' > s ' , t h e n | y | = r ' s ' w i t h x = - r '
and x = s' .
T h u s , e v e r y s o l u t i o n of (**) i n p o s i t i v e i n t e g e r s ( r , s) ( i n c l u d i n g
2
( 1 , 1)) y i e l d s t w o s o l u t i o n s of (b) w i t h n e g a t i v e y, n a m e l y ( - r , - r s )
a n d (s , - r s ) .
2
r
To find t h e a c t u a l s o l u t i o n s ,
2
- r s - s = 1 in positive i n t e g e r s
s = F?,
for s o m e i n t e g e r
k >. 1.
p o n d i n g s o l u t i o n s of (b) a r e ( F 2 k + 1 ,
f o r k = 1, 2, 3, . .
2
The o t h e r equation
r -r
2
2
r ' - r ' s ' - s ' = 1 by t h e c h a n g e of
2
2
t h a t e v e r y s o l u t i o n of r - r s - s
the form
r = F ? , , s = F~,
p o n d i n g s o l u t i o n s of (b) a r e
f o r k = 1, 2, 3, . . .
for
w e r e c a l l t h a t e v e r y s o l u t i o n of
r, s
h a s the f o r m
r = F?,
(See s o l u t i o n of H - 3 1 ) .
F.,kF2k+1)
and
The c o r r e s -
and ( - F ^ ,
F2kF.,k+1)
2
s-s
=-1
variable,
= -1
may
be t r a n s f o r m e d
to
r ' = r + s , s ' = r ; it f o l l o w s
in p o s i t i v e i n t e g e r s
some integer
k >. 1.
( - F 2 k , - F 2 k F 2 k _ 1 ) and (
( r , s)
has
The c o r r e s -
k-T ~F2k
2k-1 ^
2
S u m m a r i z i n g , t h e s e t of s o l u t i o n s , ( F ? , , , F - , F ? , , ),
(-F
F
F
) (-F
-F
F
)
(F2
-F
F
) for
{
l
r
*Zk'
2k Z k + 1 1 , {
2k'
"2k
Zk-11,
*2k~r
2kr2k-l;
k = 1, 2, 3, . . . ,
c o n s t i t u t e a l l t h e n o n - z e r o i n t e g r a l s o l u t i o n s of
2
2
x - x y - x - y = 0, a n d t h e s e t
2
2
2
( F
" 2 k + l J F 2 k F 2 k + l ) ? *F2k' F 2 k F 2 k + l ^ (F2kJ " F 2 k F 2 k - l ) j
( " F 2 k - r " F 2 k F 2 k - l ) f r k = l . 2. 3. . . .
?
2
c o n s t i t u t e a l l n o n - z e r o i n t e g r a l s o l u t i o n s of x ^ + x y + x - y = 0 .
AN OLD P R O B L E M
H-41
Proposed by Robert A. Laird, New Orleans, La.
F i n d r a t i o n a l i n t e g e r s , x, a n d p o s i t i v e i n t e g e r s , m ,
so that
1965

2
N = x
121
2
- m
and
M = x
+m
are rational squares.

Solution by Joseph Arkin, Spring Valley, New York
Professor
Oystein Ore,
Sterling P r o f e s s o r of M a t h e m a t i c s at
Yale University, in his book, Number T h e o r y and Its History, 1st ed. ,
1948, gives the complete solution to this problem on pages 188-193.,
Also solved by Maxey Brooke, Sweeny,
Texas
COMMENTS ON THE HISTORICAL CASE

Solved by R o b e r t A. Laird
A solution to the h i s t o r i c a l p r o b l e m submitted to
Fibonacci
(Leonardo of P i s a ) by John of P a l e r m o , an i m p e r i a l n o t a r y of E m p e r o r
F r e d e r i c k II, about 1220 A. D.
(see page 124,
Cajori's
" H i s t o r y of
M a t h e m a t i c s " for r e f e r e n c e ) . The p r o b l e m : Find a n u m b e r x, such

2
2
that x + 5 and x - 5 a r e each s q u a r e n u m b e r s . In other w o r d s ,
find the s q u a r e which i n c r e a s e d or d e c r e a s e d by 5, r e m a i n s a s q u a r e .
Leonardo solved the p r o b l e m b y a method (not known to me) of building
s q u a r e s by the s u m m a t i o n of odd n u m b e r s .
Solution to this p r o b l e m was published in the
T e a c h e r " in D e c e m b e r 1952.
I offer it h e r e for your i n t e r e s t and p l e a s u r e .
x = side of the d e s i r e d s q u a r e
x + b = side of a l a r g e r s q u a r e
x - a = side of a s m a l l e r s q u a r e
a and b a r e positive, r a t i o n a l n u m b e r s
(1)
(2)
(x + b ) 2 = x 2 + 5
(x
- a)
= x
Solving (1) and (2)

(3)
5 + a2
x = _
- 5
Let
"Mathematics
122
April
Equating (3) and (4)

2
5 + a^
2a
Solving for
2
5 - t/
""^b
b in t e r m s of a, we have
-(5+a 2 ) 7 a 4 + 3 0 a 2 + 2 5
b =
2a
(5)
In o r d e r for
b to be a r a t i o n a l n u m b e r ,
the r a d i c a l m u s t c l e a r .
So
find value of a that will do t h i s .

We can find a by t r i a l substitution or by factoring.
L e t ' s take
factoring:
a 4 + 30a 2 + 25
(a 2 + 13 ) 2 + 4(a 2 - 36)
If a
= 36 or a = 6, the r a d i c a l will c l e a r .
substitute
For immediate result,
a = 6 in (3)
X
5+a2
"
2a
_ 5+36
"
12
_ 41^
"12
Q.E.D.
Generally, find the s q u a r e which if i n c r e a s e d or d e c r e a s e d by m

r e m a i n a s q u a r e (m = positive i n t e g e r ) .
solution can be found, but not for
Strangely,
will
when m = 6, a
m = 1, or 2, or 3, or 4.
FROM BEST SET OF K TO BEST SET OF K+l ?

H-42
Proposed by J.D.E. Konhauser, State College,
Pa.
A set of nine i n t e g e r s having the p r o p e r t y that no two p a i r s have

the s a m e sum is the set consisting of the nine consecutive Fibonacci
n u m b e r s , 1, 2, 3, 5, 8, 13, 21, 34, 55 with total sum 142. Starting with 1,
and annexing at each step the s m a l l e s t positive i n t e g e r which p r o duces a set with the stated p r o p e r t y yields the set 1, 2, 3, 5, 8, 13, 21,
1965
123
30, 39 with sum 122. Is this the best r e s u l t ? Can a set with lower total
sum be found ?
Partial solution by the proposer.
P a r t i a l answer.
116.
The set 1, 2, 4, 5, 9, 14, 20, 26, 35 has total sum
For eight numbers the best set appears to be 1, 2, 3, 5, 9, 15, 20,
25 with sum 80. Annexing the lowest possible integer to extend the set
to nine m e m b e r s requires annexing 38 which produces a set with sum
118.
It is not clear (to me, at least) how to progress from a best set
of k integers to a best set for

H-43
k + 1 integers.
(Corrected) Proposed by H.W. Gould, West Virginia University,
Morgantoivn, West Va.
Let
00
/ .
mn
n=l
where
F . is the
i-th
Fibonacci number, find

lim
x >1
See special case
<^(x)
- log (1 -x)
m = 2 in Revista Matematica Hispano-Americana (2)
9 (1934) 223-225 problem 115.

A FAVORABLE RESPONSE
H-44
Proposed by V.E. Hoggatt, Jr., San Jose State College, San Jose,
California
Let u
= q and u. = rp, and u . 0 = u n + u , then the

o
^
1
n+2
n+1
n
called generalized Fibonacci numbers.
x(1)
Show
(2)
Show that if
'
= pF
V, n = u + u . .
2n+l
n
n+1
then V
and
+ qF
.
n-1
V0
= u .. - u ,
2n
n+1
n-1
are also generalized Fibonacci numbers.
are
124
April
Solution by Lucile R. Morton, San Jose State College, San Jose, California
We p r o v e f o r m u l a (1) b y i n d u c t i o n o n n . It i s o b v i o u s t h a t
ux = p = p F L + q F Q
and u2 = p + q =
Now l e t u s a s s u m e f o r m u l a (1) h o l d s f o r
uk
n = k and
+ qY
n = k+1.
.
Thus
= p F k + qFfc_1
and
U
k+1 =
pF
k+I
+ qF
Adding we get
U
k+1
+ U
k
U
P(Fk+l+Fk)+^Fk
k+2
+ F
= PFk+2+<^Fk+l
k-l)
'
w h i c h w a s t o be p r o v e d .
We p r o v e V a r e g e n e r a l i z e d F i b o n a c c i n u m b e r s by s h o w i n g t h e y s a t i s n
2
fy7 t h e r e c u r s i o n f o r m u l a V 1 0 = V ,-, + V , w h e r e V~ = 2pq - q a n d
2
2
Vi = P + q We c a n d o t h i s by s h o w i n g
(3)
2n+l
= V + V
2n 2 n - l
(4)
V
v
2n+2
= V
+ V
v
2n+l V 2 n
F r o m f o r m u l a s (2)
V7 + V7
, = ( u 2 , - u 2 . ) + v( u 2 , + u 2 )
2n
2 n - l v n+1
n-1'
n-1
n'
2
n+1
and
V , ,, + V7
2n+l
2n
2
n
2n+l
(u2 + u 2 ,. ) + (u2 , - u 2 . )
n
n+1
n+1 n - 1
2
2
,92
= u - u . + 2u . ,
n
n - 1 n+1
= (u
,, )(u 9 ) + (u ,, )(u , , + u + u , )
n+1
n - 2 ' n+1 n+1 n n - 1
= u,,(u
+ u , + u , 9)
n+1 n -7 2 n - 1 n + 2
2
2
= (u 9 - u )(u 9 + u ) = u 9 - u
n+2
n n+2 n
n+2 n
= V9 x 9
2n+2
Q. E . D.
1965
125
Now let us c a r r y our p r o b l e m a little f u r t h e r . Let m be a fixed i n t e ger, and let V = u . . A r e t h e r e any3 r e s t r i c t i o n s on p and q ?
n
n+m
^
^'
Since V and u a r e tog e n e r a l i z e d Fibonacci n u m b e r s
n
n
2
V ,, = V n F + V , F ,, = ( 2rpnq - q 2 ) F + (p
+ q 2 ) F ,.
r
n+1
On
1 n+1
^
n
^
n+1
and
u
=u F +u
F
= (pF
+qF
)F + (pF
+ q F (F
r
n+m+1
m n
m+1 n+1
m
m - 1 n ^ m + 1 ^ m n+1'
Thus we have
(5)
x
'
2pq-q2
^^ ^
(6)
p 2 + q2 = p F
Our question b e c o m e s :
tions (5) and (6) h o l d ?
V
=u
=0.
= rp F
+ qF
.
m-1
, 1 + qF
F o r what i n t e g r a l values p and q do equaObviously p = q = 0 is a solution.
Let
x + F
,.
m+1
y + F
,
m
p =
and
q =
,
substituting into equations (5) and (6) we have
(7)
x
'
2
2
2xyy - y32 = F m+1
,. - F m
- 1. = F 02m
(8)
N
'
x 2 + Jy 2
F 2 ,. + F 2 = F ?
m+1
m
2m+l
and
.
Eliminating x and simplifying

5y4 + 2(F9
- 2 F 7 ,. )y 2 + F 2
=0
7
x
2m
2m+l/;
2m
or
4
Thus
5y
7
,
y2
2
2
- 2L0 y + F ,
=0 .
Zm ;
2 2m
L0
/4L
- 20F2
2m y
2m
2m
10
L,
/L2
- 5F2
2m
v 2m
2m
Then
126
April
Then
2
^ m * ^ "
2 1
"
2
and we have 5y
J
< - 2 ( - D
2
= L
5y Z
(9)
, which has no i n t e g r a l solutions, or

to
m
2
2
= L 4 = 5F + 4 ( - l ) m 4
.
m
m
2
2
Now 5y = 5 F
8 . which has no i n t e g r a l solutions, or 5v = 5 F ,
and y = F . T h e r e f o r e the equations (7) and (8) have the solutions
x = F ., , Jy = F
and x = - F ., , Jy = - F
for all m, and x = - F ,. ,
m+1
m
m+1
m
m+1
yJ = F
and x = F ., , Jy = - F
for m = 0, - 1 .
m
m+1
m
Thus
p = F
r
,T
m+1
p = 0
^
or
q = F
q = 0
^
rn
^
a r e solutions of (5) and (6) for all m, and
p = 0
p = F
r
,.
m+1
or
q = F
q = 0
m
a r e solutions of (5) and (6) for m = 0, - 1 .
Therefore V = u , = F ,
when p = F .. and q = F
n
m+n
Zmtn
m+1
m
for all m, or V = u , = 0 when p = q = 0.
n
m+n
If we c o n s i d e r n o n i n t e g r a l solutions, from (7) and (8) we had
2
5 y 2 = Lm
which gives us
L
y ==
and
x =
m+1
v/5"
Thus the solutions of (7) and (8) a r e

L
, -i
m+1
x
y =
v5~
for all m .
m
sfs
Therefore
,
and
.,
m+1
x =
m
,
>/5"
y = 4S
1965
A D V A N C E D P R O B L E M S AND SOLUTIONS
L
4.1
m + 1
+ F
/pp=
_V
m+1
m+I
a
=-
yr
and
L
4-!
m + 1
N/5"
p =
=
L
- _ ^
m + 1
7s"
+ F
q =
A/so solved by Clifton T. Wbyburn, Douglas Lind, Clyde A. Bridget, Charles R. Wall,
John L. Brown, Jr., Joseph Arkin, Raymond E. Whitney, John Wessner, W.A. Al-Slalm
and A. A. Gioia (jointly), Charles Ziegenfus and L, Carlitz.
ITERATED SUMS OF SQUARES

H-45
Proposed by R.L. Graham, Bell Telephone Labs., Murray Hill, N.J.

Prove
where
p=0
q=0
r=0
is the
F^
-I(2n2+8n+ll-3(-l)n)
F^+2
s=0
nth
Fibonacci
number.
Solution by Charles R. Wall, Texas Christian University,
Ft. Worth, Texas
Using the identities

k
*
n=0
2
n
*
<
n=l
= T
"
l
+ (
F2
~
k+1 " "" 2
V
Z
n=0
k + 1
k
F F
n n+1
l )
'
127
128
April
we have
n
p=0
q=0
FJ=
2 F F , _
s
p=0
q=0
r=0
s=0
^F
F
li
) p+1 p+2 ~ 2
p=0 ^
z
= v
{F
+ (-DP I
I
(
'
- E - 2 - Lil! I
^
) p+l
p=0 '-
p+2
F2
I
n+2 ~ 2 "
(-l)n
2
n+2 " \
"
r+1
r=0
n(n+l)
4"
"
( 2 n 2 + 8 n + U
'
(
'
3(n+l)
4"
<" 1 ) n )
1 + (-l)r
8
Also solved by Douglas Lind, L. Carlitz, and Al-Slalm and A. A. Gioia
(jointly).
XXXXXXXXXXXXXXX
HAVE YOU SEEN?

J. Arkin, "An Extension of the Fibonacci Numbers, " American Mathematical Monthly, Vol. 72, No. 5, March 1965, pp. 275-279.
Marvin Wunderlich, "Another Proof of the Infinite P r i m e s Theorem, "
American Mathematical Monthly, Vol. 72, No. 5, March 1965, p. 305.
This is an extremely neat proof for the Fibonacci Fanl
Benjamin B. Sharpe,
No.
Problem 561, Mathematics Magazine, Vol. 28,
2, March 1965, pp. 121-122.
SEEKING THE LOST GOLD MINE OR

EXPLORING FOR FIBONACCI FACTORIZATIONS
BROTHER ALFRED
Saint Marys College
Now that s u m m e r is coming on, everybody is looking for a good

way to w a s t e t i m e . See^ no f a r t h e r .
The s e a r c h for f a c t o r s of F i b onacci n u m b e r s is the p e r f e c t a n s w e r .
And f i r s t , some ground r u l e s . People with c o m p u t e r s who p r o g r a m t h e i r m a c h i n e s and then sit idly by while they grind out a n s w e r s
should not be c o n s i d e r e d in the c l a s s of working Fibonacci f a c t o r i z e r s .
The challenge is to be able with the available tables and the m a t h e m a t i c a l
b o w - a n d - a r r o w the c a l c u l a t o r to find some method or m e t h o d s
that facilitate the d e t e r m i n a t i o n of f a c t o r s in Fibonacci s e q u e n c e s .
J u s t to get away from the w e l l - w o r n path we s t a r t in virgin t e r r i t o r y with a sequence 1, 4, 5, 9? 14, 23, e t c . We d i s c o v e r v e r y soon
that this has a prolongation to the left of . . . . . . . . 1 9, 12, - 7 , 5, - 2 , 3,
1, 4, 5, 9. . o and since the f a c t o r s of both portions of the sequence
a r e the s a m e we might call the sequence 2, 5, 7, 12, e t c . , the conjugate sequence to 1, 4, 5, 9? 14, e t c . This is a f i r s t help in factoring
the initial hundred t e r m s of each portion of our sequence a not too
m o d e s t goal.
Next, we can d e t e r m i n e the p r i m e s that do not divide the m e m b e r s
of our s e q u e n c e . Taking the s q u a r e of any t e r m m i n u s the product of
the two adjacent t e r m s gives 1 1 . Thus
5 2 - 4 9 = - 11
In g e n e r a l , if we d e s i g n a t e the t e r m s of the sequence
T2 - T J
n
n-1
Hence if a p r i m e divides
T ,
.
= 11
n+1
. , for example, it would follow that
T 2 = 11 (mod p)
n
Thus if n e i t h e r +11 nor -11 is a q u a d r a t i c r e s i d u e of a given p r i m e p,
then this p r i m e cannot be a factor of the s e q u e n c e . "We can e l i m i n a t e
from c o n s i d e r a t i o n in this way: 11, 13, 17, 29* 4 1 , 6 1 , e t c .
The s m a l l e r quantities in our sequence can be factored e i t h e r by
i n s p e c t i o n or factor tables* Next, a p a r t from 11, the p r i m e s have the
s a m e period in as in the Fibonacci s e q u e n c e . Hence we can have some
129
130
SEEKING THE LOST GOLD MINE or EXPLORING

FOR FIBONACCI FACTORIZATIONS
April
idea of when they should be entering the sequence by looking at the size
of the period and more specifically the entry point in the Fibonacci sequence. For the spacing of the members of our sequence that are divisible by the given prime is the same as in the Fibonacci sequence
should it be a factor of the sequence at all. For small spacings we can
then extend the factor to other members of our sequence by using this
information regarding the period and entry point of the prime in the Fibonacci sequence.
But how should we organize a systematic and convenient method
of factoring using previous information on the Fibonacci and Lucas
sequences? The following approach was tried0 Since
T
i =l -
2 =
o+ h
+ L
it follows in general that T = F
T + L . Thus if we know the Fibonacci

n i n
numbers modulo p and the Lucas numbers modulo p, it is simply necessary to checkand see whether the sum of the residues of F , and L
is congruent to zero modulo p. Another dividend comes fr om the fact
that if we call the members of the conjugate sequence R then
XL
R2
= 5 = F
+ L
+ L2
s o t h a t i n g e n e r a l R n = Fn_j_^ + L n . T h u s t h e r e s i d u e s c a n b e u s e d i n
two w a y s .
The original thought was that once these r e s i d u e s a r e on
hand, i t would be p o s s i b l e t o u s e t h e m f o r f a c t o r i n g m a n y F i b o n a c c i
sequences.
The m e t h o d w o r k s . But a s w e g e t t o l a r g e r and l a r g e r p r i m e s
the p e r i o d s i n c r e a s e and s o likewise do t h e e n t r y points s o that the
probability that the p r i m e will be a factor between T^QQ and R^QQ S e t s
l e s s . A l s o , w i t h l a r g e p r i m e s s u c h a s 911 w i t h a n e n t r y p o i n t of 70 i n
the F i b o n a c c i s e q u e n c e ( 1 , 1 , 2 , 3 . . . ) t h e p r o b a b i l i t y that this will be a
f a c t o r of a F i b o n a c c i s e q u e n c e c h o s e n a t r a n d o m i s r e l a t i v e l y s m a l l ,
b e i n g o n l y 7. 6%.
This s a m e pattern applies to a l l large p r i m e s with
relatively small entry points.
A g a i n t h e s e q u e n c e of p r i m e s t h a t f a c t o r a l l F i b o n a c c i s e q u e n c e s
h a v e t h e m a x i m u m p e r i o d , 2p + 2 a n d h e n c e t e n d to h a v e a s m a l l p r o b a b i l i t y of f a c t o r i n g o u r s e q u e n c e s w i t h i n t h e l i m i t e d r a n g e f r o m T ^ Q Q
t o R].oo
All in all, the high hopes e n t e r t a i n e d for this m e t h o d w e r e n o t
r e a l i z e d , , D o e s s o m e o n e h a v e a b e t t e r w a y of a t t a c k i n g t h i s p r o b l e m ?
As a byproduct, it would a p p e a r to be a worthwhile goal to have
a v a i l a b l e f a c t o r i z a t i o n s of t h e f i r s t h u n d r e d t e r m s of a few F i b o n a c c i
s e q u e n c e s s u c h a s ( 1 , 4) a n d (2, 5) e v e n if s o m e b o d y d o e s i t o n a
computer.
XXXXXXXXXXXXXXX
TIME GENERATED COMPOSITIONS YIELD

FIBONACCI NUMBERS
HENRY WINTHROP
University of South Florida, Tampa, Florida
1.
INTRODUCTION
Imagine a p a r t i c l e the n u m b e r of whose collisions with other p a r t i c l e s during the t
t i m e i n t e r v a l i s given by <(t). A s s u m e that this
p a r t i c l e p o s s e s s e s a p r o p e r t y , p, which it can t r a n s m i t by collision to

e v e r y p a r t i c l e with which it c o l l i d e s . F u r t h e r suppose that e v e r y p a r ticle that has r e c e i v e d p r o p e r t y p by collision can a l s o t r a n s m i t it by
collision.
A s s u m e that for an indefinite period of t i m e e v e r y p a r t i c l e
p o s s e s s i n g p r o p e r t y , p, collides only with those p a r t i c l e s not p o s s e s s ing this p r o p e r t y .
The n u m b e r of new p a r t i c l e s to which p r o p e r t y , p,
has been i m p a r t e d is given by the following m o d e l ,

2.
THE MODEL
Let A. be the n u m b e r of collisions with new p a r t i c l e s in the t i m e
i
i n t e r v a l i < t <, i + 1 by p a r t i c l e s p o s s e s s i n g p r o p e r t y ,
p, at t = i.
The new p a r t i c l e s do not s t a r t t h e i r p r i v a t e t i m e s until the end of the

t i m e i n t e r v a l of t h e i r initial collision*
(1)
A0 = 1
= 0(D
A 2 = 0(2) + <pZ(l)
A 3 = 0(3) + 2 0 ( 2 ) 0 ( 1 ) + 0 3 (1)
A 4 = 0(4) + [20(3)^(1) + 0 2 ( 2 ) ] + 30(2)< 2 (1) + <p4(l)
A. =
F(h.,0)
The m o d e l is obtained a s follows:

Up to t = 1, A n
is
g e n e r a t e s the i n c r e m e n t
A , , whose magnitude
0(1), the n u m b e r of p a r t i c l e s with which A 0 collided in the f i r s t
time interval.
Atthetime
t = 2, A n has collided with <(2) m o r e new p a r t i c l e s
during the second t i m e i n t e r v a l and
has collided with <fi(l) new
p a r t i c l e s , since its collisions a r e subject to the phase rule c o n s t r a i n t

131
132
of its own p r i v a t e t i m e .
April
T h e r e f o r e when t = 2 in public t i m e ,
A,
= 0(2) + 0(1)0(1) = 0.(2) + 0 2 (1).
^2
When t = 3, A n has collided with 0(3) m o r e new p a r t i c l e s during
the t h i r d t i m e i n t e r v a l for it is in p h a s e 3 of its p r i v a t e t i m e , each
p a r t i c l e of A-. = 0(1) has collided with 0(2) m o r e new p a r t i c l e s , p r o ducing 0(1)0(2) new p a r t i c l e s a l t o g e t h e r , because
is in the s e c -
ond phase of its p r i v a t e t i m e . E a c h p a r t i c l e of A ? collides with
0(1)
new p a r t i c l e s since it is in the f i r s t phase of its p r i v a t e t i m e , thus

producing
A., 0(1) particles.
(0(2) + 0 2 (1))0(1) = 0(2)0(1) + 0 3 (1)
T h e r e f o r e when t = 3, we have
A3 =
[0(3)] + [0(1)0(2)] + [0(2)0(1) + 0 3 (1)]
= 0(3) + 20(2)0(1) + 0 3 (1)

Now if we substitute
(2)
0(t) = t into the m o d e l display (1), we obtain
AQ = 1
\
A, = 2 + l 2
2
Ak . = 3 + 2 2 ' 1 + I 3
3
= 8
A, = 4 + 2 3 1 + 2 2 + 3 2 I 2 + l 4
*4
= 21
Neglecting A n , one o b s e r v e s that the n u m b e r s 1, 3, 8, 21, 55

U ,-, = 3U M - U a r e the a l t e r n a t e t e r m s of the F i b o n a c c i s e n+2
n+1
n
quence
1 , 1 , 2 , 3, 5, 8, 13, 2 1 , 34, 55, . . . , F n + 2 = F n + 1 + F n
so that the sequence of cumulative s u m s (including A n ) is
1, 1 + 1 = 2, 1 + 1 + 3 = 5, 1 + 1 + 3 + 8 = 1 3 ,
...,
U ,-, = 3 U in - U which is the other set of a l t e r n a t e F i b o n a c c i n u m n+2

n+1
n
b e r s . The proof of t h e s e s t a t e m e n t s will follow a s a s p e c i a l c a s e of
the t h e o r e m in the following section.
3.
ANOTHER SPECIAL M O D E L
If we a s s u m e that the t i m e g e n e r a t o r is
i n t e g e r ) , the s a m e m o d e l d i s p l a y (1) yields
0(t) = kt (k a positive
1965
FIBONACCI NUMBERS
(3)
AQ
= 1
Ax
= k
A2
= k 2 + 2k
133
A 0 = k 3 + 4 k 2 + 3k
3
k 4 + 6 k 3 + 1 0 k 2 4- 4k
A.
P.(k)
Note:
T h e c o e f f i c i e n t of
of d i s t i n c t c o m p o s i t i o n s
coefficients
in the p o l y n o m i a l
of i n t e g e r
n in
P (k)
is the n u m b e r
positive integers.
a r e a l s o t h e a l t e r n a t e r i s i n g d i a g o n a l s of P a s c a l ' s
The
arith-
m e t i c t r i a n g l e u p w a r d f r o m left t o r i g h t .
We n o w p r o v e t h e f o l l o w i n g t h e o r e m .
Theorem:
If
polynomial
P (k)
where
(f>(t) = k t ,
p, a t t i m e
row a
P 2 ( k ) = k 2 + 2k.
4,
T (k)
nth
satisfying the r e c u r s i o n relation:

P n + 2 ( k ) = (k + 2 ) P n + 1 ( k ) - P n ( k )
.
P , ( k ) = k and
Let
t h e n m o d e l d i s p l a y (3) h a s a s i t s
PROOF OF THE THEOREM
be t h e t o t a l n u m b e r of p a r t i c l e s p o s s e s s i n g p r o p e r t y ,
,, (k) = T (k) + A ., , w h i l e c o l l e c t i v e l y
}
n+1
n
n+1 '
t h e T (k) p a r t i c l e s c o l l i d e w i t h A t 1 n e w rp a r t i c l e s d u r i n gto t h e n e x t
n
n+1
time interval, each particle collides with k m o r e new p a r t i c l e s than
t = n.
Clearly
during the p r e v i o u s t i m e i n t e r v a l so that

<4>
Thus,
n+2
since
(5)
<Tn(k>
A ,, = T
n+1>
n+1
- (k) - T (k)
Tn+2(k)
kT
n+l<k)
K+l
'
e q u a t i o n (4) y i e l d s
(k+2)Tn+1(k)-Tn(k)
But, s i n c e
A ,, = T ,, (k) - T (k) i s t h e d i f f e r e n c e of t w o s o l u t i o n s of
n+1
n+1
n
2
(5), i t i s a l s o a s o l u t i o n o f (5). N o w , A = k = P 1 ( k ) a n d A 2 = k + 2 k = P 2 ( k )
and the proof is c o m p l e t e .
6
<>
If
n+2
k = 1, t h e n (5) b e c o m e s
=
3U
n+l "
If U, = P , ( l ) = 1, a n d U ? = P ? ( l ) = 3, t h e n t h e n u m b e r s g e n e r a t e d a r e
t h e a l t e r n a t e F i b o n a c c i n u m b e r s p r o m i s e d a f t e r (2), w h i l e
U Q = T Q ( 1 ) = AQ = 1, a n d
Uj = T ^ l ) = \
+ \
= 1 + 1 = 2
134
April
r e c u r s i o n r e l a t i o n (6) yields the other set of a l t e r n a t e Fibonacci n u m b e r s a s the sequence of cumulative suras, the total p a r t i c l e count.
5.
CONCLUDING REMARKS
One is d i r e c t e d to advanced p r o b l e m H-5Q D e c e m b e r 1964, F i b onacci Q u a r t e r l y , for the partitioning i n t e r p r e t a t i o n of the i n t e g e r

the model for
n of
<p(t) - kt.
Suppose one defines two s e t s of Morgan-Voyce polynomials

b Q (x) = 1, b } (x) = 1 + x; B Q (x) = 1, B ^ x ) = 2 + x
both sets satisfying

(7)
n+2
( x ) = (X + 2 ) P
n+l(x) " Pn(x)j
It is e a s y to e s t a b l i s h that
P (k) = A = k B , (k)
n
n
n-1
T (k) = An + A, + . . . + A = b (k)
n
0
1
n
n
Thus for k = 1, we again find B ,(1) = F n

and b (1) = F~ ( 1 . See
n-1
2n
n
2n+l
c o r r e c t e d p r o b l e m B-26 with solution by Douglas L i n d i n t h e E l e m e n t a r y
P r o b l e m Section of this i s s u e , w h e r e the binomial coefficient r e l a t i o n
mentioned in the note of Section 3 is shown.
A future p a p e r by Prof.
M. N. S. Swamy dealing extensively with M o r g a n - Voyce polynomials will

a p p e a r in an e a r l y i s s u e of the Fibonacci Q u a r t e r l y .
Acknowledgment:
The author is completely indebted to Dr. V. E.
Hoggatt, J r . , for bringing to his attention the t h e o r e m and its proof.

Additional r e f e r e n c e s to work along the lines of g e n e r a t e d c o m p o s i tions - some of which yield n u m b e r s with Fibonacci p r o p e r t i e s w i l l
be found in the r e f e r e n c e s at the end of this p a p e r . (See note, page 94)
REFERENCES
H. Winthrop "A T h e o r y of B e h a v i o r a l Diffusion" A contribution to the
M a t h e m a t i c a l Biology of Social P h e n o m e n a .
Unpublished t h e s i s s u b -
m i t t e d to the Faculty of The New School for Social R e s e a r c h , 1953.

H. Winthrop,
"Open P r o b l e m s of I n t e r e s t in Applied M a t h e m a t i c s , "
M a t h e m a t i c s Magazine, 1964, Vol. 37, pp. 112-118.

H. Winthrop,
"The Analysis of T i m e - F l o w Equivalents in Finite Dif-
f e r e n c e Equations Governing Growth" (In p r e p a r a t i o n ) .

xxxxxxxxxxxxxxx
MYSTERY PUZZLER AND PH!

MARVIN H. HOLT
Wayzata, Minnesota
A p r o b l e m p r o p o s e d by P r o f e s s o r Hoggatt is as follows:
Does
t h e r e exist a p a i r of t r i a n g l e s which have five of t h e i r six p a r t s equal

but which a r e not c o n g r u e n t ?
(Here the six p a r t s a r e the t h r e e sides
and the t h r e e a n g l e s . ) The initial impulsive a n s w e r is no J The p r o b lem a l s o a p p e a r s in | 1 | as well as in the MATH LOG.
I have taken some time to work on the problem you suggested.
I think you will a g r e e that the solution I have is i n t e r e s t i n g .
lem,
One p r o b -
as you have stated it, is posed in a high school g e o m e t r y text
entitled, " G e o m e t r y " b y M o i s e and Downs, published by Addison Wesley

Company, (page 369)*
In t h e i r solution key, they gave one possible p a i r of t r i a n g l e s
that work:
I d i s c o v e r e d this after I solved the p r o b l e m myself.
But the above
solution does not do j u s t i c e to the p r o b l e m at all, since m y old friend

r is r e a l l y the key to the solution.
Note: Golden Mean = 96 = r in what
follows.
I attacked the p r o b l e m as follows: F i r s t , the five congruent p a r t s
cannot contain all t h r e e s i d e s ,
gruent,
since the t r i a n g l e s would then be con-
T h e r e f o r e , the five p a r t s m u s t be t h r e e angles and two sides
which m e a n s that the two t r i a n g l e s a r e s i m i l a r .
But, the two sides
cannot be in c o r r e s p o n d i n g o r d e r , or the t r i a n g l e s would be congruent

e i t h e r by ASA or SAS. So, the situation m u s t be one of two p o s s i b i l i t i e s
as I have sketched below:
(My s k e t c h e s a r e not to s c a l e . )
135
136
MYSTERY P U Z Z L E R AND PHI
April
triangle 2
triangle 1
possibility 1
possibility 2
In both c a s e s , by using r e l a t i o n s h i p s from s i m i l a r t r i a n g l e s , it follows
that |:=
or b = ka and c = kb = k a from p o s s i b i l i t y 2 and ~ = 3 or
2
b d
b = ka and d = kb = k a from p o s s i b i l i t y 1.
So, the t h r e e sides of the t r i a n g l e m u s t be t h r e e consecutive
2
m e m b e r s of a g e o m e t r i c s e r i e s : a, ak, ak , w h e r e k is a p r o p o r t i o n ality constant and k > 0 and k ^ 1. If k = 1, the t r i a n g l e s would both
be e q u i l a t e r a l and thus congruent. T h e r e f o r e , k / 1.
F r o m m y p r e v i o u s a r t i c l e on the Golden Section (Pentagon, Spring
1964) I worked out two p r o b l e m s on right t r i a n g l e s w h e r e the sides
f o r m e d a g e o m e t r i c p r o g r e s s i o n and the c o n s t a n t s t u r n e d out to b e / ^ "
and y , So, I knew of two m o r e situations w h e r e the o r i g i n a l p r o b l e m
could be solved.
Then I began to c o n s i d e r v a r i o u s other values of k
and I began to wonder what values of "kM will work. In other w o r d s , for
what values of k will the n u m b e r s
a, ak, and ak
be sides of a t r i -
a n g l e . Once we know t h i s , then another t r i a n g l e with s i d e s ^ , a, ak

k
2
3
or ak, ak , ak w i l l h a v e five p a r t s congruent but the t r i a n g l e s would
not be congruent.
I n o r d e r f o r a, ak and ak to be sides of a t r i a n g l e , t h r e e s t a t e m e n t s m u s t be t r u e :
1965
137
These a r e i n s t a n c e s of the s t r i c t . t r i a n g l e inequality.

1.
a + ak > a k 2
(a + b > c)
2.
a + ak > ak
3.
ak + ak
[a > 0,
(a + c > b)
(b + c > a)
> a
k^l]
k > 0,
For Case 1, consider k > 1

k > 1>k
(a)
t h e r e f o r e , a + ak
(b)
if
> k
> ak (condition 2 above)

k > l>k + 1 > 1>k
t h e r e f o r e , ak
(c)
> k ->1 + k
+ k >1
+ ak > a (condition 3 above)
k >1
show
(condition 1 above)
a + ak > ak
This p a r t r e v o l v e s around the p r o b l e m of finding out when 1 + k > k ,

2
or, graphically: F o r what x > 1 will 1 + x = y be above y = x ?
p_^-
Jf Y =
2
1 +x
y = x
2
Solving this p r o b l e m p r o d u c e s the r e s u l t that

k <
or_
k < r .
2
So, if 1 < k < r then the n u m b e r s a, ak, ak a r e the sides of the
a
2
3
t r i a n g l e that can be m a t c h e d with -- , a, ak or ak, ak , ak to solve
the o r i g i n a l p r o b l e m . (Incidentally: 1 < v ^ < r . So this fits i n h e r e . )
F o r Case 2, c o n s i d e r k < 1
138
(b)

z
z
if k < 1->k < k ~ > k < k + 1 T h e r e f o r e ak < ak + a
(condition 1)
if k < 1 > 1 + k > 1 >a + ak > ak (condition Z)
(c)
Now, if k < 1 show ak + ak
(a)
April
> a.
This i s ,
essentially,finding
what values of k m a k e k + k > 1.

Again, graphically, for what x < 1 will the p a r a b o l a
be above the line y = 1 ?
y =x +x
pX7p
m
y=l
X=1
-1 + /5~
Solving this p r o b l e m p r o d u c e s the r e s u l t that k >
~
. If you
will follow this closely, -1 +^ / 5 is the additive i n v e r s e of the conjugate
of ^ .
(i. e, j r =
Therefore,
and its additive i n v e r s e is
the conjugate of
I
/"cT
14-
-=
. ) So, if
_L
r is
/C,
< k < 1 the p r o b -
-1 + v/5
/l
lem is again solved. (Again,
< 1, so m y second p r o b l e m
fits h e r e . )
T h e r e f o r e , the complete solution can_be s u m m e d up as follows,
1 + \/5
- I + /5
if k is a n u m b e r such that 1 < k <
^
= r or
^
< k < 1.
Then the t h r e e s e t s of t r i a n g l e s with sides -r- , a, ak or a, ak, ak
or ak, a k 2 , or a k 3 can be used to produce two t r i a n g l e s with five
p a r t s equal and the t r i a n g l e s t h e m s e l v e s not congruent.
So, t h e r e a r e an infinite n u m b e r of p a i r s of t r i a n g l e s that solve
this p r o b l e m and once again, r p r o v e s to be an i n t e r e s t i n g n u m b e r
and a key to the solution of i n t e r e s t i n g problems,,
1.
REFERENCES
Moise and Downs, G e o m e t r y , Addison-Wesley, p. 369.
xxxxxxxxxxxxxxx
LADDER NETWORK ANALYSIS USING POLYNOMIALS

JOSEPH ARKIN
Spring Valley, New York
In this p a p e r we develop some ideas with the r e c u r r i n g s e r i e s

(1)
= k, B , + k^B OJ
B n = 1, (k. and k 0 / 0) ,
n
1 n-1
2 n-2
0
1
2 ' '
and show a r e l a t i o n s h i p between this sequence and the simple network
of r e s i s t o r s known as a Ladder-network.
The l a d d e r - n e t w o r k in F i g u r e 1 is an i m p o r t a n t network in c o m munication s y s t e m s .
The m - L
sections in c a s c a d e that m a k e up this
network can be c h a r a c t e r i z e d by defining:

(2)
a) the attenuation (input voltage/output voltage)

b) the output impedance
= z ,
c) the input impedance
e1
R,
= A,
R,
R,
"1
-O-t*
R~
>
R_
R.
* - .
Figure 1
A r e s u l t obtained by applying Kirchhoff's and Ohm's Laws to

l a d d e r - n e t w o r k s with m = 1, 2, 3, . . . , R, = 'R~k-, was tabulated with
the r e s u l t s in Table 1, w h e r e setting k, = 1, R- = 1 ohm, the network
in F i g u r e 1 was analyzed by inspection [1] .
139
140
ApriL
LADDER NETWORK ANALYSIS

m
0
Rn
(k^l)
VMR2
(k^+3^+1)
(kx+l)R2
k x + 3 k +1 \ R
~k+Z~
k^+3k1+l\R2
'^+5^+6^+1 \ R
(^+5^+6^+1)
k^+4kx+3y
k^+4k1+3
Table 1
We o b s e r v e t h a t t h e
z
m
n
(C
nth
r o w i n T a b l e 1, m a y be w r i t t e n
A
C9
2n
2n-2/y2n-l)R2
(C
2iA2n-l)R2
where,
(3)
x
'
a)
b)
yr
= k
1/2
;
C , + C 9,
1
n-1
n-2
k, '
n - 1 + yn - 2 '
It t h e n r e m a i n s t o s o l v e f o r
Cn
0
y
1/2
= IA;
and C
i n (3), t o be a b l e t o a n a l y z e
n
n
( F i g u r e 1) by i n s p e c t i o n f o r a n y v a l u e of k (k ^ 0), w h e r e R = 1 o h m .
So t h a t , i n (1), w e l e t
(4)
y
J
a)
w =
(k L + (k* + 4 k 2 ) l / 2 ) / 2
b)
(k x - ( k 2
+4k2)l/2)/2
w h e r e it i s e v i d e n t ,
c)
k,
d)
k~
W + V
and
= - wv
T h e n , c o m b i n i n g (c) a n d (d) w i t h (1), l e a d s t o

(5)
((w
B
B
, - wv(w-v)B
)/(w-v)
n-l
n - L9
o o
2 2
= ((w ~v )B 0 - w v (vw - v )B
o)/(w-v)
n-2
' n-3"
- v )B
= ((w
- v )(w+v) - w v ( w "
- v
,
i
)B0)/(w-v)
1965
USING P O L Y N O M I A L S
and we have
,_
n+1
(6)
141
n+1
= --a
w - v
1/2
W h e r e , i n (1) w e r e p l a c e k, w i t h k, '
and
i n g t h i s r e s u l t w i t h (3) a n d (6), l e a d s t o
(k;/2
(7)
a)
and
with
1, a n d c o m b i n -
k1+4)i/2)n+1-(k!/2-(k1+4)1/2)n+1
'
1/2 n + l
((k +4) ' ) 2 n
. /,,
= ^(k^/k}^
b) y n
(8)
k9
=0(k1),
l
Theorem.
T h e a t t e n u a t i o n ( i n p u t v o l t a g e / o u t p u t v o l t a g e = A) of
m-L
tions in c a s c a d e in a l a d d e r - n e t w o r k is given by
2m-2
A2
c ((-c7
)/c9
7)
^
r
2m-l"
2m-2 '
r=0
T h e p r o o f of t h e t h e o r e m r e s t s on t h e f o l l o w i n g
(9)
Lemma,
The power
series
n
(-l)
is always a square, where
Brxr
r =0
is defined i n . ( l ) .
P r o o f of l e m m a ,
Let
n
1 = (1-kjX - k2x2)( 1
(10)
Brxr)
r=0
t h e n , b y c o m p a r i n g c o e f f i c i e n t s a n d b y (1), w e h a v e
- ( B k. + B , k 9 )
n 1
n-.l 2 '
X =
_
n 2
,, . .
(11)
and r e p l a c i n g
(12)
x
'
x with
l-klX-k0x2
1 2
(-B
>i)/(B
?)
in
-B
,.
n+1
= - _ n 2
2
^-kj^-k?*1 ^
l e a d s
= x( B 2 k + B B ^ . k , - B 2 x 1 ) ,// (v B 2 k 9 )
n 2
n n+1 1
n+l
n 2'
B y (4, d) a n d (6) it i s e a s i l y v e r i f i e d
to
sec-
142
LADDER NETWORK ANALYSIS
(13)
B2 - B ,.B . = (-k-)n
n
n+1 n-1
2
so that
(14)
x
'
April
B 2 k + B B . . k . - B 2
= x( - l ) n k ^ + 1
n 2
n n+1 1
n+1
'
2
Then, r e p l a c i n g the n u m e r a t o r in (12) by the r e s u l t in (14) leads to

1-k x - k ? x 2
(15)
= ((-l)nk*)/B2
so that (10) m a y be w r i t t e n a s
n
n
(16)
(-l) B
B xr
r
r=0
which c o m p l e t e s the proof of the l e m m a .
(17) The proof of the t h e o r e m is i m m e d i a t e , when in (11) and (16), we
. _ .
__
__
r e p l a c e n with 21X1-23, k, with k , ' , k ? with 1, and combine the
r e s u l t with (7, a) and the values of the attenuation in Table 1.
REFERENCES
1.
a) S. L. Basin, "The A p p e a r a n c e of Fibonacci N u m b e r s and the

Q M a t r i x in E l e c t r i c a l Network Theory, " Math Mag. , 36(1963)
pp. 84-97 0
b) S. L. Basin,
"The Fibonacci Sequence as it A p p e a r s in Na-
t u r e , " Fibonacci Q u a r t e r l y , 1(1963) pp. 5 4 - 5 5 .

The author e x p r e s s e s his gratitude and thanks to P r o f e s s o r L.
Carlitz,
Duke University;
Professor
V. E. Hoggatt, J r . ,
San J o s e
State College; and the r e f e r e e .

XXXXXXXXXXXXXXX
REQUEST
The F i b o n a c c i Bibliographical R e s e a r c h Center d e s i r e s that any
r e a d e r finding a Fibonacci r e f e r e n c e , send a c a r d giving the r e f e r e n c e
and a brief d e s c r i p t i o n of the c o n t e n t s . P l e a s e f o r w a r d all such inf o r m a t i o n to:
Fibonacci Bibliographical R e s e a r c h C e n t e r ,
Mathematics Department,
San J o s e State College,
San J o s e , California
CONCERNING LATTICE PATHS AND FIBONACCI NUMBERS

DOUGLAS R. STOCKS, JR.
Arlington State College, Arlington, Texas
R s E. Greenwood [1] h a s investigated plane Lattice paths from

(0, 0) to (n, n) and has found a r e l a t i o n s h i p between the n u m b e r of paths
in a c e r t a i n r e s t r i c t e d s u b c l a s s of such paths and the Fibonacci s e quence.
Considering such paths and using a method of e n u m e r a t i o n
different from that used by Greenwood, an unusual r e p r e s e n t a t i o n of

F i b o n a c c i ' s sequence is suggested.
The paths c o n s i d e r e d h e r e a r e c o m p r i s e d of steps of t h r e e types:
(i) h o r i z o n t a l from (x, y) to (x + 1, y); (ii) v e r t i c a l from (x, y) to (x, y + 1);
and (iii) diagonal from (x, y) to (x + 1, y + 1).
H5
H4
H3
H2
HL
Figure 1
In the i n t e r e s t of s i m p l i c i t y of r e p r e s e n t a t i o n , we will h e r e cons i d e r the paths from
H. to V., for each positive i n t e g e r i.
that the n u m b e r of paths from

(0, 0) to (i, i).
paths from
However,
i n s t e a d of c o n s i d e r i n g the total n u m b e r of
H. to V. as was done by Greenwood,
the n u m b e r of paths from

any of the paths from
n u m b e r of paths from
H. to V..
Note
H. to V. is the n u m b e r of paths from
H. to V. which do not contain as subpaths
H. to V., for
H. . ,
we will count only
to V. ,
j < i.
This n u m b e r plus the
is the total n u m b e r of paths from
The u s e of this counting device suggest the

143
144
CONCERNING LATTICE PATHS
ApriL
Theorem:
Let
iD
= i
= 3
D
L where
+2
D-l
=
denotes the g r e a t e s t i n t e g e r functioi
V2
D-l
+ 3
D-2
(2n) D = ( 2 n ) D - 2 + ( 2 n - l ) D - 2
(2n+l)D = ( 2 n + l ) D ^ + ( 2 n ) D - 1
with the r e s t r i c t i o n that k n = 0 if k > D.
D, let
F o r each positive i n t e g e r
f(D) =
S kD
k=l
The sequence {f(D) ] D = 1, 2, 3, . . . } is the Fibonacci s e q u e n c e .

The proof is d i r e c t and is t h e r e f o r e omitted.
The g e o m e t r i c i n t e r p r e t a t i o n of the n u m b e r s
and f(D) m e n -
tioned in the t h e o r e m is i n t e r e s t i n g . However, before c o n s i d e r i n g this

i n t e r p r e t a t i o n it is n e c e s s a r y to define a s e c t i o n of a path.
p u r p o s e we will now c o n s i d e r a path a s the point set to which p
F o r this
belongs
if and only if for s o m e step ((x, y), (u, v)) of the path, p belongs to the
line i n t e r v a l whose end points a r e (x, y) and (u, v). A section of a path
is a line i n t e r v a l which is a s u b s e t of the path and which is not a subset
of any other line i n t e r v a l each of whose points is a point of the path.
The above mentioned g e o m e t r i c i n t e r p r e t a t i o n follows:
nition f(l) = 1.
F o r each positive i n t e g e r
set of paths from

thepathsfrom
Ln.
L~ denote the
to V n which do not contain a s subpaths any of
H. to V., for
longing to the set

Ln
Hn
D > 2, let
By defi-
j < D. f(D) is the n u m b e r of paths b e -
is the n u m b e r of paths in the subset
X of
such that x belongs to X if and only if x contains a s s u b s e t s
exactly k diagonal s e c t i o n s .
1965
AND FIBONACCI NUMBERS

F i g u r e 2 p o r t r a y s the five paths which belong to
145
L-.
In F i g u r e
2a a p p e a r s the one path of L- which contains only one diagonal s e c tion ( 1 - = 1). The two paths of L- which contain exactly two diagonal
sections a p p e a r in F i g u r e 2b (2- = 2)*
In F i g u r e 2c the two paths of
L c which contain exactly t h r e e diagonal sections a r e shown ( 3 r = 2).

o
5
It is noted that 4_ '= 5 r = 0.
F i g . 2a
f(5)
Fig. 2b
Fig. 2c
25=2
35=2
1 +2+2+0+0 = 5
Figure 2
REFERENCES
1.
R. E. Greenwood,
"Lattice
Paths
and Fibonacci
Numbers,
The Fibonacci Q u a r t e r l y , Vol. 2, No. 1, pp. 13-14.

XXXXXXXXXXXXXXX
NOTICE TO A L L SUBSCRIBERS] I I
P l e a s e notify the Managing Editor 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 Fibonacci Q u a r t e r l y be forwarded

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.
will usually cost about 30 cents for f i r s t - c l a s s p o s t a g e . )
(This
If p o s s i b l e ,
p l e a s e notify us AT LEAST THREE WEEKS PRIOR to publication d a t e s ;

F e b r u a r y 15, A p r i l 15, October 15, and D e c e m b e r 15.
REPLY TO EXPLORING FIBONACCI MAGIC SQUARES*

JOHN L . BROWN, JR.
Pennsylvania State University, State College, Pennsylvania
Problem.
F o r n > 2, s h o w t h a t t h e r e do n o t e x i s t a n y n x n m a g i c
s q u a r e s w i t h d i s t i n c t e n t r i e s c h o s e n f r o m t h e s e t of F i b o n a c c i n u m b e r s , u , = 1, u , = 2, u , n = u . , + u f o r n > I .
1
2
n + 2 n+1 n
Proof.
T r i v i a l for
If a n n x n
n = 2.
magic
Fibonacci entries,
s q u a r e e x i s t e d for
some
n > 3 with distinct
then the r e q u i r e m e n t that the f i r s t t h r e e c o l u m n s
a d d to t h e s a m e n u m b e r w o u l d y i e l d t h e e q u a l i t i e s :
(*) F . + F .
1 2
+. . . + F.
n
= F . + F . +. . . + F . = F 1
+ F . +. . . + F .
.
J
J
J
l
2
n
1
2
n
S i n c e t h e e n t r i e s a r e d i s t i n c t , w e m a y a s s u m e w i t h o u t l o s s of g e n e r ality that F . > F . > . . . > F . , F . > F . > . . . > F . a n d

X
F
k, >
1
k >
2
2
F
' >
k
n
Noting t h a t the c o l u m n s c o n t a i n no c o m m o n e l e m e n t s , and by r e a r r a n g e m e n t if n e c e s s a r y , w e a s s u m e
F. > F. > F
generality; thus,
Now
, again without losing
F. > F
+ 2.
1
k
l
l
F.
+ F.
i,
i9
+ . . . + F.
> F . > F,
i ^ i , -
,-
k, +2
while
k
F
k,
1
+F
k +--2 ?
+F
2 1
T h i s c o n t r a d i c t s t h e e q u a l i t y p o s t u l a t e d i n (*), a n d w e c o n c l u d e no m a g i c
s q u a r e s in distinct F i b o n a c c i n u m b e r s a r e p o s s i b l e .
The Fibonacci Q u a r t e r l y ,
O c t o b e r 1964, P a g e 216.
xxxxxxxxxxxxxxx
146
THE FIBONACCI NUMBER F u WHERE u IS NOT AN INTEGER

ERICHALSEY
Redlands, California
INTRODUCTION
Fibonacci n u m b e r s , like f a c t o r i a l s , a r e not n a t u r a l l y defined for
any values except integer v a l u e s . However the gamma, function extends
the concept of f a c t o r i a l to n u m b e r s that a r e not i n t e g e r s .
that (l/Z)I = ^/JT/2.
F
for any i n t e g e r
rational number
Let
n but which will f u r t h e r m o r e
give
f(x, y) = x ^
= 1 (Definitions (1) hold for all n c N)
Let
rdjL
(read "n c a r d i n a l " )
= 2
k^
= 2
k=l
This gives the c a r d i n a l n u m b e r s 1, 2, 3,
Let
2
n$
1 = n
k=l
1
(read "n t r i a n g u l a r " )
2 k$
k=l
= 2 k
k=l
This gives the t r i a n g u l a r n u m b e r s 1, 3, 6, 10,

Let
...
n
n$3
(read "n t e t r a h e d r a l " )
k^2
k=l
This gives the t e t r a h e d r a l n u m b e r s 1, 4, 10, 20, . .
In g e n e r a l , let
n
n$
give
for any
and d e -
w h e r e x and y need not be i n t e g e r s 0
DEFINITIONS
n$
u. The a r t i c l e also defines a quantity n $
velops a function
(1)
Thus we find
This a r t i c l e develops a function which will
(read "n d e l t a - s l a s h m") = 2

k$
k=l
147
148
April
WHERE u
u
This gives a figurate n u m b e r s e r i e s which can be a s s i g n e d to the
THE FIBONACCI NUMBER F
m - d i m e n s i o n a l analog of the t e t r a h e d r o n (which is the 3 - d i m e n s i o n a l

analog of the t r i a n g l e , etc. ).
Let us c o n s t r u c t an a r r a y
( a. .), w h e r e we a s s i g n to each
a. .
an a p p r o p r i a t e coefficient of P a s c a l ' s t r i a n g l e .
(a.
.)
i,3
10
15
10
20
35
15
35
70
It is c l e a r that in this a r r a n g e m e n t the usual rule for forming P a s c a l ' s

t r i a n g l e is just
a. . = a. . - + a. . .
(2)
But a c o m p a r i s o n of this rule with the definitions (1) shows that P a s c a l ' s
t r i a n g l e can be w r i t t e n :
where
a1
i^2
2#
2jLl
2 /
3^
3JL1
3fi2
n(L
n$
i<
...
2 ^
3Ar
a. . = iA
a. . = a. 1..
iJ
J*
(3)
1/
F r o m the s y m m e t r y of P a s c a l ' s t r i a n g l e ,
Therefore
i^"1
= j^1"1;
nfi = (m+l)^ 1 1 " 1
P a s c a l ' s t r i a n g l e is a well-known g e n e r a t o r of Fibonacci n u m b e r s in

the way shown in the following d i a g r a m .
1965
IS NOT AN INTEGER
149
/ / / / /
1 / 1 / 1
1 = 1 = F,
1 = 1 = F_
10
15
1+1
10
20
35
1+2
15
35
70
1+3+1 = 5 = F r
We can apply the s a m e c o u r s e to our a b s t r a c t e d P a s c a l ' s t r i a n g l e .

/ / /
^0
3^ /3tLl
3^
F 3 = 3<X + l ^ 1
F 4 = 4^ + Zfk1
It is c l e a r that, if we keep forming Fibonacci n u m b e r s from P a s c a l ' s

t r i a n g l e in this way, F = n ^ + (n-2)$ + (n-4)$ + . . . + ( n - 2 m ) $ , or
(4)
(n-2k) K
k=0
w h e r e we r e q u i r e that m b e a n i n t e g e r and that 0 < n - 2 m . < 2, or in

other w o r d s that n / 2 - 1 <_ m < n / 2 .
(5) T h e o r e m 1
Proof:
E(n).
Now let us prove
^m _ ( n + m - 1 ]
It is sufficient to p e r f o r m induction on n.
Then if n = 1, E(l) s t a t e s
/ n + m - l \ _ / l + m - l \ _ mj_
\
m /
\ m /
ml
_ .
Let the t h e o r e m be
150
B u t b y d e f i n i t i o n (1), ( m + l ) $
t i o n (3)
1^
= 1
for
= 1 for any
WHERE u
(m+1) t N .
m = 0, 1, 2, 3, . . .
let us a s s u m e that, for a r b i t r a r y

n
Mm
and
m i N, E(n)
April
Then by e q u a -
E(l)
is t r u e .
is t r u e .
Then
Now
/n+m-l\
= (
m
)
F r o m t h e d e f i n i t i o n s (1) it c a n be s e e n t h a t
. vm - 1
. *m - 1
Mm - 1 .
1$
+ 2^
+ . . . + nfi
^m
= n^k
T h e r e f o r e t h e i n d u c t i o n h y p o t h e s i s c a n be r e s t a t e d
if1
(6)
Add
+ Z ^ ' 1 + . . . + ( ^ m I 2 ) = (n+-1)
) t o b o t h s i d e s of e q u a t i o n (6) t o o b t a i n
lA""1 iZfi"-1 + . . . +("l m i 2 ) + (i"i')
(7)
The right-hand
s i d e of e q u a t i o n (7) i s
for c o m b i n a t i o n s ,
) by t h e s t a n d a r d i d e n t i t y
so we have
or
m 1
m 2
I^ 111 - 1 + z^ - + ... +( ^ i )+(
(n+
^!!r" 2 )
((n+l)+m-l\
which is
E(n+1).
Therefore
E(n)
implies
E(n+1)
and T h e o r e m 1 is
t r u e by m a t h e m a t i c a l i n d u c t i o n .
Now l e t u s p r o v e
1
(8)
Theorem 2
n^
= [(n+m) f
xn'l(l
-x)mdx J"1
0
Proof:
r(n) = (n-l)I
B ( m , n)
( g a m m a function)
= B(n, m )
= -1 . ' ~}--
(beta function)
1965
IS NOT AN INTEGER
151
Therefore
1
_
r(m-fn)
B(m, n) " r(m)r(n)
'
and
1
, n-m+1)
(n
r(n+2)
r(m+l) r(n-m+l)
4 ^ v , = (n+l) C)
(n+l)!
ml (n-m)!
ml (n-m):
Then
(9)
w /
(n)
\m/
= 7-xrvoT-4i
m = [(n+l)B(m+l,n-m+l)] "l
(n+l )B(m + l, n-m+1)
Lx
'J
We can now substitute the right-hand side of equation (5) into equation
(9) to obtain
n m
= (n+_1) = [(n+m^m+^n)]-1
where
-,
B(m+l,n)
= B(n 5 m + 1) = J
x111 (1-x) m dx
0
Therefore
1
n
x11"l (1 - x ^ d x ] " 1
= [(n+m) J
0
Both equations (5) and (8) a s s e r t that n $
= (m+l) " . Some inter-
esting special cases of equation (5) are
JD
^
vl
=
=
/n-l\
(o)
/ n\
(n-l)I
k^nr
n!
( l ) = (n-l)ill
=l
=
'
and
_/
n + 1
( n + 1 )i
_ (n)(n+l)
k=l.
Now we can put equation (8) into equation (4) to obtain
152
WHERE u
April
u
1
(10)
Fn -
[(n-k) J
k=0
2k-F
x n -
^l-x^dx]"1
w h e r e m is an i n t e g e r , n / 2 - 1 < m < n / 2 .
But w h e r e a s equations
(4) and (5) have m e a n i n g only for i n t e g e r a r g u m e n t s , equations (8) and

(10) can be used to find
x$/
and F
w h e r e x, y, and u a r e any
rational numbers.
In p a r t i c u l a r
m
(11)
F,
1 [<u-k) J
k=0
x^^^d-x^dx]"
w h e r e m is an i n t e g e r , u / 2 - 1 < m < u / 2 e The equation (11), and

the definite i n t e g r a l in it, a r e e a s i l y p r o g r a m m e d for solution on a
digital c o m p u t e r . A few values of F
follow.
4. 1000000
4. 2000000
4. 3000000
4. 4000000
4. 5000000
4. 6000000
4. 7000000
4. 8000000
4. 9000000
5. 0000000
5..1000000
5* 2000000
5. 3000000
5. 4000000
5. 5000000
5,.6000000
5. 7000000
5, 8000000
58.9000000
6. 0000000
3. 1550000
3. 3200000
3.4950000
3. 6800000
3. 8750000
4. 0800000
4. 2950000
4. 5200000
4. 7550000
5. 0000000
5. 2550000
5. 5200000
5. 7950000
6. 0800000
6. 3750000
6. 6800000
6.,9950000
7. 3200000
7, 6550000
8. 0000000
xxxxxxxxxxxxxxx
0. 1
0.2
1.0
1.0
1.0
1. 1
1.2
2.0
2. 1
4.0
3.0
ELEMENTARY PROBLEMS AND SOLUTIONS

Edited by A.P. HILLMAN
University of Santa Clara, Santa Clara, California
Send all c o m m u n i c a t i o n s r e g a r d i n g E l e m e n t a r y P r o b l e m s and

Solutions to P r o f e s s o r A. P . Hillman, M a t h e m a t i c s D e p a r t m e n t ,
v e r s i t y of Santa C l a r a , Santa C l a r a , California.
Uni-
Any p r o b l e m believed
to be new in the a r e a of r e c u r r e n t sequences and any new a p p r o a c h e s

to existing p r o b l e m s will be w e l c o m e d .
The p r o p o s e r should submit
each p r o b l e m with solution in legible form, p r e f e r a b l y typed in double

spacing with n a m e and a d d r e s s of the p r o p o s e r as a headinge
Solutions to p r o b l e m s should be submitted on s e p a r a t e s h e e t s in
the f o r m a t used below within two months of publication.
B-64
California
Show that
L L ,, = L~ , , + ( - 1 ) . w h e r e L is the n-th
n n+1
2n+l
n
n u m b e r defined byy L, = 1, L 0 = 3, and L l 0 = L M + L .
1
2
n+^
n+1 n
B-65
Let u
and v be s e q u e n c e s satisfying
n
n
v . T+CV ,, +dv =0 w h e r e a, b, c, and d
n+Z
n+1
n
A
% 7
(E 2 +aE+b)(E 2 +cE+d) = E 4 + p E +qE + r E + s . Show
y
7
B-66
j / i p y j-2+qy
n+4
r/
n+3
n/
.o
n+2
+r
y
7
.i
n+l
+ s
Lucas
California
u , J a u ,,+bu =0 and
n+2
n+1
n
a r e constants and let
that y =u +v
satisfies
Proposed by D.G. Mead, University of Santa Clara, Santa Clara,
California
Find constants p, q, r, and s such that

yn+4+pyn+3+qyn+2+ryn+1+syn = o
is a 4th o r d e r r e c u r s i o n r e l a t i o n f o r the t e r m - b y - t e r m p r o d u c t s y =u v
3
r
J
n n n
of solutions of u l 0 - u M - u = 0 and v , 0 - 2 v ,, -v = 0.
n+2 n+1 n
n+2
n+1 n
B-67
Proposed by D.G. Mead, Uni versity of Santa Clara, Santa Clara,

B
and
California
Find the sum 1' 1 +1 * 2+2 5+3' 12+. . . +F G , w h e r e F ^ = F ,. +F

n n
n+Z n+1 n
Gn+2=2Gn+1+Gn.
153
154
B-68
April
Proposed by Walter W. Horner, Pittsburgh, Pennsylvania
Find e x p r e s s i o n s in t e r m s of Fibonacci n u m b e r s which will gene r a t e i n t e g e r s for the d i m e n s i o n s and diagonal of a r e c t a n g u l a r p a r a l l e l opiped, i. e. , solutions of
2,, 2 , 2
,2
a +b +c = d
B-69
Proposed by Werner E. Hoggatt, Jr., San Jose State College, San Jose,
California
Solve the s y s t e m of simultaneous equations:

xF
xF
where
is the n - t h
,, +yF = x +y
J
n+1 J n
n+2+yFn+l
x2+2xy
Fibonacci n u m b e r .
SOLUTIONS
CHEBYSHEV POLYNOMIALS
B-27
Proposed by D.C. Cross, Exeter,
Corrected
Polynomials
England
and r e s t a t e d from
Vol. 1, No. 4:
The Chebyshev
P (x) a r e defined by P (x) = c o s ( n A r c c o s x).
Letting
(>
f = A r c c o s x, we have
:os <f> - x = P (x),
cos (2$) = 2cos 0
- 1 = 2x
- 1 = P?(x),
cos (3<f>) = 4cos 0 - 3cos <j> = 4x
- 3x = P~(x),
cos (40) = 8 c o s 4 0 - 8 c o s 2 0 + 1 = 8 x 4 - 8x 2 + 1 = P 4 ( x ) ,
It is well known that
P
n + 2< x > =
2xP
n+l<X> " Pn(x>
Show that
P x(x) =
n
m
I
j=0
B. x n ' 2 j
jn
'
etc.
155
155
where
m = [n/2 J ,
the g r e a t e s t i n t e g e r not exceeding n / 2 , and
(1) B
= 2n_1
'
on
(2) B . , , x l = 2 B . . .
- B.
.
j+l,n+l
j+l,n
j,n-l
(3) I f S = | B I + | B . | + . . . + | B
I,
n
' on'
'In1
' mn'
then S
10
n+2
Solution by Douglas Lind, University of Virginia, Charlottesville,
= 2S ,. + S
n+1
n
Va.
By De M o i v r e ' s T h e o r e m ,
(cos <f> + i sin </>) -
cos n 0 + i sin rub
Letting x = cos <fi, and expanding the left side,

/2
= (x + i vl - x )
cosn0+isinn0
.
= 2 (-l) j / 2 (Jx n - j (l - x V / 2
j=o
We equate r e a l p a r t s , noting that only the even t e r m s of the sum a r e
real,
[n/2]
cos n< = P j x ) =
( - l ) k ( 2 ^) x n " 2 k ( l - x 2 )
k=0
We m a y p r o v e from this (cf. F o r m u l a (22), p. 185, Higher T r a n s c e n d tal F u n c t i o n s ,
Numbers,
Vol. 2 by E r d e l y i et al; R. G. Buschman,
Chebyshev P o l y n o m i a l s ,
G e n e r a l i z a t i o n s and
Equations, " Fibonacci Q u a r t e r l y , Vol. 1, No. 4, p. 2) that

(*)
B.
J, n
11 \ - l /
\1L-J-Xf.
H (n-Zj):
F r o m t h i s , we have
(1)
o, n
= 2n~l
"Fibonacci
Difference
156
April
It is a l s o e a s y to show from (*) that

(2)
B. ,,
,,
j+l,n+l
= 2 B. ,,
- B.
.
J+l,n
J, n-1
Now (*) i m p l i e s
B.
= (-1) J | B .
J,n
' j,n'
so that (2) b e c o m e s
( " D j + 1 |1 B .j ++1l , n ++ Jl J = 2 ( - l ) j + 1 |'B .j++Tl , n JI + ( - D J + 1 |'B .j , n -,l
B.,,
,,
= 2
B.,T
B.
..
j + 1 , n+1 '
' j+1, n 1
j , n-1
Summing both sides for j to I =J, we have
(3)
v
'
S ,. = 2 S + S .
n+1
n
n-1
Also solved by the proposer.
A SPECIAL
B-52
CASE
Proposed by Venter E. Hoggatt, Jr., San Jose State College, San Jose,
California
F ^ - F 2 = (x - l ) n + 1 , w h e r e F is the n - t h F i b n-20 n+2

n
n
onacci n u m b e r , defined by F , = F~ = 1 and F 0 = F , + F .
3
1
2
n+2
n+1
n
Showthat
Solution by John L. Broivn, Jr., Pennsylvania
State University,
Identity XXII (Fibonacci Q u a r t e r l y ,
State College,
Pa.
Vol. 1, No. 2, A p r i l 1963,
p . 68) s t a t e s :
F n F m - F n - k. F m+k
,. = ( - l ) n ~ k F,k F m +,.k - n
The p r o p o s e d identity is i m m e d i a t e on taking m = n and k = 2.
More g e n e r a l l y , we have
FZ - F _ F
n
n - k n+k
= (-l)n"kF,2
k
for
0 < k < n
Also solved by Marjorie Bicknell, Herta T. Freitag, John E. Homer, Jr., J.A.H. Hunter,
Douglas Lind, Gary C. MacDonald, Robert McGee, C.B.A. Peck, Howard Walton, John
Wessner, Charles Ziegenfus, and the proposer.
1965
E L E M E N T A R Y P R O B L E M S AND SOLUTIONS
157
SUMMING M U L T I P L E S O F SQUARES
B-53
California
Show t h a t
(2n - 1 ) F ? + ( 2 n - Z)Y* + . . . 4- F ^
_ = F!T
1
2
Zn-1
2n
Solution by James D. Mooney, University of Notre Dame, Notre Dame, Indiana
R e m e m b e r i n g that
I
F, 2 = F F , ,
^
k
n n+1
k=0
we m a y p r o c e e d by i n d u c t i o n .
+ [ > ( n - l ) - 2 ] T\
(2n-3)F2
2
2
n = 1, F , = 1 = F - .
Clearlyfor
[2(n-l) - l] ? \
(2n-4)F2
+ . . . + F ^ ^ ^
. . . + F2n_3 = F
Assume
Then
(2n-l)Fj + . . . + F 2 n _ x = [(2n-3)Fj + . . . + F 2 n _ 3 ]
2n-2
2
2 (v F ? + . . . + F
. = F
9) + F
? +
1
2n-2
2n-l
2n-2
2n-l
F
k=0
F
2n-2
F
2n-2F2n-l
2n-l(F2n-2
<F2n-2
2n-l)2
+ F
2n-1>
2n
2n-lF2n =
=
"
2n-2
'
+ 2F
"
2n-2
F?>
k
k=0
2n-2F2n-l
2n-2F2n-l
+ F
2n-1 =
'
Also solved by Marforie Bicknell, J.L. Brown, Jr., Douglas Lind, John E. Homer, Jr.,
Robert McGee, C.B.A. Peck, Howard Walton, David Zeitlin, Charles Ziegenfus, and
the proposer.
158
April

RECURRENCE RELATION FOR DETERMINANTS
B-54
Proposed by C.A. Church, Jr., Duke University, Durham, N. Carolina
Show that the n - t h
order determinant
ax
-1
a2
-1
a.
~3
-1
(n)
n-1
-1
satisfies the r e c u r r e n c e
f(n) - a f(n-l) + f(n-Z)
Solution by John E. Homer, Jr., La Crosse.
for
n > 2.
Wisconsin
Expanding by e l e m e n t s of the n-th column yields the d e s i r e d r e lation i m m e d i a t e l y .

Also solved by Marjorie Bicknell, Douglas Lind, Robert McGee, C.B.A.
Charles Ziegenfus, and the proposer.
Peck,
AN EQUATION FOR THE GOLDEN M E A N

B-55
From a proposal by Charles R. Wall, Texas Christian University,
Show that x
where
- xF
a = (1 + >/fT)/2, F
Solution by G.L. Alexanderson,
For
Ft. Worth, Texas
- F
, = 0 has no solution tog r e a t e r than a,

n-1
is the n-th Fibonacci n u m b e r , and n > 1.
University of Santa Clara,
n > 1 let p(x, n) = x
- xF
- F
California
, , g(x) = x
- x - 1, and
i ,
n-2
n-3 , - n-4 .
, n-k-1 .
. _
, _
x
h(x, n) = x
+x
+2x
+...+F,x
+...+F
..
0x + F
k
n-2
n-1
It is e a s i l y s e e n that p(x, n) = g(x)h(x, n), g(x) < 0 for - l / a < x < a,
g(a) = 0, g(x) > 0 for
x > a, and h(x, n) > 0 for
is the unique positive root of p(x, n) = 0.
x > 0. Hence x = a
Also solved by J.L. Broum, Jr., Douglas Lind, C.B.A. Peck, and the proposer.
1965
159
GOLDEN MEAN AS A LIMIT

B-56
Proposed by Charles R. Wall, Texas Christian University,
Let
x, , x, . 0 .
1
Z
be the n - t h Fibonacci n u m b e r .
n
byJ x. .. = f(x, ) w h e r e
k+1
k
f(x) =
For
Ft. Worth, Texas
Let x^ > 0 and define

0
. + xF
.
n-1
n
n > 1, prove that the limit of x, as k goes to infinity e x i s t s and
find the limit.
(See B-43 and B - 5 5 . )
Solution by G.L. Alexanderson,
For
\/F
University of Santa Clara, Santa Clara,
California
n > 1 let p(x)

= Xn - xF
rv
in the proof of B - 5 5 ,
p(x) < 0 for
0 < x < ae
- F . . Let a = (1 + \[5)/2.
As
n
n-1
one s e e s that p(x) > 0 for x > a and that
If x, > a, we then have
(x ) > x F + F
= (x
)
k
k n
n-1
k+1
and so x, > x. , , . It is a l s o c l e a r that x, > a i m p l i e s
k
k+1
k
(x. ^ ) n = x, F + F , > a F + F . = a11
k+1
k n
n-1
n
n-1
and hence x, , , > a. Thus x > a i m pr l i e s x > x, > x^ > . . . > a.
k+1
o
o
1
Z
S i m i l a r l y , 0 < x < a i m p l i e s 0 < x < x. < x_ < . . . < a. In both
'
c a s e s the sequence
x , x, , . . . is monotonic and bounded. Hence x,
n
o
1
k
h a s a limit L > 0 as k goes to infinity. Since L s a t i s f i e s
L = n^Y+rr ,
n-1
n
L m u s t be the unique positive solution of p(x) = 0.
Also solved by Douglas Lind and the proposer.
A FIBONACCI-LUCAS INEQUALITY
B-57
Proposed by G.L. Alexanderson,
University of Santa Clara, Santa Clara,
Let F
and L be the n - t h
n
n
b e r r e s p e c t i v e l y . P r o v e that
Fibonacci and n - t h
(F4n/n)n> L2L6L10...
for all i n t e g e r s
n > 2.
L4n_2
California
Lucas n u m -
160
Solution by David Zeitlin,
Minneapolis,
April
Minnesota
Using m a t h e m a t i c a l induction, one m a y show that

n
F
4n
4k-2'
n = 1, 2f
...
k=l
If we apply the well-known a r i t h m e t i c - g e o m e t r i c inequality to the unequal positive n u m b e r s
L OJ
2
L, , L. AJ . . . ,
o
10
L . ,
4n-Z
we obtain for
n = 2, 3,
n
2
4n
__
k=l
4k-2
N/L2L6L10 ...
L ^ ^
which is the d e s i r e d inequality.

Also solved by Douglas hind and the proposer.
XXXXXXXXXXXXXXX
ACKNOWLEDGMENT
It is a p l e a s u r e to acknowledge the a s s i s t a n c e furnished by Prof. V e r n e r
E. Hoggatt, J r . concerning the e s s e n t i a l idea of "Maximal S e t s " and
the line of proof suggested in the l a t t e r p a r t of m y a r t i c l e "On the
R e p r e s e n t a t i o n s of I n t e g e r s as Distinct Sums of Fibonacci N u m b e r s . "
The a r t i c l e
appeared
In Feb*,1965s
H. H. F e r n s
CORRECTION
Volume 3 , Number 1
Page 26, line 10 from bottom of page
V ~+V- / ) +V 7 _ = F Q - F _ = F A = 8
7 , 3 7 , 4 7 , 5
8 7
6
Page 27, lines 4 and 5
F ^ + F . + F , * . . . +F = F ,, -1 (n even)
2 4 6
n
n+1
F Q + F C + F ^ + . . . + F = F ,. -1 (n odd)
3 5 7
n
n+1
ACKNOWLEDGMENT
Both the p a p e r s "Fibonacci R e s i d u e s " and "On a G e n e r a l Fibonacci
Identity, " by John H. Halton, w e r e supported in p a r t by NSF g r a n t
GP2163.
CORRECTION
Volume 3 , Number 1
P a g e 40, Equation (81), the R. H. S. should have an additional t e r m
-
V 2 F
V+2

3 2

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

3 2

Hochgeladen von

Copyright:

Verfügbare Formate

THE CHARACTERISTIC POLYNOMIAL OF A CERTAIN

MATRIX OF BINOMIAL COEFFICIENTS

n+1; for example

denote the c h a r a c t e r i s t i c polynomial of A

In the p r e s e n t paper we prove the t r u t h of ( 1 . 4 ) .

THE CHARACTERISTIC POLYNOMIAL OF A CERTAIN

(A 2 + 1 ) = T < r ) ( s ) = T < n ~ r x n ~ s >

2 x (i+x) (i+2x) - = x (n;r)(n"ts^

THE CHARACTERISTIC POLYNOMIAL OF A CERTAIN

and sum over

( n ; r ) ( n ' t B , < n j t ) ( n k >x "

THE CHARACTERISTIC POLYNOMIAL OF A CERTAIN

k = 1, 2, 3, 4, (3. 2) reduces to (2. 5), (2.6), (2.7), (3.1),

Assuming that (3. 2) holds for the value k we replace x

and multiply the result by x .

The left member becomes

while the right member becomes

This evidently completes the proof of (3. 2).

on the right of (3. 3) is equal to

THE CHARACTERISTIC POLYNOMIAL OF A CERTAIN

q by |3/a we find that

" n d - a - J " 1 pJx) = X < - D r ( a P ) r ( r - 1 ) / 2

T h i s evidently p r o v e s (4. 3).

MATRIX OF BINOMIAL COEFFICIENTS

If we now compare (4. 3) with (4. 1) it is clear that we have proved

It is of interest to note that the particular characteristic values

can be predicted directly as follows.

This shows that

[ l , a, . 0 . , a ] is the characteristic vector c o r r e s -

I< n ! B > ^ = A i + ^ ) = ^n-re+Dr .

it follows from (5, 1) that

Since the right side is independent of r we must have

W. N. Bailey, Generalized Hypergeometric Series, Cambridge,

L0 Carlitz, "A Binomial Identity Arising from a Sorting Problem, "

A RECURSIVE OPERATION ON TWO-DIGIT

Let d be the sum of the digits of the i n t e g e r

i t h a c h S being reduced modulo

Since t h e r e a r e only 100 two-digit i n t e g e r s (with initial z e r o s

this o p e r a t i o n m u s t eventually r e p e a t one or m o r e

i n t e g e r s with the production of one or m o r e c l o s u r e s of the s e r i e s into

The loops c o n s i s t of the i n t e g e r s between the

a s t e r i s k s (**) in the following s e r i e s .

Thus all the n u m b e r s can be g e n e r a t e d from the eleven i n t e g e r s

a r e r e d u c e d modulo 10, two groups a r e formed

loop of one with one a t t a c h m e n t ,

and a loop of four with four

J X Q, so that it takes five digits to g e n e r a t e the set.

THE CHARACTERISTIC POLYNOMIAL OF THE

HOGGATT, JR. and A . P . H I L L M A N

San Jose State College and University of Santa Clara

T. A. B r e n n a n [3] obtained the c h a r a c t e r i s t i c oolynomial for the

P, = [P..].with the binomial coefficient

row and j - t h column.

See [6] and |.7| for

L. C a r l i t z |5J used another method involving some

v e r y i n t e r e s t i n g identities to achieve the s a m e r e s u l t .

we find the c h a r a c t e r i s t i c polynomial for a g e n e r a l i z a t i o n of the

be a second o r d e r homogeneous linear difference equation over

Let a and b be the z e r o s of the

We deal only with the c a s e in which (1) is o r d i n a r y in the s e n s e

of R. F . T o r r e t t o and J. A. Fuchs [ 4 ] , i . e . , we a s s u m e that e i t h e r

of the n-th t e r m s of k-1

solutions of (1) satisfies