Scribd
Upload
53 views4 pages

Elementary Problems and Solutions: B-388 Proposed

Problemas elementales

Uploaded by

Charlie Pinedo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
53 views4 pages

Elementary Problems and Solutions: B-388 Proposed

Problemas elementales

Uploaded by

Charlie Pinedo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ELEMENTARY PROBLEMS AND SOLUTIONS

Edited by
A. P. HILLMAN
of New Mexico, Albuquerque,

University

New Mexico

87131

Send all communication* hegaJtdlng ELEMENTARY PROBLEMS AND SOLUTIONS to


Professor A. P. Hillman, 709 Solano Dr., S.E., Albuquerque, New Mexico 87108.
Each solution
on phoblem should be on a Aepa/iate Aheet [oh Aheet*).
Vhe{oJtence wiUL be given to tho*e typed with, double spacing in the ^ohmat u*ed below.
Solution* should be heceived within 4 month* ofi the publication
date.
DEFINITIONS
The Fibonacci numbers Fn and Lucas numbers Ln satisfy Fn + 2 = Fn + 1 + Fn ,
FQ = 0, Fx = 1 and Ln + 2 = Pn + i + ^n? L0 = 2, L x = 1. Also a and b designate
the roots (1 + /5)/2 and (1 - /5~)/2, respectively, of x2 - x - 1 = 0.
PROBLEMS PROPOSED IN THIS ISSUE
B-388

Proposed

by Herta

T. Freitag,

Roanoke,

VA.

Let Tn be the triangular number n(n + l)/2.


T

+ T

+ i

Show that

l + 3 + 5 2 + + (2n - l ) 2

s + '" + 2n-i

and express these equal sums as a binomial coefficient.


B-389

Proposed

by Gregory

Wulczyn,

Bucknell

University,

Lewisburg,

PA.

Find the complete solution, with two arbitrary constants, of the difference equation
(n2 + 3n + 3)Un + 2 - 2(n2 + n + l)Z7w+ i + (n2 - n + l)Un = 0.
B-390

Proposed

by V. E. Hoggatt,

Jr., San Jose

State

University,

San Jose,

CA

Find, as a rational function of x9 the generating function

B~391

Proposed

by M. Wachtel,

Zurich,

Switzerland.

Some of the solutions of 5x2 + 1 = y2 in positive integers x and y are


(x9y)
= (4,9), (72,161), (1292,2889), (23184,51841), and (416020,930249).
Find a recurrence formula for the xn and yn of a sequence of solutions (xn,
yn) and find m(xn + 1/xn) in terms of a = (1 + /5")/2.
n -y 00

B-392

Proposed

by Phil

Mana, Albuquerque,

Let Yn = (2 + 3n)Fn + (4 + 5n)Ln.


Yn+2 ~ Yn+l ~ Yn
B-393

Proposed

by V. E. Hoggatt,

Let Tn = ( n 2 X ) '

Find c o n s t a n t s h and k such t h a t

hFn + kLn.
Jr., San Jose

o = X> Pn = TiT2

"Tn

f o r i n t e g e r s k and n w i t h 0 . k n .
fnl
lk\

NM.

State
^r

Show t h a t

1
(n\(n + \
n - k + l U / U + 1 /
562

University,

San

n > 0 , and [ j ] =

Jose,CA.
Pn/PkPn.k

Dec. 1978

ELEMENTARY PROBLEMS AND SOLUTIONS

563

SOLUTIONS
1NCONTIGUOUS ZERO DIGITS
B-364

Proposed

by George Berzsenyi,

Lamar University,

Beaumont,

TX.

Find and prove a formula for the number R(n) of positive integers less
than 2 whose base 2 representations contain no consecutive O's. (Here n is
a positive integer.)
Solution

by C. B.A.

Peck,

State

College,

PA.

Let Sn be the number of integers 777 with 2n~ <_ m < 2n and having a binary
representation 5(777) with no consecutive pair of 0Ts. Clearly Sn = Rn - i?n_i
for n > 1 and S1 = R. Also,
Sn = n_i + 5 n _ 2 for w > 2,
since Sn_1 counts the desired 77? for which B(m) starts with 11 and Sn_2 counts
the desired 77? for which 5(777) starts with 101. It follows inductively that
S

= Fn+1>

and

then

Rn

= S,

+ S2

+ + Sn

= F2 + F3 + . . + Fn + 1 = Fn

Also solved by Michael Brozinsky,


Pauls.
A. G. Shannon, Sahib Singh, Rolf Sonntag,

+3

Bruckman, Graham Lord, Bob


Gregory Wulczyn, and the

- 2.

Prielipp,
proposer.

CONGRUENT TO A G.P.
B-365

Proposed

by Phil

Mana, Albuquerque,

NM

Show that there is a unique integer m > 1 for which integers a and r exist with Ln E avn (mod 777) for all integers n >_ 0. Also, show that no such 777
exists for the Fibonacci numbers.
Solution

by Graham Lord,

Universite

Laval,

Quebec.

2 5

Since 7 = LiiLl = a r
E LZL3 = 12 (mod 777), then 77? divides 5, hence 777 = 5.
Furthermore, a = ar E L0 = 2 (mod 5). And finally, or2 =L2 = L1 + LQ E av +
a (mod 5) together with a E 2 (mod 5) implies v1 E v + 1 (mod 5), i.e., v E 3
(mod 5). In all, 777 = 5, and a and v can be taken equal to 2 and 3, respectively. Note for any n >_ 1, Ln + 1 = Ln + Ln_1 E ap n + a p n _ 1 E ar n+ 1 (mod 5).
For the Fibonacci numbers, if 777 were to exist, then
3 = FxFh

E a 2 p 5 E F2F3 = 2 (mod 777),

i.e., 1 E 0 (mod 777), which is impossible if 777 > 1.


Also solved by George Berzsenyi,
Paul S. Bruckman,
Sahib Singh, Gregory Wulczyn, and the
proposer.

Bob Prielipp,

A. G.

Shannon,

LUCAS CONGRUENCE
B-366

Proposed
Slippery

by Wray G. Brady, University


Rock State College,
Slippery

Prove that LiLj

E LhLk

of Tennessee,
Rock, PA.

Knoxville,

TN and

(mod 5) when i + j - h + k.

Solution
by Paul S. Bruckman, Concord,
lege,
Clarion,
PA
(independently)
Using the result of B-365,

CA and Sahib Singh,

Clarion

State

Col-

564

ELEMENTARY PROBLEMS AND SOLUTIONS

L.L-

= 2 3i

- LhLk

+j

[Dec.

- 2 3h + k = 0 (mod 5 ) ,

since i + j = h + k.
Also solved by George Berzsenyi, Herta T. Freitag,
Graham Lord, T.
Bob Priellpp,
A. G. Shannon, Gregory Wulczyn, and the proposer.

Ponnudurai,

ROUNDING DOWN
B-367

Proposed by Gerald E. Bergum, Sr. ,


SD.
'

Dakota State

University,

Let [x] be the greatest integer in x, a = (1 + /5)/2


that
(a)
F2n = [aF 2n _ L ]
and
(b)
F2n+1 = [a^^.J.
Solution

by George Berzsenyi,
T

In view of Binet s

Lamar University,
_ 2)2n~1
7
a - b

Prove

Beaumont, TX.

2n

a2n-i
l

and n >. 1.

formula,

ccFr>n_ T F 0y. = a
zn

Brookings,

Zn

b2n
7
a - b
-

Similarly,
2p

^ '

Since - 1 < b =
follow.

j?

"

+1

<

~2&

~ O

a - b

"

t h a t 0 < -b2n~x

implies

a - b
< 1,

the

" ~b

2n-l

desired

Also solved by J. L. Brown, Jr., Paul S. Bruckman, Graham Lord, Bob


A. G. Shannon, Sahib Singh, and the
proposer.

results
Priellpp,

CONVOLUTING FOR CONGRUENCES


B-368

Proposed by Herta T. Freitag,

Obtain functions g(n)

and h(n)

Roanoke, VA.
such that

^2^FiLn-i=

g(n)Fn + h(n)Ln

i-l

and use the results to obtain congruences modulo 5 and 10.


Solution

by Sahib Singh,

Clarion

State

College,

Clarion,

PA.

Let An = 2_\^i^n-i'

Then the generating function A1 + A2x + A3x2

i=i

is a rational function with (1 - x - x ) as the denominator. It follows that


g(n) and lain) are quadratic functions of n. Then, solving simultaneous equations for the coefficients of these quadratics leads to
g(n)

= (5n2 + lOn + 4)/10

and

h(n)

= n/10

so t h a t
(5n2 + l\)Fn + nLn = 0 (mod 10).
This also gives us nLn - Fn (mod 5 ) .
Also solved
poser.

by Paul S. Bruckman,

Graham Lord, Gregory Wulczyn,

and the

pro-

1978]

565

ELEMENTARY PROBLEMS AND SOLUTIONS


NO LONGER UNSOLVED

B-369

Proposed

by George Berzsenyi,

Lamar University,

Beaumont,

TX.

For all integers n >_ 0, prove that the set


>n

-^2n+3J

\^Zn+l9

-^2n+5/

has the property that if x> y Sn and x ^ y then xy + 5 is a perfect square.


Forft= 0, verify that there is no integer z that is not in Sn and for which
(ss ^2n+i' ^2n+3s -^n + s) n a s this property. (For n > 0, the problem is unsolved. )
Solution

by Graham Lord,

Universite

Laval,

Quebec.

That Sn has the property follows from the identities:


^2n+1^2n+3

2
+ 5 = L2 n + 2 5

and
L

2n + l L 2n+5 +

2r7 + 3 '

In the second part of this solution use is made of the results:

lL6/c + i a n d 2 lL6fe+5
4= L L
3 l 6fc+3

4|L2k

Of these, (l) is somewhat well known and the latter three are consequences of the results in "A Note on Fibonacci Numbers," The Fibonacci
Quarterly,
Vol. 2, No. 1 (February 1964), pp. 15-28, by L. Carlitz.
By (T) and \2) there is exactly one even number, L6fc+3 > in the set Sn,
n >. 0. So if {2} U 5 n has the desired property, then zLsk+3 + 5 will be an
odd square and thus congruent to 1 modulo 8. This implies that 2, if it exists, is odd.
Now the other two members of Sn are either:
(a)

L6k_i,

(b) L

Lsk+1;

s k + 5

L6k+7;

o r (c) L6k+l9

LBk+5-

Each of these is odd by (l), and hence the sum of 5 and any one of them
multiplied by z will equal an even square. Thus, in case (a) [and similarly
in case (b)]:
zLsk_1

+ 5 E 0 (mod 4 ) , and zL6k+1

+ 5 = 0

(mod 4 ) ;

i. e. ,
zL&k

= z(L6k

+1

- L 6k _i) = 0 (mod 4).

But this is impossible by (5) and the fact that z is odd.


And in case (c),
z 5Fek+3

= (zLsk+5

+ 5) - (zL6k+1

+ 5) = 0 (mod 4 ) ,

which is also impossible by (4).


Consequently, no z exists such that the set {z} U Sn has the desired
property. Note that it was not assumed that n = 0.
Also solved by Paul S. Bruckman, Herta T. Freitag,
A. G. Shannon, Sahib Singh, and the
proposer.

T. Ponnudurai,

Bob

Prielipp,

You might also like