ADVANCED PROBLEMS AND SOLUTIONS

Similar documents
ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS Edited by Raymond E. Whitney

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS. Edited by Raymond E. Whitney

ADVANCED PEOBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Russ Euler and Jawad Sadek

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

ADVANCED PROBLEMS AND SOLUTIONS. Edited by Raymond E. Whitney

ADVANCED PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS Edited By RAYMOND E.WHITNEY Lock Haven State College, Lock Haven, Pennsylvania

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by A. P. Hillman

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Russ Euler and Jawad Sadek

PROBLEMS PROPOSED IN THIS ISSUE

^ ) = ^ : g ' f ^4(x)=a(xr + /xxr,

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006

*!5(/i,*)=t(-i)*-, fty.

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rablnowitz

SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS

±i-iy (j)^> = P"±(-iy (j)#> (2)

ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Haven State College, Lock Haven, Pennsylvania

ADVANCED PROBLEMS AND SOLUTIONS

12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.

A GENERALIZATION OF STIRLING NUMBERS

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by A. P. Hillman

COMPOSITIONS AND FIBONACCI NUMBERS

ELEMENTARY PROBLEMS AND SOLUTIONS

MATH 271 Summer 2016 Practice problem solutions Week 1

VAROL'S PERMUTATION AND ITS GENERALIZATION. Bolian Liu South China Normal University, Guangzhou, P. R. of China {Submitted June 1994)

AND RELATED NUMBERS. GERHARD ROSENBERGER Dortmund, Federal Republic of Germany (Submitted April 1982)

Problem Set 5 Solutions

SOME IDENTITIES INVOLVING THE FIBONACCI POLYNOMIALS*

ELEMENTARY PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by A. P. HILLMAN University of New Mexico, Albuquerque, NM 87131

SOLUTIONS FOR 2012 APMO PROBLEMS

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

X X + 1 " P n ) = P m "

Math 109 HW 9 Solutions

Midterm Preparation Problems

ELEMENTARY PROBLEMS AND SOLUTIONS

O N P O S I T I V E N U M B E R S n F O R W H I C H Q(n) D I V I D E S F n

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

1981] 209 Let A have property P 2 then [7(n) is the number of primes not exceeding r.] (1) Tr(n) + c l n 2/3 (log n) -2 < max k < ir(n) + c 2 n 2/3 (l

be a formal power series with h 0 = 1, v(h^) = \ and v(h n ) > 1 for n > 1. Define a n by

CHAPTER V Fermat s last theorem

GOLDEN SEQUENCES OF MATRICES WITH APPLICATIONS TO FIBONACCI ALGEBRA

AND THEIR APPLICATIONS. MALVINA BAICA Marshall University, Huntington WV (Submitted June 1982) INTRODUCTION. * («).= E (-!

A CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS

Edited by Russ Euler and Jawad Sadek

Modular Arithmetic Instructor: Marizza Bailey Name:

Y. H. Harris Kwong SUNY College at Fredonia, Fredonia, NY (Submitted May 1987)

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

When the trivial is nontrivial

Sums of Squares. Bianca Homberg and Minna Liu

CONGRUENCES FOR BERNOULLI - LUCAS SUMS

Math 110 HW 3 solutions

RECURRENT SEQUENCES IN THE EQUATION DQ 2 = R 2 + N INTRODUCTION

Review Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which

ON THE SET OF REDUCED φ-partitions OF A POSITIVE INTEGER

A METRIC RESULT CONCERNING THE APPROXIMATION OF REAL NUMBERS BY CONTINUED FRACTIONS 1. INTRODUCTION AND STATEMENT OF RESULTS

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Math Homework # 4

ON SOME RECIPROCAL SUMS OF BROUSSEAU: AN ALTERNATIVE APPROACH TO THAT OF CARLITZ

1. INTRODUCTION. Ll-5F 2 = 4(-l)" (1.1)

On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1

SOME IDENTITIES INVOLVING GENERALIZED GENOCCHI POLYNOMIALS AND GENERALIZED FIBONACCI-LUCAS SEQUENCES

FIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)

On arithmetic functions of balancing and Lucas-balancing numbers

F O R M U L A S F O R CONVOLUTION F I B O N A C C I NUMBERS AND P O L Y N O M I A L S

Proofs Not Based On POMI

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowltz

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

GENERALIZED LUCAS NUMBERS OF THE FORM 5kx 2 AND 7kx 2

Exercise 2.2. Find (with proof) all rational points on the curve y = 2 x.

Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C (Submitted February 2001) 1. I N T R O D U C T I O N

SOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A.

ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS

103 Some problems and results in elementary number theory. By P. ERDÖS in Aberdeen (Scotland). Throughout this paper c, c,... denote absolute constant

Mathematics 228(Q1), Assignment 2 Solutions

MATH CSE20 Homework 5 Due Monday November 4

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University

QUOTIENTS OF FIBONACCI NUMBERS

CYCLOTOMIC INVARIANTS FOR PRIMES BETWEEN AND

Congruence Properties of G-Functions. By HANSRAJ GUPTA. (Received 12th February, 1934, and in revised form 22nd April, Read 3rd March, 1934.

A Level. A Level Mathematics. Proof by Contradiction (Answers) AQA, Edexcel, OCR. Name: Total Marks:

64 P. ERDOS AND E. G. STRAUS It is possible that (1.1) has only a finite number of solutions for fixed t and variable k > 2, but we cannot prove this

PILLAI S CONJECTURE REVISITED

ON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION

PRIME NUMBERS YANKI LEKILI

{~}) n -'R 1 {n, 3, X)RU, k, A) = {J (" J. j =0

A PROBLEM IN ADDITIVE NUMBER THEORY*

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

Transcription:

Edited by Raymond E. Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HA VEN, PA 17745. 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 consideration, all solutions should be submitted on separate signed sheets within two months after publication of the problems. PROBLEMS PROPOSED IN THIS ISSUE H-553 Proposed by Paul Bruckman, Berkeley, CA The following Diophantine equation has the trivial solution {A, 5, C, D) - (A, A, A, 0): A 3 + B 3 + C 3-3 ABC = D k, k is a positive integer. (1) Find nontrivial solutions of (1), i.e., with all quantities positive integers. H-554 Proposed by N. Gauthier, Royal Military College of Canada Let &, a, and b be positive integers, with a and b relatively prime to each other, and define a. Show that N k :=(l + (-l) k -L k r = (2-L k )~\ k even; = -L~ k \ k odd. a-\ b-l 2^ 2L L q (br+as) ~ N qa N qb [2 + Z^(a+6) ^qa ^qb ^qab + ( V Lqa(b-1) r=0.y=0 br+as<ab -f (-1) L qb ( a _y + (-1) ^q(ab-a-b)] q is a positive integer. b. Show that + N q [{-\fl q(ab _ l) -L qab \, q is a positive integer. I I ^ + f l s ) = N qa N qb \_{-\r a^f q, ab _ a _ b) +F qa +F qb r=0 s=0 br+as<ab ~Fqab + \ V Fqa(b-l) + N q [{-lff q{ab _ X) -F qab l + *qb(a-l) ~ ^q(a+b)] 282 [AUG.

H-555 Proposed by Paul S. Bruckman, Berkeley, CA Prove the following identity: [n/3] (x» + y ) ( * +J/)" = -(-xyy + Y(-l?C n, k [xy{x + y)i k {x 2 +xy + / ) - ", = 1, 2,..., (1) it=o '" < t = (" / J-"^"- 2 *)- Using (1), prove the following: (a) 5" / 2 4=-l + X(-r/C n >,5*4"- 3 *,,, = 2,4,6,...; (2) A:=0 [n/3] (b) S ^ ^ F ^ l + X C - O ' Q. S M ^, ^ 1, 3, 5,... ; (3) k=0 [n/3] ( c ) A,=-1+Z(- 1 )*C I I^2-3 *, /i = l,2,3,.. (4) SOLUTIONS An Odd Problem H-536 Proposed by Paul S. Bruckman, Highwood, IL (Vol 36, no. 1, February 1998) Given an odd prime/?, integers n and r with n > 1, let m = 2[^n) 1, Prove the following congruences: ppp (a),., * ' " n,r,p Z-J rn h. > n,r,p Z=a ' h- K K A - F ^ F M + F," " P+r " r (modp); rop+r ppt _ J7PJ + J (b) 7 ^ ^ n mp+r ^ - ^ r - (modp). Solution by the proposer Proof: We begin with the following identity: F n a m = F m a"-\. (*) We may verify (*) by dealing with the cases n even or n odd separately, then expanding the Binet formulas. A similar identity holds with the a's replaced by /?'s. Raising each side of (*) to the power/?, we obtain: FPof* = F op'-l + i ; ^ - ^ ^ 1999] 283

For 1< k < /? -!, Then, multiplying throughout by a r, we obtain: /? 1 nk+r FP a P +r _ FP a np+r + ^ r E ^ ^ 0 _ ( m o (j ^ Note that the quantities "!/ " are the uniquely determined inverses k~ l (mod/? 2 ); upon division throughout by p, these become the uniquely determined inverses k~ l (mod p). A similar congruence holds with the a's replaced by /?'s. Subtracting these two congruences and dividing throughout by p«j5 yields the result in (a). Adding these two congruences and dividing throughout hyp yields (b). Note: Using these results, it may be shown that a necessary and sufficient condition for Z{p 2 ) = Z{p) is that Also solved by H.-J. Seiffert K A Recurrent Theme H-537 Proposed by Stanley Rabinowitz, Westford, MA (Vol 36, no. 1, February 1998) Let (w n ) be any sequence satisfying the recurrence Let e = w 0 w 2 - wf and assume e * 0 and Q ^ 0. Computer experiments suggest the following formula, k is an integer larger than 1: Prove or disprove this conjecture. " ta = 4ri c *wf?l(-i)x*ft, e ;=o V / ^=z(*; 2 )(H2-'oy< 2 -Vy Solution by Paul S. Bruckman, Berkeley, CA We may express the w n 's in terms of the "fundamental" sequence {(/> ), defined as follows: 4, = («"-v")/(a-v), (1) u = y 2 (p+0i v = y 2 (p-0), e=(p 2-4Q) l /i. (2) 284 [AUG.

Note that w + v = P, u-v-6^ and uv = Q. Also note that the ^w's satisfy the same recurrence relation as the w n9 s, but have the initial values: Also, ^_ 1 = -1 / g, ^2 = P. The formula for w w is then as follows: ^o = > 01 = 1. (3) W n= W A-Q*o4n-V ( 4 ) We proceed to obtain closed form expressions for the indicated sums. First, we obtain a closed formula for the c t 's, substituting the expressions in (4): Ci = ff~i (uwi _ ^y-^f^qxwo^-^-o^o i*y or Next, let 7=0 = 6r\uw l - Qw 0 )ii'\w x - vw 0 f- 2 - erxvw, - Qw^'\w x - uw 0 f~ 2 ci = r V (w x - vw 0 ) k - 1-0~ l v i (w l - wwo)*" 1. (5) k Note that this last expression differs from the sum given in the statement of the problem (with the roles of w n and w n+l interchanged). Substituting the expression in (5) yields: or S n,k = P't *QK)*-'(-"W,y («*~>i - vwo)*" 1 - v k -'(w, - uwrf- 1 } s n, k = r'^-^fk-^f-r'^-^fk-^,) 4. (6) The problem (as corrected) asks us to verify or refute the relation ^ = ^ H n - (7) Next, we employ the following relations [easily verified from the preceding relations, including (4)]: Wn - W n + l = (^0 ~ W lv', ( 8 ) w» - w +1 = (vw 0 - w x )u n. (9) It is also easily verified that Putting these facts together, we obtain (after simplification): (uw 0 - Wi)(vw 0 - Wj) = -e. (10) S, k = 0"V, - vwtf-\uw H - w +1 ) k - 6r\w x - uw 0 ) k -\vw - w +l f = e k -\w4 kn - g u ^ - i ) = e k -\n- Q- E.D. 1999] 285

Thus, there is a typographical error in the statement of the problem; the result is true only if the quantities w n and w n+l occurring in the first sum given are interchanged. Also solved by H.-J. Seiffert An Elementary Result H-538 Proposed by Paul S. Bruckrnan, Highwood, IL (Vol 36, no. 1, February 1998) Define the sequence of integers (B k ) k > 0 by the generating function: Show that (l- x y\l + xyi = Y,B k &^, \x\<l (see[l]). Kl k>0 l Y B k-^r ^, = ^ r - T» o g 2 ^ i# = l + V2. k p? 0 (2*+ 2)! 8 4 B ' Reference 1. P. S. Bruckrnan. "An Interesting Sequence of Numbers Derived from Various Generating Functions." The Fibonacci Quarterly 10.2 (1972):169-81. Solution by the proposer In [1], it is shown that tan" 1 x (1 - x 2 y m X = Bf **> *(2* + l)!' The following result is Elementary Problem E3140, Part (b)(ii), proposed by Khristo Boyadzhiev in The American Math Monthly 93.3 (1986):216: \\m- x x-{\-x 2 )- V2 dx = 7T 2 l%-\\og 2 u. (The notation is modified to conform to our own.) The result follows immediately, by integrating the series given in [1] term by term and evaluating it at the integral's limits. Beta Version H-539 Proposed by H.-J. Seiffert, Berlin, Germany (Vol 36, no. 2, May 1998) Let H m (p) = f j B^PymGN,p>0, denotes the Beta function. Show that for all positive reals/? and all positive integers n, From (1), deduce the identities ±(-lf-i(n)h 2k (p) = 4"+r- i B(n + p,n + p-l) + ^. (1) V J n-tp i 286 [AUG.

and Solution by the proposer Since t^-'imyurj I(-^)/(?) = ^T- B { v p ) = i tu ~ 2)i2{i - t)p ~ idt = 2 iy i v - ui^du > (2) (3) it easily follows that HJj>) = 2\ ^-{X-uy-'du, \-u> r 0 \-U men. If S (p) denotes the left side of the stated identity (1), then, by the Binomial theorem, fv «( l - I f S (P) = 2 2 ) ^ 1 du or k{ n \ 2k v * / # Vi-^-'^.^f. ^ o - ^ - 1 tfw = 2 ( l -» 0 " ' du \-U Jo 1-H ^»=j o I o-«r'- 2 (i+iir^idii. Substituting w = 1-2v yields Integrating (4) by parts, we find -S (p) = 4" +p - x \ V2 v n+p - 2 (\-v)" +p - x dv. (4) -SJp) = - + 4" +p - 1 f' 2 v n+p - l (l - v) n+p - 2 dv. 2 " n + p-l } o Replacing v by 1 - v in the latter integral, we get itf)- 1 + 4«+p-i f' v»+p- 2 (\ - v) n+p - ] dv. ^ - 1 Jl/2 Now, the desired identity (1) follows by adding (4) and (5). Interestingly, (2) and (3) will follow from (1), simultaneously, when taking p = l/2. as is well known, 'i"hh»" w --"H)-7/(^'^we have * _1 1 (la. & 4 r l(2r ^-l'h^w^'l^)%rnr k ' (5) Since, 1999] 287

Each of the equations S^)-^)-*-- f^h^h 4 -*- can be proved by a simple induction argument. Hence. Using 'O 2k(2k\_ t J Ak l(2k ^m-yitmvi*!- 1!-*'* D,, 1 M In 2;r 5 «+ 2 ' ",w 2 j 4 2n ~ (2n-2\ and observing that ;r is an irrational number, from (1) with p = 1 / 2, we find the two equations and!<-^f(zx*)-4m-" 2 ) i^i'm")- 1 )^ Obviously, (2) is equivalent to (6). Dividing (7) by 2 and adding l(-r(j)=i to both sides of the resulting equation gives (3). With p = l, identity (1), after dividing by 2, gives (6) (7) U W " (2w)» 2*' i/^ = /^(l) 12- ZJ =1 1 // is the rrfi" harmonic number. This equation (including a generalization in another direction) was obtained in [1]. Reference 1. L. C. Hsu & H. Kappus. Problem B-818. The Fibonacci Quarterly 35.3 (1997):280-81. Also solved by P. Bruckman and partially by A. Stam. 288