0% found this document useful (0 votes)
64 views

Advanced Problems

The document proposes several math problems and provides solutions submitted by other mathematicians. It discusses properties of Lucas numbers, sums of Fibonacci numbers, and a corrected problem about properties of solutions to equations of the form x^p + y^p = z^p for an odd prime p.

Uploaded by

Charlie Pinedo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
64 views

Advanced Problems

The document proposes several math problems and provides solutions submitted by other mathematicians. It discusses properties of Lucas numbers, sums of Fibonacci numbers, and a corrected problem about properties of solutions to equations of the form x^p + y^p = z^p for an odd prime p.

Uploaded by

Charlie Pinedo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ADVANCED PROBLEMS AND SOLUTIONS

Edited by
RAYMOND E. WHITNEY
Lock Haven State College,
Lock Haven,

PA 17745

Send alt commuyiLccutlonA concerning


ADVANCED PROBLEMS AND SOLUTIONS to
Raymond E. Whitney, Mathematics Department, Lock Haven State College, Lock
Haven, Pennsylvanis 17745. ThjJ> department eApecioLty welcomes problems believed to be new on, extending old fie&ultA. ?siopo&&i& should submit AolmtLonA
on, other information
that wilt aA&lbt the ecUXor. To facilitate
their
consideration,
solutions
should be submitted on separate Signed sheets within 2
months a^ter publication
o^ the problems.
H-290

Proposed

by Gregory

Wulczyn,

Bucknell

University,

Lewisburg,

PA.

Show that:
(a)

(b)
H-291

Fk* k + 6r +3 ~ ^k+kr + 2 ~ ( " 1 /

FkFLsr
Proposed

~ ?U,r

^2r +l^k+8r

(-Dk + 1F2Zr(Fk

by George Berzsenyi,

+ 8p

+h ~ ^k+kr+2'

>

+ 2F k + l f r ) .

Lamar University,

Beaumont,

TX

Prove that there are infinitely many squares which are differences of
consecutive cubes.
H-292

Proposed by F. S. Cater
land, OR.

and J. Daily,

Portland

State

University,

Port-

Find all real numbers v (0,1) for which there exists a one-to-one function fr mapping (0,1) onto (0,1) such that
(1) fr and f~ are infinitely many times differentiable on (0,1), and
(2) the sequence of functions fr, frofP9
frofrofr,
fv^fvfvfv
> '
converges pointwise to v on (0,1).
H-293

Proposed

by Leonard

Carlitz,

Duke University,

It is known that the Hermite polynomials <Hn(x)\


n=0

Durham, NC.
defined by

'

satisfy the relation

I>+ *(*>S = e2XZ-*2Hk(x


n=0

- z) (k = 0, 1, 2, . . . ) .

'

Show that conversely if a set of polynomials \fn(x)\

<x>

Z-4+fc^Jr = E ^ ^ J r 4 ( x - z) (k = 0, 1, 2, . . . ) ,

n =0

where f0(x)

satisfy

n=0

= 1, fx(x) = 2x, then


fn(x)
= Hn(x)
(n = 0, 1, 2, . . . ) .

566

Dec. 1978

H-294

ADVANCED PROBLEMS AND SOLUTIONS

Proposed

by Gregory

Wulczyn,

Bucknell

University,

567
Lewisburg,

PA.

Evaluate
^2r+l

^6r+3

-^10r+5

^lhr+7

^ I 8r +9

* hr +2 ^ 1 2 r + 6

^ 2 OP + 1 0 ^ 2 8 r + 1 h^ Z Sv + 1 8

^6r+3

^ 3 6 r + 1 5 ^ 4 2 ^ + 2 1^5 4 r + 2 7

^18r+9

^ 7 8 r + L f - ^ 7 2 i + P + 1 2 ^ 7 i + 0 P + 2 0 ^ 5 6r + 2 8 ^ 7 2 r + 3 6
^ 1 Or + 5 ^ 2 Or + 1 5 ^ 5 Or +2 5 ^ 7 Or + 3 6 ^ 5 Or+1+5

SOLUTIONS
SYMMETRIC SUM

H-272 ( C o r r e c t e d )

Proposed

by Leonard

Carlitz,

Duke University,

Durham,

NC.

Show t h a t

EmcAX^rv^A)
is symmetric in p, q,
Solution

C m (p, (7, r)

v.

by Paul Bruckman,

Concord,

CA.

Define

a)
Clearly,
therefore
/?? - j in
volving p

j =0

Cm(p, q, v) = Cm(q, p, r). A moment's reflection reveals that it


suffices to show that Cm(p, q, r) = Cm(q, p, p ) . Replacing j by
(1) and applying Vandermonde? s convolution theorem on the term inand q yields:

".<p-"-')-i;(.^)(5)(j)/(;)fc^))
k=0

j-o
m

m -J

E0t(A)UKi)(.?oc;')/(j)-

j=0 k=0

7 = 0fe= 0
Replacing k by m - k in the
last expression yields
te
last
expression yields:
m
m

'.<*'>-E(.-*)(5)(.?*)(0(*)/(;)
J

= 0fc= j

-EU)(.!,)E(.-*)0)(5)/(")However, it is easy to verify that

(-,)/(?)-O/rTO-O^'/fT1)Therefore,
777

*.<*.. w C)E(?)(.f*)?:w)'(J)(5)/(-r1)-

568

ADVANCED PROBLEMS AND SOLUTIONS

Now, formula (7.1) in Combinatorial


is as follows:

<

[Dec.

(H. W. Gould, Morgantown,1972),

Identities

D-u'UK^/cr)/-

fc-0

Letting k = J, n = k, % = q, y = m - r - 1 In (4), we therefore simplify (3)


as follows:

*..*> = Q|:axA)r i T~ i )/CT 1 )


fr\SLy(P\t
\m)ls\k)\m-k)\

1 \/q+r-m
k

+ k\ I IT -m + k\
) /\
k
)

k=0

once again and replacing k by j y i e l d s :


m

<p.,.rt=E(?)(^-)L-J-)r'r+j')/()
3

= Cm(q, p, p ) .
Also solved

by the

Q.E.D.

proposer.
A RAY OF LUCAS

H-273 Proposed by W. G. Brady, Slippery

Rock State

College,

Slippery

Rock, PA.

Consider, after Hoggatt and H-257, the array D, indicated below, In which
^2n+i (n = 0, 1, 2, ...) is written in staggered columns:

i.
ii.
iii.

1
4
1
11
4
1
29
11 4
1
76
29 11 4 1
Show that the row sums are L2n + 2 ~ 2;
Show that the rising diagonal sums are F2n+3 ~ 1 where L2n+1
is the
largest element in the sum.
Show that if the columns are multiplied by 1, 2, 3, ... sequentially to
the right then the row sums are L2n+3
- {In + 3).

Solution

by A. G. Shannon,

The N.S.W. Institute

of Technology,

Australia.

In effect we are asked to prove:


n
i*

2Ll ^2n-2j +1

^2n+2

~ 2;

J-0
[n/2]

i1,

2Ls ^2n-kj + i ~ F2n+3

i;

J-0
n

iii.

(j + l)L2n_2j+1

= L2n + 3 - {In + 3 ) .

j-o
n

n
(^

Z^L2^-2J + 1
J=0

I-** \
j - 0

J2n+2 " ^ O J a

2n-2(j-

1)
s

"

2n-2j)

required.

/ ^ L2n - 2 (j - 1)
j=0

n+1
"

,L2n-2(,i-l)
j=l

1978]

ADVANCED PROBLEMS AND SOLUTIONS


[/2]

(ii)

2 ^

[n/2]
L

2n-Hj

[n/2]

+ 1 = 2-J {F2n-Hj

J-o

+3 "

2n - 4 j - 1 ) =

j=o

~ ^i^(25 ) " F.1o(29

if n\m9

if n\m.

[n/2] + l
F

2n-kj

2-j\^2n-2i+
=0

2n-kj+3

n + 1) = F 2 n + 3 - 1

j-i

(iii) (J + l)L2n_2j,+ 1 - S L 2 n - 2 i + l = Z)(L2n-2i+ 2 i =0j =1


'
*-0
n
rc + 1

+3 ~ X ,

^.Q

'

= F2n+3

in which

569

*Yj 2in+i)-n+i - Ll

)
[from (i)]

3 ~ -^2n-2i+l ~ ^j

- (L2n + 2 - 2) - 2(n + 1)

i =Q

= L2n+,

- 2 - 1 - L 2 n + 2 + 2 - 2(n + 1)

= L2n+3

- (In + 3 ) , as required.

Also solved by P. Bruckman, G. Wulczyn,


and the
proposer.
Late Acknowledgments:

H. Freitag,

B. Prielipp,

Dinh

The'Hung,

F. T. Howard solved H-268 and M. Klamkin solved H-270.


A CORRECTED OLDIE

H-225

Proposed

by G. A. R. Guillotte,

Quebec,

Canada.

Let p denote an odd prime and xp + yp = zp for positive integers, x, y,


and z. Show that
(A) p < xj(z - x) + y/(z - y), and
(B)

z/2(z - x) < p < y/(z - y).

You might also like