fi n. b M, b Y -3 C L E -3 n n ¥ & E c fi 5. L L L n n C n ...
E L E M E N T A R Y P R O B L E M S A N D S O L U T I O N S … · E L E M E N T A R Y P R O B L E...
Transcript of E L E M E N T A R Y P R O B L E M S A N D S O L U T I O N S … · E L E M E N T A R Y P R O B L E...
ELEMENTARY PROBLEMS AND SOLUTIONS
Edited by A. P. Hillman
Please send all material for ELEMENTARY PROBLEMS AND SOLUTIONS to Dr. A. P. HILLMAN; 709 SOLANO DR., S.E.; ALBUQUERQUE, NM 87108.
Each solution should he on a separate sheet (or sheets) and must be received within six months of publication of the problem. Solutions typed in the format used below will be given preference. Proposers of problems should include solutions.
Anyone desiring acknowledgment of contributions should enclose a stamped, self-addressed card (or envelope) .
BASIC FORMULAS
The Fibonacci numbers Fn and the Lucas numbers Ln sa t i s fy
Fn+2 = Fn+l +Fn* ?0 = °> Fl = ^ Ln + 2 = Ln + l + Ln" L0 = 2 ' L l = l '
Also, a = (1 + / 5 ) / 2 , 3 - (1 - / 5 ) / 2 , Fn = (a" - 3 n ) / / 5 , and Ln = an + $n»
PROBLEMS PROPOSED IN THIS ISSUE
B-888 Proposed by Russell Euler, Northwest Missouri State U., Maryville, MO
Find the number of increasing sequences of integers such that 1 is the first term? n is the last terms and the difference between successive terms is 1 or 2. [For example, if n ~ 85 then one such sequence is 1, 2S 33 5S 6S 8 and another is 1, 3S 4, 6, 8.]
6-889 Proposed by Philip L. Maria, Albuquerque, NM
Show that F£ - I ±s & sum of Fibonacci numbers with distinct positive even subscripts for all integers n > 3*
6-890 Proposed by Herta T. Freitag, Roanoke, VA
Let Sk = a10k + 1 + al0k + 2+al0k+3 + °°» + a 1 0 k + i05 where a = (l+/5)/2. Find
positive integers b and o such that Sk/al0k + b = c for all nonnegative integers k,
6-891 Proposed by Heiko Harborth, Technische Universitat Braunschweig, West Germany
Herta T. Freitag asked whether a golden rectangle can be inscribed into a larger golden rectangle (all four vertices of the smaller are points on the sides of the larger one). An answer follows from the solution of the general-ized problems Which rectangles can be inscribed into larger similar rectangles?
1991] 181
ELEMENTARY PROBLEMS AND SOLUTIONS
B-692 Proposed by Gregory Wulczyn, Lewisburg, PA
Let G(a9 b, c) = - 4 + Lla + L2b + h\Q + ^Za^lb^lo- Prove or d i sp rove t h a t each of Fa + b+c, Fb + c-a9 Fa + a^^f a n d Fa + b^a i s an i n t e g r a l d i v i s o r of £ ( a , b, o) for a l l odd p o s i t i v e i n t e g e r s a , &, and c.
B-693 Proposed by Daniel C. Fielder & Cecil O. Alford, Georgia Tech, Atlanta, GA
Let A c o n s i s t of a l l p a i r s {x, y} chosen from { 1 , 2 , . . . , 2n}, B c o n s i s t of a l l p a i r s from { 1 , 2 , . . . , n}, and C of a l l p a i r s from {n + 1, n + 2 , . . . , 2 n } . Let 5 c o n s i s t of a l l s e t s T = {P]_ 5 P 2 , . . . , P^} wi th t h e P^ ( d i s t i n c t ) p a i r s i n i4. How many of the T i n S s a t i s f y a t l e a s t one t he t he c o n d i t i o n s :
( i ) Pi n Pj * 0 fo r some i and j , w i th i * J , ( i i ) P^ e B fo r some i , or
( i i i ) Pi e (7 fo r some i ?
SOLUTIONS
Limit of Nes t ed S q u a r e Roots
B-664 Proposed by Mohammad K. Azarian, U. of Evansville, Evansville, IN
Let an and a n + 1 = / 2 + a„ fo r n i n {0, 1, } . Show t h a t
UMOn-tli:^)]'1. n+co i~ 0L/» 0 yd ']
Solution by Russell Jay Hendel, Bowling College, Oakdale, NY
F i r s t
£ ()) = 2* and £ 2 - = 2 . Next ,
<£|.l > a * i f f *« + 2 > <* n - l + 2> and s i m i l a r l y ,
a n + 1 < 2 i f f a £ + 1 = a n + 2 < 4 ,
implying an < 2 . Thus, an i n d u c t i o n shows t h a t t h e sequence {an} i s monotonely i n c r e a s i n g and bounded; hence , t h e l i m i t , L9 e x i s t s . Squaring the d e f i n i n g r e c u r s i o n and t a k i n g l i m i t s we f ind L 2 = L + 2 or L = 2 .
This s o l v e s t he problem, s i n c e both s i d e s of t he problem e q u a t i o n have a va lue of 2 .
Also solved by R. Andre-Jeannin, Paul S. Bruckman, Pat Costello, Piero Filipponi & Adina DiPorto, C. Georghiou, Norbert Jensen & Uwe Pettke, Hans Kappus, Carl Libis9 Bob Prielipp, H.-J. Seiffert, Sahib Singh, Amitabha Tripathi, and the proposer.
182 [May
ELEMENTARY PROBLEMS AND SOLUTIONS
Unique Real Solutions of Cubics
B-665 Proposed by Christopher C. Street, Morris Plains, NJ
Show that AB = 9, where
A = (19 + 3 /3^) 1 / 3 + (19 - 3/33)1 / 3 + 1, B = (17 + 3/33) 1 / 3 + (17 - 3/33)1 / 3 - 1.
Solution by Hans Kappus, Rodersdorf, Switzerland
Put (19 + 3 /33) 1 / 3 = a, (19 - 3/33) 1 / 3 = a f .
Then a3 + ( a f ) 3 = 38, aaf = 4, and we have (A - l ) 3 = (a + a ' ) 3 = 3aaf(a + af) + a3 + ( a ' ) 3 = 12(4 - 1) + 38.
Therefore, f(A) = 0, where /(a?) = x3 - 3x2 - 9x - 27.
In the same way, we find that #(£) = 0, where #(#) = x3 + 3#2 + 9or - 27.
It is easily seen that the polynomials / and g have exactly one real zero each, which must therefore be A and B9 respectively. On the other hand,
x3f{9/x) - -27g(x); hence, f(9/B) = 0, and therefore A = 9/B.
Also solved by Paul S. Bruckman, C. Georghiou, Norbert Jensen & Uwe Pettke, L. Kuipers, Y. H. Harris Kwong, Carl Libis, and the proposer.
Diagonal p of Pascal Triangle Modulo p
B-666 Taken from solutions to B-643 by Russell Jay Hendel, Bowling College, Oakdale, NY, and by Lawrence Somer, Washington, B.C.
For primes p, prove that
(p) E in/p] (mod p),
where [x] is the greatest integer in x.
Solution by Y. H. Harris Kwong, SUNY College at Fredonia, Fredonia, NY
The result follows easily from the same formula of E. Lucas used in the solution to B-643 [vol. 28 (1990), p. 185]. Alternately, let t be the integer satisfying 0 < t < p - 1 and p\(n - t). Then (n - t)/p = [nip] and
n(n - 1) ... (n - t + l)(n - t - 1) -•• (n - p + 1) = (p - 1) I (mod p).
Therefore, in the field Zp of the integers modulo p,
/n\ _ r , 1n»»« (w - £ + l)(rc - fr - 1) ••• (w - p + 1) ̂ f"n] lp/ Ln/pJ (P - Di LPJ
Hence, [ ) = [n/p] (mod p).
1991] 183
ELEMENTARY PROBLEMS AND SOLUTIONS
Also solved by R. Andre-Jeannin, Paul S. Bruckman, C. Georghiou, Norbert Jensen & Uwe Pettke, Bob Prielipp, Sahib Singh, Amitabha Tripathi, and the proposer.
Cyclic Permutation of Digits
B-887 Proposed by Herta T. Freitag, Roanoke, VA
Let p be a prime, p ^ 2, p ^ 5» and m be the l eas t posi t ive integer such that I0m = 1 (mod p) . Prove that each 777-digit ( in tegra l ) multiple of p remains a multiple of p when i t s d ig i t s are permuted cyc l i ca l ly .
Solution by Y. H. Harris Kwong, SUNY College at Fredonia, Fredonia, NY
Suppose n = am_llOm~l + . . . + ax10 + aQ = 0 (mod p ) .
Let n+ be the integer obtained from n by permuting i t s d ig i t s cyc l ica l ly by t posi t ions . More spec i f i ca l ly ,
nt = a ^ t . i l O " - 1 + ••• + «010* + am_1lOt~l + ••• + am_t, where 0 < t < m - 1. Since 10m = 1 (mod p ) , we have
nt = am„t„110m~1 + . . . + a010* + aOT_110m + t _ 1 + . . . + a ^ l O 7 " = l O ' C a ^ ^ l O * - ' - 1 + . . . + a 0 + a ^ l O * " 1 + . . . + am_t10"-*) = 10tn = 0 (mod p ) .
Also solved by R. Andre-Jeannin, Paul S. Bruckman, C. Georghiou, Russell Jay Hendel, Norbert Jensen & Uwe Pettke, L. Kuipers, Bob Prielipp, Sahib Singh, Lawrence Somer, and the proposer.
Base 9 Modular Arithmetic Progression
B-G8S Proposed by A, P. Hillman in memory of Gloria C. Padilla
Let In be the posi t ive integer whose base 9 numeral 100101102...887888
Is obtained by placing a l l the 3-digi t base 9 numerals end-to-end as indicated a (a) What i s the remainder when h i s divided by the base 9 integer 14? (b) What i s the remainder when h i s divided by the base 9 integer 81?
Solution by C. Georghiou, University of Patras, Greece
It is easy to see that
(100101102...887888)9 = (888)99° +(887)g93+ ... +(100)993'547
- (729 - l)9° + (729 - 2)93+ •»*+ (729 - 648)93*6i47
648 = E (93 - n)93n_3.
n= 1
(a) Nows since (14)9 = 13 and 93 = 1 (mod 13), we have
184 [May
ELEMENTARY PROBLEMS AND SOLUTIONS
h = 6 £ ( 9 3 - n ) 9 3 - " 3 = 6 X ( 1 - n) = 6 4 7 I 6 4 8 = - 3 (mod 13) . n=l n= 1 z
(b) Now we have (81)9 = 73 and 93 = -1 (mod 73). Therefore,
648 648 649 h = E (93 ~ n)93n"3 = -2 + V (-1 - nM-l)"-1 = -l - ]£ n(-l)n
n=l n= 2 n= I
= - 1 - ( - 1 ) 6 ' 9 ( 2 ' f 9 + 1 ) - 1 = 324 E 32 Onod 73 ) .
Also solved by Charles Ashbacher, Paul S. Bruckrnan, and the proposer.
Fibonacci a n d Lucas I d e n t i t i e s
B-669 Proposed by Gregory Wulczyn, Lewisberg9 PA
Do the e q u a t i o n s 25Fa+b + cFa + b-cFb + a-aFo + a-b = 4 " L2a " L2b " L2a + L2aL2bL2o
2 2 2 La+b+cLa+b-eLb+c-aLc+a-b = ™4 + L 2 a + L ^ + L^ + F
2aL2bL2c
hold for a l l even i n t e g e r s a s Z?? and c?
Solution by C. Georghiou, University of Patras, Greece
The answer i s "Yes"! From the i d e n t i t y
5Fm + nFm-n = L 2m ~ ( _ 1 ) ^ 2n
we get [setting (-l)a+i+c = e)
25Fa + b + aFa + b-cFa-b + cFc+b-a = [L2a+2fc ~ e L 2 c J EL2tf " e L 2 a » 2 & ]
_ o = L2a^-L2a+2b + L2a-2b^ ~ eL2a ~ eL2a + 2bL2a-2b
= L2aL2bL2c ~ ^L\a + Llb +Lla " ^>
and for a5 Z?5 and e even ( a c t u a l l y for a + b + o even) s the given i d e n t i t y i s e s t a b l i s h e d .
In a s i m i l a r ways u s i n g the i d e n t i t y Lm+nLm-n = L 2m + ^ l ^ "L2n
we f ind La + b+cLa + b-cLa-b + cLc + b-a = lL2a+2b * eL2c~^L2c + e L 2 a - 2 z J
o = L 2 c [ L 2 a + 2fc + L 2 a - 2 & : ! + eL2o + eL2a +2bL2a -2b
= L2aL2bL2a +^Lla +Llb + L l ~ ^ '
which e s t a b l i s h e s the second iden t i ty®
Also solved by K. Andre-Jeannin, Paul S. Bruckrnan, Herta T. Freitag, Norbert Jensen & Uwe Pettke, l« Kuipers, Bob Prielipp, and the proposer.
1991] 185