I

ELEMENTARY PROBLEMS AND SOLUTIONS m

Proposed de Gran

by Angel Plaza Canada, Spain.

and

Sergio

Falcon,

Universidad

de Las Palmas

EDITED BY RUSS EULER AND JAWAD SADEK

The k-Fibonacci numbers Fn = Fk,n satisfy Fk,n+2 > 1 be a fixed integer. Prove that

kFk,n+1

+ Fk,n, Fk,o =

0, Fk,1

1. Let

Fk
Please submit all new problem proposals and their solutions to the Problems Editor, DR. RUSS EULER, Department of Mathematics and Statistics, Northwest Missouri State University, 800 University Drive, Maryville, MO 64468, or by email at reuler@nwmissouri.edu. All solutions to others' proposals must be submitted to the Solutions Editor, DR. JA WAD SADEK, Department of Mathematics and Statistics, Northwest Missouri State University, 800 University Drive, Maryville, MO 64468. If you wish to have receipt of your submission acknowledged, please include a self-addressed, stamped envelope. Each problem and solution should be typed on separate sheets. Solutions to problems in this issue must be received by August 15, 2011. If a problem is not original, the proposer should inform the Problem Editor of the history of the problem. A problem should not be submitted elsewhere while it is under consideration for publication in this Journal. Solvers are asked to include references rather than quoting "well-known results". The content of the problem sections of The Fibonacci Quarterly are all available on the web free of charge at www.fq.math.ca;.

[~]
'\"

L.,( -1) j --. )=0 n- J

n (n - J)
.

F2n-3).

The Fibonacci

numbers

Fn and the Lucas numbers

Ln satisfy 0, F1

Fn+2
Also, a

(1

VS)/2, (3 =

Ln+2 Ln+1 + Ln, Lo 2, 1. (1 - VS)/2, Fn = (an - (3n)/V5, and Ln

= =

Fn+1 + Fn, Fo

= =

= L1 =

1;

k= 1

I: V~+
n

F2

) Fk

IT (1 + Fl) k=1
n

1/2n :S FnFn+l

an

+ (3n
Proposed Sciences, by Carsten Elsner' Hannover, Germany. and Martin Stein, University of Applied

2 (-1)n F'n+1 F2n-1 - F4 = ~,,-IL 2 n

;)

2n

+ ()n] -1

Let (an)n2:1 be a sequence of positive integers. for n 2>2. Prove that

Let qo = 1, ql

a1 and qn

anqn-1

+ qn-2

qo + q1 + .. , + qm-] Fm+ - 1 -------:S ---- 2 qm Fm+1

Solution by Rebecca SC 29150

A. Hillman,

University

of South

Carolina

Sumter,

Sumter,

B-1061

Proposed by H.-J. Seiffert, (Vol. 48.1, February 2010)

Berlin,

Germany

Substituting g(n) into an expression various values of n, it is seen that

and using the basic formula,

Fn+2

1 4g ;) [() n

+2

- 7g(n

1) - 9g(n ))

=;)1 [2 n+4 4F
1 = ;)[4(3Fn+1

2 - 3Fn2 3 - 12Fn+2 - 16Fn2 1 - 9Fn2 + + l

+ 2Fn)

- 3(2Fn+1

+ Fn)

- 12(Fn+1 + Fn)

- 16F~+1 - 9F~] 1 2 = ;)[-4Fn+1 Solution by Jay Hendel, University of Pardubice, Towson University, The Czech Republic Towson, MD and (independently). Jaroslav Seibert, = -[F~+l = -(Fn+1
=

12Fn+1Fn

- 8Fnl

- 3Fn+1Fn - 2Fn)(Fn+1

+ 2F~1
-

Fn)

We will prove the given formula by induction on n. side of the equality. It is easy to see that S(I) = p,F?

Let S(n) denote the sum on the left 1. Suppose that the equality is true

Fn-2}'n-1.
is the product of two consecutive Fibonacci numbers,

for a positive integer n, and show that it is also true for n

1. Fn +(_I)LniIJFn+1)Fl~+1 Fn+1 Fn+2 F

Therefore, [4g(n+2)-7g(n+ namely, Fn-2Fn - 1.

1) - 9g(n)J!4

S(n+l)=

(s(n)+(_lr~IJFn+l)}~+l= Fn+2

n ((_1)L :/J -1)

F2

= =
using Cassini's
I

(_I)Ln2IJFn+l
F
n+2

(FnFn+2 F2
n+J
lI

n+l

(_I)ln2IJFn+1(F
n+2

n n+2

_ F2

n+1

Also solved by Brian Beasley, Scott Brown, Paul S. Bruckman, Charles Cook, Kenneth Davenport, Sergio Falcon and Angel Plaza (jointly), G. C. Greubel, Jay Hendel, Harris Kwong, Jaroslav Seibert, David Terr, and the proposer.

(_I)Ln2

J(_1)1I+1 F +1
FlI+2 ([1]; identity (29))
=

n I If n is even then (_I)L 2 J(_I)n+l n I (_I)l 2 J(_1)n+l = (-I)L"2 J = (-I)l~J,

identity

B-1063

(_I)lni J

(-I)l~J
the proof

and

if n is odd

then

Proposed by Jose Luis Dfaz-Barrero, Barcelona, Spain (Vol. 48.1, February 2010) Prove that
2

Universidad

Politecnica

de Cataluiia,

which completes

Let n be a positive integer.

11

1+ 8
Also solved by Paul S. Bruckman, Greubel, and the proposer. Falcon proposal. and Plaza Sergio Falcon and Angel Plaza (jointly), G. C.

k=l

F L __ Lk F~ +
2k_

<3

(FnFlI+1

+ 1)(LnL +2
lI

1).
of Mathematics,

Solution by Angel Plaza and Sergio Falcon (jointly), Universidad de Las Palmas de Gran Canaria, Spain of this inequality that will appear as a separate

Department

have a generalization

p,2 B-1062 Proposed by M. N. Deshpande, (Vol. 48.1, February 2010) Nagpur, India 1

+ 8~

F1 +L1 1 1+8--

<

Let g(n) = F~ [4g(n + 2) - 7g(n

+ F~+l + F~+2 + 1) - 9g(n)J!4

for n ::,.O. For every n ::,. 2, show that is a product of two consecutive Fibonacci

numbers.

1+ 1 1+4

3 4 < -6

-(F1F2

+ 1)(L1L3

1)

<

3 8.

1 - a3n I-a3
-~

1 - (33n

<

L~ = 1 + 4(LnLn+! - 2) k=! 1 + 4(LnLn+2 - L~ - 2) < 4(LnLn+2

+4~

(1 - (33) (1 - a3n) - (1 - ~3) (1 - (33n) (1 - (3)(1 - (33) _ a3 _ (33 _ (a3n _ (33n) +'(a(3)3(a3n-3 _ (33n-3) 1 - (a3 + (33) + (a(3)3 (a - (3)(13n a(a2
(1

1).

+ 13n-3 + 3)

- h)

Taking into account that for n > 1,4 <:: 1(FnFn+1 + 1), the proof is done. It should be noted that for n 2: 2, the following stronger inequality holds. For any integer

+ a)[1

n 2: 2,

_ a - (3 + -

- (_(3)n] - (1 + (3)[(1 - (_a)n)] (1 + a)(1 + (3) (_I)n[(an - (3n) - (an-I - (3n-I)] I+(a+(3)+a(3

(a - (3)[h

+ (-I)n(Jn

- fn-I)]

ff3 B-1064 Proposed by N. Gauthier, Kingston, ON, Canada (Vol. 48.1, February 2010) k=O k

~I_ a2+4 13n

(13n

+ 13n-3 - 13 a(a2+3)

3[h

+ (_1)n(Jn
a fn-Il

- fn_I)])

+ hn-3 + 3( _1)n(a2 + 3)(Jn a(a2 + 3)(a2 + 4)

+ 2a2 + 8

For a ie 0, let fa = 0, h find a closed-form expression

1, and fn+2 for

afn+1

+ fn

for n 2: O. If n is a positive

integer,

Also solved by Paul S. Bruckman, Charles Cook, Sergio Falcon and Angel Plaza (jointly), G. C. Greubel, Jay Hendel, and the proposer.

B-1065
Let a

(a

va

+ 4)/2, and

(3 = (a -

N+4)/2
ak - (3k a-(3

The Binet's

form for fk is

Proposed by Br. J. Mahon, Australia (Vol. 48.1, February 2010) Pn satisfy Pn+2

The Pell numbers

fk = ---. Notice that

+ (3 =

a, a(3
n-1 3

-1, and a - (3 =

va
=

f
r=!

2Pn+1
I

+ Pn,

Po
__

0, PI

1. Prove

that

+ 4.
1

I-Ience,

(-Ir- p6T+3 pirpir+3

1_

- 125

n-!(ak_(3k)3. k=O

~ fk = ~
k=O

a2

+4

n-!(ak_(3k)3 ~ a - (3 k=O

. Given N natural
1

let T(N)

LNr=l

(-JY-

1P 6r+3
J

P:jrPlr-t-3

and let T

"'= 0r=!

(-!y-

1 P6T+3

plrPlr+3

limT(N)
for

as N -r 00, provided n = 0, 1,2, ..

such limit exists. Pn

The Pell numbers where

satisfy

the following

relations

= ---

un - vn u-v pin

)2, v

1 - )2;

~ k k3 L.,(a - (3 ) k=O

I_a = ---

3n

1 - a3

I-(33n - --

1 - (33

+3

[I-(-(3)n --1 + (3

- - ...-----

I-(-a)n]. 1+a

PT~ + PT~+! = P2n+l;

+ pin+3

= 5P6n+3;

~ ~

P~

u2n

-+ 0 as n -+

00.

Equations (1), (2), an(~ (4) are well-known; (3) is derived similarly Binet formulas) and using the fact that P3 = 5. Then N 1 N - '\' (_1)r-l{p2 3r +p2} 3,+3 = _ '\' {(_1)r-l

to (2) (by expanding

the

T(N) -0

r=1 is readily

5P3rP3r+3 evaluated 1
-2 -

5 as (_1)N

(_l)r} _
P3r+3
2 '

r=1

P3, (_l)N
-2-

a telescoping

sum that

EDITED

BY

FLORIAN

LUCA

T(N) =
Using (4), we see that

-2-

5P3

5P3N+3 with T =

= 1~5

125

5P3N+3

T does exist,

Also solved by Sergio Falcon and Angel Plaza Jaroslav Seibert, and the proposeI'.
A late solution to Problem B-1058 by Zbigniew

(jointly),

Kenneth

Davenport,

Jakubczyk

was received.

Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to FLORIAN LUCA, IMATE, UNAM, AP. POSTAL 61-3 (XANGARI), CP 58 089, MORELlA, MICHOACAN, MEXICO, or bye-mail at fiuca@matmor.unam.mx as files of the type tex, dvi, ps, doc, html, pdf, etc. This department especially welcomes problems believed to be new or extending old results. Proposers should submit solutions or other information that will assist the editor. To facilitate their considemtion, all solutions sent by regular mail should be submitted on separate signed sheets within two months after publication of the problems.

[~L
a) Show that [
n-kf(

n]

[n]

kf(

b) Show that c) Find

[~] = m2, where k f( a closed form expression

m(n, k) is a positive

integer.

for Sn = L::k2:0 m(n, k).

H-698 Proposed
i) Prove that

by Hideyuki Ohtsuka, Saitama, Japan

00 (

~Ff

1 )-1
)
-I

(_1)n

=Fn-1Fn--3-+O
integers

(1)

F~

ii) Is it true

that
00

for all nonnegative 1

n-I

m we have the estimate 1 1 )

FkFk+m
implied

r;

FkFk+m

+ 3Fm-2(-I)"
0 might depend

+0

(F~

'

where

the constant

by the above

on m?

H-699

Proposed by Ovidiu Furdui, Cluj, Romania and Huizeng Qin, China Let k :::: be a natural number and let (.Tn)nEN be the sequence defined by

Shandong,

For the proof, note that fr+s = _1_(07+s _ ~r+8)

.Tn

0-(3
= 2(0 - (3) 1 2(0-(3) 1 = 2U,.ls

r (- 2k +
(-I)n1

D
(-(2k

r (- 2k + +
1) +

D. D

r (-2k + ~) + 1) +

(( o"+s _ (3r+s
((0" - {3r)(os

+ or

(38 _ OS (3")

+ (o'+s

_ {3r+s _ Or (3s

+ OS (3r))

r (-(2k

+ (3S) +

(OS - (3s)(or

+ (3'))

(-(2k

1) +~),

+ fslr),
to prove.
5,

which is what we wanted 2. For integers For the proof, f,.-8 H-680 Proposed by N. Gauthier, Kingston, ON (Vol. 46, No.4, November 2008) For .T oJ 0 an indeterminate and for an integer 17. :::: 0, consider the generalized Fibonacci and Lucas polynomials Un}n and {In}n, respectively, given by the following recurrences In+2
= ~(3
0-

rand

we have that f,.-s

= (-~)'Uris

-- fslr).

(o,-s

- (3r-s) _ oS(3r(o(3)-s)

=
=

_1_

(0 - (3)

(0"(38(0(3)-S

(-1)S (( o'"+s _ (3r+s 2(0 - (3)

(-I)S 2(0-{3) ((0' _ {3')(OS

+ 0' {3s _ + (3S)

OS (3'") _ (o'+s

_ {3r+s _ or (3s

+ OS (3r))

.Tln+l

In+2 = .Tln+J Find closed-form expressions

+ In + In

17.

::::

0, 0,

where where

17. ::::

10 = 10 =

0,

2, II

II = 1; = .T.

_ (OS _ (3s)(or

+ (3"))

(_1)8
= -2-U,.ls which is what we wanted - fsl,), to prove.

for the following sums:

(a) f(_l)kn
k=l (b)f(-I)kn 1 k=O (c) f(-I)kn k=l

__

1 __

Tn,

17. ::::

1;

f(k+l)nfkn 11' (k+l)n kn ;(2k+l)'~, f(k+l)nfkn J(2k+lj;, (k+l)n kn Tn,n::::O;

Now, with (17.,k) integers, put r := n(k+ 1) and 5 := nk in the above formulas and rearrange the results in either one of the following forms, by dividing by fn(k+l)fnk or by In(k+l)lnk> as the case may be, to get that:

(la)
Tn, 17.::::1;

fn(2k+l) fn(k+l)fnk fn(2k+l) In(k-t-l)lnk (-l)nkln In(k+l)lnk

= ~ (~
2 fnk

In(k+l)) fn(k+l)

n> 1 k>
, ' , ' -, -,

(d)

f(

(lb)
Tn, 17.::::0;

= ~
2

(fn(k+l) In(k+l) Ink

fnk) Ink

17.> Ok> 0 -, -,
17.

_1)kn

k=O ~ (e) LJ -1) k=O

(2a) ----

1 = - (Ink -

kn f(2k+l)nlf(2k+l)n

+ f~l
14
kn

In(k+l)) - -In(k+l)

>1
-,

k> 1 -, k>O. series.

14
(k+l)n

'

(2b)

(-I)nkln=~(/n(k+l)_fnk) In(k+I)lnk 2 In(k+l)

Ink

17.>0 -,

Solution

by the

proposer

To find the sought closed forms, we first invoke (2a) and sum the resulting telescoping This gives the desired closed form for sum (a) upon division of (2a) by In: Closed form for (a):

The characteristic equations for the given recurrences are identical and have roots 0 = ~(.T + V.T2 + 4), (3 = ~(.T - V.T2 + 4), with 0(3 = -1 and 0 + (3 =.T. The Binet form for the terms of the generalized Fibonacci sequence is In = (on - f3n)/(o - (3) and for the Lucas sequence is In = on + (3n. Vie first prove two results that will simplify the proofs. 1. For integers rand
5,

f(
k=l

_l)nk

1 In(k+l)/nk similarly

_1_ (Ink 2/n k=1 Ink

_ In(k+l)) In(k+l)

_1_ (~ _ In(m+l)), 2/n In In(m+l)

Tn:::: 1, 17.::::1.

we have Ir+s

= ~UTls

+ Islr)

We proceed

for sum (b) and get, upon division of (2b) by

In,

that:

Closed

form for (b):

1 In(k+I)lnk

f)_1)nk k=O

_1_ (fn(k+l) 2fn k=O In(k+l)

_ Ink) Ink

fn(m+l) 2fnlnlm+I)'

m ~ 0, n ~ 1.

H-681

To proceed further, form the product of equation (3)

(_1)nkf~fn(2k+~) fn(k+l/nk

(la) by equation (2a) and get that:

Proposed by N. Gauthier, Kingston, ON (Vol. 47, No.1, February 2009/2010) For a real variable z oJ consider the sets of generalized Fibonacci and Lucas polynomials, {In = fn(z) : n E 2:} and {In = In(z) : n E Z}, given by the recurrences

= ~
4

(I~(k+l) _ I;k).
fn(k+l) fnk

fn+2

Zfn+l

+ fn,

and

In+2

Zln+1

+ In,

for all

n E 2:,

Dividing this result by fn then gives the summand Closed form for (c):
~(_I)nk k=l

in (c) and the resulting sum telescopes:

with fo = 0, a nonnegative

!J =

2, 11= z. Note that f-n integer and p, q be positive integers.

1,10

(_1)n+1

fn and Ln

(-I)nln.

Let

l'

be

fn(2k+l) = f2 f2 4f n(k+l) nk n

_1_ (1;(m+l) _
2

I;)
2

(a) Prove that

'

fn(m+l)

fn

m ~ 1, n ~ 1.

",,(_I)kk(r)fkfr-kl k L
k~O

p p+q qk -

( - l)q+l r f p j'r-II q

pr-(p+q)'

Similarly, form the product of (lb) by (2b) and get:

(4) (_I)"kf~fn(2k-~I) In1k+1)lnk = ~ (f;(k+I) 4 In(k+l) _ f;k) Ink .

(b) Find a general formula for L,k~O( _I)kkm Solution by the proposer

G) f;

g+;lqk

for any nonnegative

integer m.

This gives the summand Closed form for (d):

~(_I)nk

of sum (d) upon division by fn and the sum collapses to give:

k=O

2fn(2k+1 f~(2m+l) ---- 2) __ --In(k+ 1)lnk 4fnln(m+

, I)

m ~ 0, n ~ I.

The characteristic equations for the given recurrences are identical and have roots 0 = 2 + 4), {3 = ~(z 2 + 4), with 0{3 = -I ~(z + and 0 + {3 = The Binet form for the terms of the generalized Fibonacci sequence is In = (on - {3n)/(o - {3) and for the Lucas sequence is In = on + {3n. To prove identity (a), we use the following lemmas.

vz

vz

z.

Next, take the square of equation This gives:

(5) f~~k+I): In(k+I)lnk f~

(1b) and add the result to the square of equation

(2b).

Lemma

1. FaT x a variable and

l'

a nonnegative

integeT, we have

=~
4

((fn(k+J) In(k+l)

fnk)2 Ink

(fn(k+l) In(k+l)

_ fnk)2) Ink L(-I)'"-k

k~O

Multiplication

of this result by (4) then gives:

(6) (_I)"Jnfn(2k+41JU~(k~+1)

+ f~)

= ~ (f;(k+l)

_ f}k)

G)
dx

(1 + x)k = xr,

In(k+l)lnk 8 In(k+l) Ink This gives the summand in sum (e) upon division by fn and we get the desired result due to the collapsing of the series:

which follows from the binomial expansion of x" = (-I apply the differential operator (1

+ (1 + x))"

in powers of (I + x).

Then

+ x)!

to this result and get that

Closed

form for (e): L

k=O ~(_

)nkfn(2k+J)(J~(k+l)

14

14
nk

+ f~)

f~(m+J)
4 '

L(-lrkkG)(1
m ~ 0, n ~ 1.
k~O

+ xl

r 1 TX -

(1

+ x);

r ~

0, 0 equations

n(k+l)

fnln(m+l)

which proves Lemma 1. Lemma 2. FaT positive integeTs (p,q), the solution of the following simultaneous
1 + uoP

wo-q,

faT the unknowns u and w is:

fq
U= ---

fp+q'

(-I)LlL
fp+q

Proof.

One can get at once that aQ

u ==

+ uap+q

== w == f3Q + uf3p+q Q

Hence, since p

+q #

0, we

get that

(see Lemma 1). After noting that that

((1 + :7;)
x)

(1

+ x)k =

km(1

+ X)k

as well as the fact : 0 ::; n ::;m}, we

f3q - a == aP+Q - f3p+q

_-.1:L
Jp+q'

(1 + X)!) dx

m x generates an m
T

+ I-term
1',

expansion in {xr-"(l m:

+ x)"

Similarly, one can see that -a-P + wa-(p+q) == u == -f3-P the Binet formula for the Fibonacci polynomials that
a-P-f3-P w == -----a-(p+q) - f3-(P+Q) _J-P J _(p+q)

+ wf3-(P+Q)

Hence, we get using

claim that the following holds for nonnegative

(-I)P+JJ J P -- (-I)q-P( -1 )p+q+ I Jp+q Jp+Q'

~(-Ir-kkm k?O

G)

(1

+ x)k

= f(r)"a~m)x"-"(1 ,,=0

+ x)".

which proves Lemma 2.

a-q

We now prove summation formula (a). To do so, first note that af3 == -1 implies that == (-I)qf3q We use Lemma 1 and 2 with
x == uaP == -

The unknown coefficients, {a~m) : 0 ::; m,O ::; n ::; m}, are to be determined following linear recurrence:

by solving the

-.1:LaP,
JP+Q

(1 + x) == wa-q

== (-I)qwf3q

== J.Lf3q,

Jp+q

~(_lr-kk(r) k?O

(JLf3q)k Jp+q

l'

(_-.1:Lap)'-1
Jp+q

To prove the above claim, note that it is true for m = 0 if we convene that kO k 2: O. So, assuming that the above formula is true for m, consider
(J.Lf3q) Jp+q d) ( (l+x)dx m+ I x"=(I+x)dx d (( (l+x)dx d ) m T) x .

1 for all

R.epeating the exercise with x == -

-.1:L f3P
Jp+'I

Upon invoking the above expressions powers of (1

~~ a"k == (_I)Q+'-JrJp~~-1 f3pr-(p+q) Jp+q Jp+q

for

d ( (1 + x) dx )m+J
m

and of

(d(1 + x) dx )m

xT

in

+ xl/x,

we get that

~(_1)T-kk(~) k?O

Finally, add these last two results together and multiply the resulting equation by (-1 J;+q to get identity (a):
"'( - l)kk(r)fkfT-kl P p+q qk - ( - l)Q+l l' J P j"'-Il P"-(q+J), L k q k?O
l'

m+l.

~
n=O

(r)"a~m+I)X'-"(1

+ x)" =

(1
m

+ x)

dx ~(r)na~")xT-n(l
n=O

+ x)n + x),,+l + nxT-"(1

m

>_ 0

== ~(r)"a~m)
n=O
m

(1' -

n)x,-n-l(1

+ x)n) + x)"

To generali;e;e the problem as requested in part (b), we will use the following lemma. Lemma 3. For x an arbitrary
~(_1)T-kkm k?O where kind, variable and for an integer
l'

~(r)n+la~m)xT-(n+l)(1
n=O

+ x)n+l + ~
"=0

n(r)na~m)x"-"(l

0, we have

G)

m+J

(1 + x)k = f(r)"S~m)X'-"(1 ,,=0

+ x)",

== ~
n=O

(r)n (a~':':)l

+ na~n))

xT-n(l

+ :)".

{S~m) 0::; m,O ::; n ::; m} is the augmented set of Stirling numbers oj the second m including the n = 0 elements, S6 ) = om,o, Also, by definition, Jar n 2: 1, (1')" = 1'(1' - 1) (r - n + 1) and Jar n == 0, (1')0 == 1.

For m 2: 0, consider the differential operator

~(-lr-k
k?O

( 1+

G)

X)!) dx

and apply it to the formula

To go from the penultimate line to the last one above, we shifted the summation index in the first sum by one unit. Then we defined a~~) = 0, a~J == 0 and extended the limits of both sums from 0 to m + 1. This result then gives the recurrence for the unknown coefficients, which is the recurrence for the augmented Stirling numbers of the second kind, S~m). We therefore conclude that {a~m) == S~m) : 0 ::; m, 0::; n ::; m} and Lemma 3 is proved. 0 Now, to obtain the generalization requested in (b) of the problem statement, we invoke Lemmas 2 and 3 and proceed as we did to prove identity (a). We then get the following two

(l

+ x)k

= x"

SUSTAINING MEMBERS
A. Adelberg C. K Cook C. Cooper M. Elia N. Gauthier *H. W. Gould G. C. Greubel P. Hagis, Jr. H. Harborth *A. F. Horadam F. T. Howard S. Kar R. E. Kennedy *C. H. Kimberling R. Knott T. Komatsu H. Kwong J. Lahr *C. T. Long F. Luca W. L. McDaniel F. U. Mendizabal J. L. Moser D. Redmond D. L. Schweizer A. G. Shannon L. W. Shapiro L. Somer P. Spears P. K. Stockmeyer D. R. Stone M. N. S. Swamy *D. Thoro J. C. Turner W. A. Webb C. Witzgall P. Young
Charter Members

equations: ~(-Ir-kkm(~)
k?O k

f3qk = f(1')nS~m) Jp+q n=O

m

if

G. L. Alexanderson (_J:Lexp),-n Jp+q

n

(JLf3q)n Jp+q

P. G. Anderson
. ...

~
',~.

S. Ando J. L. D. Barrero A. T. Benjamin J. G. Bergart G. Bergum *M. Bicknell-Johnson P. S. Bruckman G. D. Chakerian H. Chen .

= "'(_l)(Q+l)n+r(1') n=O
m

fnr-n S(m)_p_q_expr-(p+q)n.
11

fT

~(-lr-kkm
k?O

( )

~ +ex

Jk qk

rr= ~(_1)(q+])n+r(1')nS~m)2...f---f3p1.-(p+q)n
n

p+q

Jp+q

n=O

Jp+q

Adding together these two equations and multiplying the result by (-It J;+q then gives the sought generalization
"'(_I)kkm

k?O

(1') fkfr-kl _ ~(-I)(q+ k p p+q qk - L n=O

])n(1') s(m)fnJr-nl n n p q

pr-(p+q)n

This result agrees with the identity in (a) when m = 1 since Also solved by Paul S. Bruckman and Kenneth

S~l)

= 0, SP) = 1 and (1')] = 1'.

BIBLIOTHEQUE DE MATHEMATIQUES
Pal'is, France

Davenport.

KUWAIT UNIVERSITY
Basel, Switzerland

CALIFORNIA INSTITUTE OF TECHNOLOGY

Pasadena, Birmingham, Eger, Hungary California Alabama

OCCIDENTAL COLLEGE LIBRARY

Los Angeles, Ada, Ohio California

CIMAT BIBLOTECA ESZTERHAZY KAROLY FOISKOLA FACULTE DES SCIENCES ET TECHNIQUES

Saint Etienne, France

OHIO NORTHERN UNIVERSITY OHIO STATE UNIVERSITY LIB. 031523614

Columbus, Ohio

SAN JOSE STATE UNIVERSITY

San Jose California

FRESNO PACIFIC UNIVERSITY

Fresno, California

SMI SCHWEITZER MEDIA INTERNATIONAL

Whitestone, New York

ICMC - INST. DE CIENCIAS

Birmingham, Jacksonville, Birmingham, Alabama Illinois Alabama

UNIVERSITE DE MONTREAL
Quebec, Canada

ILLINOIS COLLEGE IME - INST. DE MATEMATICA INSTITUTO PARA A INVESTIGACAO

Lisboa, Portugal

UNIVERSITE DE VERSAILLES ST QUENTIN

Versailles, Albany, Prance

UNIVERSITY OF NEW YORK - ALBANY LIB.

New York Australia Pennsylvania

UNIVERSITY OF NEWCASTLE
Callaghan,

ITHACA COLLEGE LIBRARY

Ithaca, New York

WEST CHESTER UNIVERSITY

West Chester, Cincinnati,

JOHN F MORRISON
Essex, Maryland

XAVIER UNIVERSITY LIBRARY

Ohio

KLEPCO, INC.
Reno , Nevada