ADVANCED PROBLEMS AND SOLUTIONS
|
|
- Mariah Garrett
- 5 years ago
- Views:
Transcription
1 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 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 B-572 Proposed by Paul S* Bruckman, Berkeley\ CA Prove the following, where <p - a~ l : {<p 5n+l l (5/i +1) + <p 5n+3 / (5n + 2) - tp 5n+4 1 (5n + 3) - <p 5n+4 / (5/i + 4)} = (x/25)(50-l0j5) y2. H-573 Proposed by N. Gauthier, Royal Military College of Canada "By definition, a magic matrix is a square matrix whose lines, columns, and two main diagonals all add up to the same sum. Consider a 3 x 3 magic matrix O whose elements are the following combinations of the rfi 1 and (w + l)* Fibonacci numbers: O ll = 3F n+l +F n ; % 2 = F n+h l3 = 2F n+l +2F ; * 2 1 = Fn+1 + 2F n> ^ 2 2 = 2F W F ; d> 23 = 3F n+h *3i=2/Wi; ^32 = 3F n+l + 2F n ; <D 33 - F n+l+ F n. Find a closed-form expression for <P W, where m is a positive Integer, and determine all the values of m for which it too is a magic matrix." SOLUTIONS Geometric? H-561 Proposed by K Gauthier, Dept of Physics, Royal Military College of Canada (Vol 38, no. 2, May 2000) Let n be an integer and set s n+l = a n + a n ~ l fi+ + a$ n ~ l +fi n y where a + $ = a, a$ = b, with a & 0, b * o two arbitrary parameters. Then prove that: (b) ffa = (-l){ 'M^W+pr+n, ( C ) S ip+q S qr+n = 2^\ r P S p+q S {2p+q)t-pr+m where r > 0, w, p(* 0), and q(* 0,±p) are arbitrary integers. 2001] 187
2 Solution by Paul S. Bruckman^ Berkeley 9 CA Let the sums indicated in the right-hand members of parts (a), (b), and (c) be denoted by $& = <9&(p,q,r,ri), < 3b = ( 3b(p,q,r,n), %-%{p,q,r,n), respectively, We distinguish two pos bilities: Case 1, where a 2 ^4b, i.e., a^jb; Case 2, where a 2 = 4b, i.e., a-(i. For Case 1, the Binet formula holds: s n - (a n - j3 n )/(a-/j); for Case 2, we have: s n = na n ~ l P in either case for all integers n. We first deal with Case 1; we also make the substitution 0-a-p. The sums may be evaluated by application of the appropriate formula for s n and the Binomial theorem. We will also employ some auxiliary results, given in the form of lemmas. Lemma 1: h q s p _ q + a p s q = a q s p ; b q s p _ q +/?% = /?%. also, Proof: b q $ p _ q +a p s q = {{ap) q {a p - q ~ p p ~ q ) + a p {a q - fi*)}/0=a p (a q -fi q )/0^a q s p ; b q s p _ q +@ p $ q = {(a/3) q (a p - q -p p - q )+@ p (a q - Lemma 2: s p+q - a q s p p s q ; s p+q -p q s p = a p s q. Proof: In Lemma 1, replace/? by p + q, then divide by a q (or J3 q ). D Lemma 3: 0 p+ % + a p s p+q = a p+q s p +/J p s p+q = s,^. Proof: Replace q by p + q in Lemma 2. We may now proceed to the proof of the problem, at least for Case 1. (a) si = rc k b^- k \s q ) k (s p _ q y k (a pk+ "-j3 pk+ ")/0 k=0 = (a"/0w Sp _ q + ap Sq Y-(P"/0)(b%_ q+^s q y = (a* /6)(a q s p ) r - {fi" 16)(fi q s p ) r (using Lemma 1) = (s p na" r+ "-p^")l0 = (s p Ys qr+n. D (t) % = (-i) fc rc k ( Sp ) k ( Sp+q y- k (a gk+pr+ "-^k+ p r+n )/e = (a pr+ "/0)(s p+q - a%) r - (fi pr+ "/0)(s p+q - P"s p y = a pr+ " 10)p pr {s q ) r -(J3 pr+n 10)a pr (s q ) r (usinglemma2) = b pr (s q y{a"-p n )i0 = b pr { Sq y Sn. (c) ^tc^^'^'^^^/tafw^"-/;^)^")/^ k=q = (a~ pr+ "/0)(b p+q s p + a 2p+q s p+q y-(p- pr+ "/0)(b p+ ' 1 s p + p 2p+q Sp+qy = ( a - pr+n+pr+qr 10)(fi p + q s p + a p s p+q ) r - (fi-pr^pr^r / ff)^^ + P p s p+q ) r ; hence, using Lemma 3, ^ = (a qr+ "/0)(s 2p+q y-(fi qr+ "/0)(s 2p+q y =(s 2p+q Ys qr+. D 188 [MAY
3 It remains to prove (a), (b), and (c) for Case 2. We first show that Lemmas 1, 2, and 3 are valid for this case as well; the modified versions of these lemmas are denoted by a "prime" punctuation. Lemma 1 f : b q s p _ q + a p s q = a q s p. Proof: b q s p _ q + a p s q = (p- q)a 2q (a p - q ~ l ) + qa p (a q ~ l ) = pa p+q ~ l = pa p ~ l a q = a q s p. D Lemma 2 f : s p+q - a q s p = a p s q. Proof: Replace p by p + q in Lemma V and divide by a q. D Lemma 3 f : a p+q s p + a p s p+q = & lp q. Proof: Replace qby p + q'mlemma T. = P r Z r-ic k b^- x - k \s q r\s p _J- x - k a^^"- x +nt rc k b^- k \s q f(s p _ q y- k a pk+ "- 1 k=0 k=0 - pr$ q a p+n ~ l {b q $ p _ q + a p s q Y~ l +na n ~ l {h q s p _ q + a p s q } r = pra p+n - l+q{r - l) s(sj- 1 +na n - l+qr q\»p, """ (sj \ p/ (usinglemma 1') = a^"- 2+ i r (sy- l (pqr + np) = pa p ~\qr + n)a* r +»-\s p T l = (sj Sqr+. D (*>)' =T(-i) k rc k ( Sp ) k (s p+q y- k (qk + pr + n)a<> k+ r r+ "- 1 /?/ qr+n' + 0'/-+/i)a^-, X(-l) k rc t (^)*(* p +,r t a» t = -qrs p a" +pr+ "-\s p+q - a*s p T x + {pr + n)a pr+ "-\s p+q - a«s p J = -qrs p a q+pr+ "-\a p s q y- 1 + {pr+ ri)a pr+ "-\a p s q ) r (using Lemma 2') = { - r a ^ a ^ " + (pr + n)s q a pr+n - 1+p }(a p s q y- 1 = {-ra p a 2pr+n - ; ' + (pr + «)a 2pr+ "-! }(s? ) r = {-pra 2^"-' + (pr + n)a 2pr+ "~ l }(s q y = na 2pr+ "-\s q y = a 2pr (s q ys = S ^ ) ' *,,. (c)': % = 2 r Q ^ + ^ - t ) ( 5 ;, ) r - * ( V g ) i {(2p +?)* - pr+n) k=0 CPP+IV-P""-* = (2/? +? )m 2^-^+"- V, Z r-iq A ^ ^ ' - ^ ^ r 1 - * ^ ) * ^ 2 ^ ^ + ifc=0 2001] 189
4 + {-pr + n)a' pr+n ~ l Y, rc k b (p+^r-k \s p J- k (s p+q ) k a i2p+q)k k=0 = (2p + q)ra 2p+q - pr+ "'\ +q (b p+ % + a 2p+ % +q y~ l + (-pr + n)a- pr+h - 1 (b p **s p + a 2p+q s p+q ) r = (2p + q)ra 2p+q - pr+n - l a (p^r- X) s p+q (a p+q s p + a p s p+q ) r (-pr + n)a- pr+ "- l a (p+ ' l)r (a p+ ' } s p +a p s p+q y = (2p + qyao-^s^i^j- 1 + (-pr+n)a^^\s 2pHi y = r a ^ ^ - ^ ^ s ^ i ^ J + (-pr+nw^i^j = r(p + q)a- p+qr+ "- q+p+q -\s 2p+q Y + (-pr+^a^'x^j = r(p + q)a qr+ '-\ S2p+q y+(-pr +r,)a qr+ "- l (s 2p+q y = (qr + n)a^"- l (s 2p+q y = (^Js qr+n. This completes the proof of the problem. Also solved by H. Kwong, H.-J. Seiffert, and the proposer. Greatest ProbSem H-562 Proposed by H.-J. Seiffert, Berlin, Germany (Vol 38, no. 2, May 2000)-corrected Show that, for all nonnegative integers n, where [ ] denotes the greatest integer function. Solution by the proposer Define the Fibonacci polynomials by F 0 (x) - 0, F x (x) - 1, and F +2 (x) = xf n+l (x) + F n (x), for n GN 0 (natural numbers). Let A n : = i n ~ l F n (ia) 9 nen 0, where i = ^/(-l). Writing n = 5m + r, where men Q and re {0,1,2,3,4}, a simple induction proof on m yields A, 0 ifn = 0(mod5), 1 if w = 1 (mod 5), -a ifn = 2 (mod 5), (1) a ifn = 3 (mod 5), [-1 if«= 4(mod5). From H-518 [identity (8)], we know that, for all complex numbers x and all nonnegative integers n, tc-^w-^ 190 [MAY
5 With x = / a, this gives ;? 0 U 2 - J ^ cr (2) a x Since 1 / (4 - a 2 ) = a IJ5,. we have or, by a r = (L r + j5f r )/2, r ez, n _ 2n 4 " - a 1 A-a 2 S (4"a-a2n+1 ). 4 " _ a2n /c i 4 - a 2 10 On the other hand, from (1), it follows that j=o \ - - = (4" - ^ i ) 4 ( 4 " ~ ^ i ) - (3) [ ] [?], J y 4=0 v y fc=o v Usinga 2 = (3 + V5)/2, we then obtain ±U?,)4- J=0 [ fv In \W( In L{n-5k-2)+^o{n-5k- + *,, where q n is a rational number. Since V5 is irrational, (2), (3), and the latter equation imply that This proves the desired identity, because XL-5^-2) + XL-5i-3)"5 ( 4 "~^+i> fc=0 V J k=q V y J w-2' {n-5k-2y{n~5k-3) = {n-%-2j> - k ~ where we set ( 2 /) = 0 for j < G. ^4/so solved by H. Kwong and P. Bruckmait A Stirling Problem H-563 Proposed by N. Gauthier, Dept of Physics, Royal Military College of Canada (Vol 38, mo. 2, May 2000) Let /w>0, n>0, p&q, q*-p,0, and s be integers and, for \<k<n, let {ri) k :=n(n~l)... (n - k +1) and S^ be a Stirling number of the second kind. Prove the following identity for Fibonacci numbers: I(-l) r ; ^[F/F p+ J r F 9r+^(-ir[^/F p+ J"X(-l)^fc («) fc^>[f p /FJ fe V^ np+sk=\ 2001] 191
6 Solution hy the proposer For x an arbitrary variable, consider the binomial expansion identity z(;v=o-x)-, r = 0 V / and apply the operator D := x~ to it m times (m > 0) to get ^r m ( n f\x r =D m (l + x) n. By a well-known result, where {8^ : 1 < k < m; \<m} are the Stirling numbers of the second kind. Consequently, Next, for integers p (^ 0), q(^0 9 -p), solve the following for w and w: One readily finds Inserting x = i/a g, 1 + x = wa~ p n 1 + tfa^vc"^; l + ufi q =w/t p. «= -lf p /F p+q ]; w = (-\y[f q IF p, q l (**) in (*) and multipying the resulting equation by a s then gives m f \ X r U )u r a qr+s = S%\n) k ita#+^kcfi>- n p. Finally, replace a and /? in this result, subtract from the above, and divide by V5 to get n m f \ I ' " r «r / V" = l^\n) k u k w"-% +q)k _ np+s. V / lc=l Inserting the values for u and w from (**) then establishes the result claimed in the problem statement. The case m = 0 is readily dealt with, and one gets F Q r+s K A y ' \ F -pn+s- \ J p+gj VP+QJ 192
ADVANCED PROBLEMS AND SOLUTIONS
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
More informationADVANCED PEOBLEMS AND SOLUTIONS
ADVANCED PEOBLEMS AND SOLUTIONS Edited by Raymond E* Whitney Please send all communications concerning to RAYMOND K WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 7745. This department
More informationADVANCED PROBLEMS AND SOLUTIONS Edited by Raymond E. Whitney
Edited by Raymond E. Whitney Please send all communications concerning to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HA VEN, PA 7745. This department especially welcomes problems
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by RAYMOND E. WHITNEY Please send all communications concerning to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 17745. This department especially welcomes problems
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by Florian Luca Please send all communications concerning ADVANCED PROBLEMS AND SOLU- TIONS to FLORIAN LUCA, IMATE, UNAM, AP. POSTAL 61-3 (XANGARI),CP 58 089, MORELIA, MICHOACAN, MEXICO, or by e-mail
More informationADVANCED PROBLEMS AND SOLUTIONS. Edited by Raymond E. Whitney
Edited by Raymond E. Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 7745. This department
More informationADVANCED PROBLEMS AND SOLUTIONS
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 PA 17745, This department
More informationADVANCED PROBLEMS AND SOLUTIONS
ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lk Haven State College, Lock Haven, Pennsylvania 17745 Send all communications concerning Advanced Problems and Solutions to Raymond E. Whitney,
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by Raymond E* Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 775. This department
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Russ Euler and Jawad Sadek
Edited by Russ Euler and Jawad Sadek Please submit all new problem proposals and corresponding solutions to the Problems Editor, DR. RUSS EULER, Department of Mathematics and Statistics, Northwest Missouri
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by Raymond E 0 Whitney Please send all communications concerning to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 17745. This department especially welcomes problems
More informationADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Haven State College, Lock Haven, Pennsylvania
ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Haven State College, Lock Haven, Pennsylvania Send all communications concerning Advanced Problems and Solutions to Raymond E. Whitney,
More informationADVANCED PROBLEMS AND SOLUTIONS Edited By RAYMOND E.WHITNEY Lock Haven State College, Lock Haven, Pennsylvania
ADVANCED PROBLEMS AND SOLUTIONS Edited By RAYMOND E.WHITNEY Loc Haven State College, Loc Haven, Pennsylvania Send all communications concerning Advanced Problems and Solutions to Raymond E. Whitney, Mathematics
More informationADVANCED PROBLEMS AND SOLUTIONS. Edited by Raymond E. Whitney
Edited by Raymond E. Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E, WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 17745. This department
More informationSOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS
SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS A. G. SHANNON* University of Papua New Guinea, Boroko, T. P. N. G. A. F. HORADAIVS University of New Engl, Armidale, Australia. INTRODUCTION In this
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz
Edited by Stanley Rabinowitz Please send all material for to Dr. STANLEY RABINOWITZ; 12 VINE BROOK RD; WESTFORD, MA 01886-4212 USA. Correspondence may also be sent to the problem editor by electronic mail
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz
Edited by Stanley Rabinowitz IMPORTANT NOTICE: There is a new editor of this department and a new address for all submissions. Please send all material for ELEMENTARY PROBLEMS AND SOLUTIONS to DR. STANLEY
More informationADVANCED PROBLEMS AND SOLUTIONS
ADVANCED PROBLEMS AND SOLUTIONS EDITED BY FLORIAN LUCA Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to FLORIAN LUCA, MATHEMATICAL INSTITUTE, UNAM, CP 0450, MEXICO DF, MEXICO
More information^ ) = ^ : g ' f ^4(x)=a(xr + /xxr,
Edited by Stanley Rablnowitz Please send all material for ELEMENTARY PROBLEMS AND SOLUTIONS to Dr. STANLEY RABINOWITZ; 12 VINE BROOK RD; WESTFORD, MA 01886-4212 USA. Correspondence may also be sent to
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by A. P. Hillman
Edited by A. P. Hillman Please send all material for 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
More informationADVANCED PROBLEMS AND SOLUTIONS
ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E. WHITNEY Lock Haven State College, Lock Haven, Pennsylvania Send all communications concerning Advanced Problems and Solutions to Raymond E. Whitney,
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationY. H. Harris Kwong SUNY College at Fredonia, Fredonia, NY (Submitted May 1987)
Y. H. Harris Kwong SUNY College at Fredonia, Fredonia, NY 14063 (Submitted May 1987) 1. Introduction The Stirling number of the second kind, S(n, k), is defined as the number of ways to partition a set
More informationLONGEST SUCCESS RUNS AND FIBONACCI-TYPE POLYNOMIALS
LONGEST SUCCESS RUNS AND FIBONACCI-TYPE POLYNOMIALS ANDREAS N. PHILIPPOU & FROSSO S. MAKRI University of Patras, Patras, Greece (Submitted January 1984; Revised April 1984) 1. INTRODUCTION AND SUMMARY
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Russ Euler and Jawad Sadek
Edited by Russ Euler and Jawad Sadek Please submit all new problem proposals and corresponding solutions to the Problems Editor, DR. RUSS EULER, Department of Mathematics and Statistics, Northwest Missouri
More informationSOME IDENTITIES INVOLVING GENERALIZED GENOCCHI POLYNOMIALS AND GENERALIZED FIBONACCI-LUCAS SEQUENCES
SOME IDENTITIES INVOLVING GENERALIZED GENOCCHI POLYNOMIALS AND GENERALIZED FIBONACCI-LUCAS SEQUENCES Zhizheng Zhang and Jingyu Jin Department of mathematics, Luoyang Teachers College, Luoyang, Henan, 471022,
More informationLetting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.
1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a
More informationFibonacci and Lucas Identities the Golden Way
Fibonacci Lucas Identities the Golden Way Kunle Adegoe adegoe00@gmail.com arxiv:1810.12115v1 [math.nt] 25 Oct 2018 Department of Physics Engineering Physics, Obafemi Awolowo University, 220005 Ile-Ife,
More informationON THE SET OF REDUCED φ-partitions OF A POSITIVE INTEGER
ON THE SET OF REDUCED φ-partitions OF A POSITIVE INTEGER Jun Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, P.R. China Xin Wang Department of Applied Mathematics,
More informationEdited by Russ Euler and Jawad Sadek
Edited by Russ Euler and Jawad Sadek Please submit all new problem proposals and corresponding solutions to the Problems Editor, DR RUSS EULER, Department of Mathematics and Statistics, Northwest Missouri
More informationX X + 1 " P n ) = P m "
ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A. P. HILLiVIAW University of New IVSexico, Albuquerque, New Mexico Send all communications regarding Elementary Problems and Solutions to Professor A. P. Hillman,
More informationA NEW METHOD OF INVERSION OF THE LAPLACE TRANSFORM* ATHANASIOS PAPOULIS. Polytechnic Institute of Brooklyn
405 A NEW METHOD OF INVERSION OF THE LAPLACE TRANSFORM* BY ATHANASIOS PAPOULIS Polytechnic Institute of Brooklyn Introduction. In determining a function r(t) from its Laplace transform R(p) R(p) = [ e"'r(t)
More informationExhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No
xhibit 2-9/3/15 Invie Filing Pge 1841 f Pge 366 Dket. 44498 F u v 7? u ' 1 L ffi s xs L. s 91 S'.e q ; t w W yn S. s t = p '1 F? 5! 4 ` p V -', {} f6 3 j v > ; gl. li -. " F LL tfi = g us J 3 y 4 @" V)
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationPARTITIONS, COMPOSITIONS AND CYCLOMATIC NUMBER OF FUNCTION LATTICES
0#0# PARTITIONS, COMPOSITIONS AND CYCLOMATIC NUMBER OF FUNCTION LATTICES EDUARD FUCHS University of J. E Purkyne, 662 95 Brno, Czechoslovakia (Submitted June 1982) 1. INTRODUCTION By a poset we mean a
More informationELEMENTARY PROBLEMS AND SOLUTIONS
ELEMENTARY PROBLEMS AND SOLUTIONS EDITED BY RUSS EULER AND JAWAD SADEK Please submit all new problem proposals and their solutions to the Problems Editor, DR RUSS EULER, Department of Mathematics and Statistics,
More informationON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION
ON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION Leetsch C. Hsu* Dalian University of Technology, Dalian 116024, China (Submitted August 1995) 1. INTRODUCTION Let (t\h) p denote the generalized
More information1. INTRODUCTION. n=. A few applications are also presented at the end of the Note. The following Theorem is established in the present Note:
CONVOLVING THE m-th POWERS OF THE CONSECUTIVE INTEGERS WITH THE GENERAL FIBONACCI SEQUENCE USING CARLITZ S WEIGHTED STIRLING POLYNOMIALS OF THE SECOND KIND N. Gauthier Department of Physics, The Royal
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by A. P. Hillman
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 be on a separate sheet (or
More informationDYNAMICS OF THE ZEROS OF FIBONACCI POLYNOMIALS M. X. He Nova Southeastern University, Fort Lauderdale, FL. D, Simon
M. X. He Nova Southeastern University, Fort Lauderdale, FL D, Simon Nova Southeastern University, Fort Lauderdale, FL P. E. Ricci Universita degli Studi di Roma "La Sapienza," Rome, Italy (Submitted December
More informationEdited by Russ Euler and Jawad Sadek
Edited by Russ Euler and Jawad Sade Please submit all new problem proposals and corresponding solutions to the Problems Editor, DR RUSS EULER, Department of Mathematics and Statistics, Northwest Missouri
More informationA L A BA M A L A W R E V IE W
A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N
More informationA GENERALIZATION OF STIRLING NUMBERS
Hongquan Yu Institute of Mathematical Sciences, Dalian University of Technology, Dalian 6024, China (Submitted September 996-Final Revision December 996). INTRODUCTION Let W(x), fix), g(x) be formal power
More informationA MATRIX SEQUENCE ASSOCIATED WITH A CONTINUED FRACTION EXPANSION OF A NUMBER. DOWALD B. SMALL Colby College, Watervilfe, Maine 04901
A MATRIX SEQUENCE ASSOCIATED WITH A CONTINUED FRACTION EXPANSION OF A NUMBER DOWALD B. SMALL Colby College, Watervilfe, Maine 04901 INTRODUCTION In Section 1, we Introduce a matrix sequence each of whose
More informationEN221 - Fall HW # 1 Solutions
EN221 - Fall2008 - HW # 1 Solutions Prof. Vivek Shenoy 1. Let A be an arbitrary tensor. i). Show that II A = 1 2 {(tr A)2 tr A 2 } ii). Using the Cayley-Hamilton theorem, deduce that Soln. i). Method-1
More informationLupe Latin squares of order odd, 3-odd, A 2 + 3B 2 with gcm(a, B) = 1
Toyama Math. J. Vol. 34(2011), 1-22 Lupe Latin squares of order odd, 3-odd, A 2 + 3B 2 with gcm(a, B) = 1 Kazuo Azukawa Abstract. Let p be an odd integer which is written as p = A 2 + 3B 2 with gcm(a,
More informationGENERATING FUNCTIONS OF CENTRAL VALUES IN GENERALIZED PASCAL TRIANGLES. CLAUDIA SMITH and VERNER E. HOGGATT, JR.
GENERATING FUNCTIONS OF CENTRAL VALUES CLAUDIA SMITH and VERNER E. HOGGATT, JR. San Jose State University, San Jose, CA 95. INTRODUCTION In this paper we shall examine the generating functions of the central
More informationDIFFERENTIAL PROPERTIES OF A GENERAL CLASS OF POLYNOMIALS. Richard Andre-Jeannin IUT GEA, Route de Romain, Longwy, France (Submitted April 1994)
DIFFERENTIAL PROPERTIES OF A GENERAL CLASS OF POLYNOMIALS Richard Andre-Jeannin IUT GEA, Route de Romain, 54400 Longwy, France (Submitted April 1994) 1. INTRODUCTION Let us consider the generalized Fibonacci
More informationSYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 186, December 1973 SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES BY MORRIS NEWMAN ABSTRACT. We show that any vector of n relatively prime
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationPROBLEMS PROPOSED IN THIS ISSUE
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 be on a separate sheet (or
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More information17 Advancement Operator Equations
November 14, 2017 17 Advancement Operator Equations William T. Trotter trotter@math.gatech.edu Review of Recurrence Equations (1) Problem Let r(n) denote the number of regions determined by n lines that
More information±i-iy (j)^> = P"±(-iy (j)#> (2)
I D E N T I T I E S AND CONGRUENCES INVOLVING H I G H E R - O R D E R EULER-BERNOULLI NUMBERS AND P O L Y N O M I A L S Giiodong Liu Dept. of Mathematics, Huizhou University, Huizhou, Guangdong 516015,
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationRANDOM FIBONACCI-TYPE SEQUENCES
R. DAWSON, G. GABOR, R. NOWAKOWSKI, D, WIENS Dalhousie University, Halifax, Nova Scotia (Submitted December 1983) 1, INTRODUCTION In t h i s p a p e r, we s h a l l study s e v e r a l random v a r i a
More informationreview To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17
1. Revision Recall basic terms of algebraic expressions like Variable, Constant, Term, Coefficient, Polynomial etc. The coefficients of the terms in 4x 2 5xy + 6y 2 are Coefficient of 4x 2 is 4 Coefficient
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationPart IA. Numbers and Sets. Year
Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationp-regular functions and congruences for Bernoulli and Euler numbers
p-regular functions and congruences for Bernoulli and Euler numbers Zhi-Hong Sun( Huaiyin Normal University Huaian, Jiangsu 223001, PR China http://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers,
More information*!5(/i,*)=t(-i)*-, fty.
ON THE DIVISIBILITY BY 2 OF THE STIRLING NUMBERS OF THE SECOND KIND T* Lengyel Occidental College, 1600 Campus Road., Los Angeles, CA 90041 {Submitted August 1992) 1. INTRODUCTION In this paper we characterize
More informationF 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
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 Guodong Liu Dept. of Mathematics, Huizhou University, Huizhou, Guangdong, 516015, People's Republic of China (Submitted
More informationA LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS
A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS C. T. L O N G and J. H. JORDAN Washington State University, Pullman, Washington -*-* Introduction,, As Is well known., a number of remarkable and interesting
More informationSOME IDENTITIES INVOLVING THE FIBONACCI POLYNOMIALS*
* Yi Yuan and Wenpeeg Zhang Research Center for Basic Science, Xi'an Jiaotong University, Xi'an Shaanxi. P.R. China (Submitted June 2000-Final Revision November 2000) 1. INTROBUCTION AND RESULTS As usual,
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationVAROL'S PERMUTATION AND ITS GENERALIZATION. Bolian Liu South China Normal University, Guangzhou, P. R. of China {Submitted June 1994)
VROL'S PERMUTTION ND ITS GENERLIZTION Bolian Liu South China Normal University, Guangzhou, P. R. of China {Submitted June 994) INTRODUCTION Let S be the set of n! permutations II = a^x...a n of Z = (,,...,«}.
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationNOTE ON FIBONACCI PRIMALITY TESTING John Brillhart University of Arizona, Tucson, AZ (Submitted August 1996-Final Revision January 1997)
John Brillhart University of Arizona, Tucson, AZ 85721 (Submitted August 1996-Final Revision January 1997) 1. INTRODUCTION One of the most effective ways of proving an integer N is prime is to show first
More informationExercise 2.2. Find (with proof) all rational points on the curve y = 2 x.
Exercise 2.2. Find (with proof) all rational points on the curve y = 2 x. Exercise 2.4: Prove that for any integer n 0, e n is not a rational number. Exercise 2.5: Prove that the only rational point on
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More informationCLASSES OF IDENTITIES FOR THE GENERALIZED FIBONACCI NUMBERS G n = G n _ t + G n _ c FROM MATRICES WITH CONSTANT VALUED DETERMINANTS
CLASSES OF IDENTITIES FOR THE GENERALIZED FIBONACCI NUMBERS G n = G n _ t + G n _ c FROM MATRICES WITH CONSTANT VALUED DETERMINANTS Marjorle Bicknell-Johnson 665 Fairlane Avenue, Santa Clara, CA 955 Colin
More informationAREA-BISECTING POLYGONAL PATHS. Warren Page New York City Technical College, CUNY
Warren Page New York City Technical College, CUNY K. R. S. Sastry Addis Ababa, Ethiopia (Submitted November 1990) Introduction For a rather striking geometrical property of the Fibonacci sequence f 0 =
More informationA METRIC RESULT CONCERNING THE APPROXIMATION OF REAL NUMBERS BY CONTINUED FRACTIONS 1. INTRODUCTION AND STATEMENT OF RESULTS
A METRIC RESULT CONCERNING THE APPROXIMATION OF REAL NUMBERS BY CONTINUED FRACTIONS C. Eisner Institut fur Mathematik, Technische Universitat Hannover, Welfengarten 1, Hannover, Germany {Submitted October
More informationw = X ^ = ^ ^, (i*i < ix
A SUMMATION FORMULA FOR POWER SERIES USING EULERIAN FRACTIONS* Xinghua Wang Math. Department, Zhejiang University, Hangzhou 310028, China Leetsch C. Hsu Math. Institute, Dalian University of Technology,
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationDIVISIBILITY BY FIBONACCI AND LUCAS SQUARES
DIVISIBILITY BY FIBONACCI AND LUCAS SQUARES V. E. HOGGATT, JR., and MARJORIE B5CKNELL JOHNSON San Jose State University, San Jose, California 95192 1. INTRODUCTION In Matijasevic's paper [1] on Hilbert's
More informationApplications. More Counting Problems. Complexity of Algorithms
Recurrences Applications More Counting Problems Complexity of Algorithms Part I Recurrences and Binomial Coefficients Paths in a Triangle P(0, 0) P(1, 0) P(1,1) P(2, 0) P(2,1) P(2, 2) P(3, 0) P(3,1) P(3,
More informationMATHEMATICS AND GAMES* Nagayoshi lwahori University of Tokyo
MATHEMATICS AND GAMES* Nagayoshi lwahori University of Tokyo When one looks at mathematical phenomena or theories from various points of view instead of from only one angle, one usually gets some unexpected
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationfn" <si> f2(i) i + [/i + [/f] (1.1) ELEMENTARY SEQUENCES (1.2)
Internat. J. Math. & Math. Sci. VOL. 15 NO. 3 (1992) 581-588 581 ELEMENTARY SEQUENCES SCOTT J. BESLIN Department of Mathematics Nicholls State University Thibodaux, LA 70310 (Received December 10, 1990
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationON LARGE ZSIGMONDY PRIMES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 02, Number, January 988 ON LARGE ZSIGMONDY PRIMES WALTER FEIT (Communicated by Donald Passman) Abstract. If a and m are integers greater than, then
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Olivial Beckwith, Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang http://www.williams.edu/mathematics/sjmiller/public html Colby
More informationFrom Fibonacci Numbers to Central Limit Type Theorems
From Fibonacci Numbers to Central Limit Type Theorems Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang Williams College, October 1st, 010 Introduction Previous Results Fibonacci Numbers: F n+1
More informationbe a formal power series with h 0 = 1, v(h^) = \ and v(h n ) > 1 for n > 1. Define a n by
THE POWER OF 2 DIVIDING THE COEFFICIENTS OF CERTAIN POWER SERIES F. T. Howard Wake Forest University, Box 7388 Reynolda Station, Winston-Salem, NC 27109 (Submitted August 1999-Final Revision January 2000)
More informationGOLDEN SEQUENCES OF MATRICES WITH APPLICATIONS TO FIBONACCI ALGEBRA
GOLDEN SEQUENCES OF MATRICES WITH APPLICATIONS TO FIBONACCI ALGEBRA JOSEPH ERCOLANO Baruch College, CUNY, New York, New York 10010 1. INTRODUCTION As is well known, the problem of finding a sequence of
More informationSOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A.
SOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A. 1. Introduction Today we are going to have a look at one of the simplest functions in
More informationCHOLESKY ALGORITHM MATRICES OF FIBONACCI TYPE AND PROPERTIES OF GENERALIZED SEQUENCES*
CHOLESKY ALGORITHM MATRICES OF FIBONACCI TYPE AND PROPERTIES OF GENERALIZED SEQUENCES* Alwyn F. Horadam University of New England, Armidale, Australia Piero FilipponI Fondazione Ugo Bordoni, Rome, Italy
More informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationCOM S 330 Homework 05 Solutions. Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem. Problem 1. [5pts] Consider our definitions of Z, Q, R, and C. Recall that A B means A is a subset
More informationCOMMON FIXED POINT THEOREM OF THREE MAPPINGS IN COMPLETE METRIC SPACE
COMMON FIXED POINT THEOREM OF THREE MAPPINGS IN COMPLETE METRIC SPACE Latpate V.V. and Dolhare U.P. ACS College Gangakhed DSM College Jintur Abstract:-In this paper we prove common fixed point theorem
More informationREVIEW PROBLEMS FOR SECOND 3200 MIDTERM
REVIEW PROBLEMS FOR SECOND 3200 MIDTERM PETE L. CLARK 1)a) State Euclid s Lemma (the one involving prime numbers and divisibility). b) Use Euclid s Lemma to show that 3 1/5 and 5 1/3 are both irrational.
More information= (w 0 + w x t Up^t 9 ' 1 )-. A. "0
5hk MINIMUM PERIODS MODULO n FOR BERNOULLI NUMBERS [Dec. for some nonzero integer U. Finally, u 0 = u p, and u n \u 0 for n = 0, 1,.... VK.00^'. By Lemma 7 and the fact that {u n } is a kth order recurrent
More informationAN INVESTIGATION OF THE CHUNG-FELLER THEOREM AND SIMILAR COMBINATORIAL IDENTITIES
AN INVESTIGATION OF THE CHUNG-FELLER THEOREM AND SIMILAR COMBINATORIAL IDENTITIES ELI A. WOLFHAGEN Abstract. In this paper, we shall prove the Chung-Feller Theorem in multiple ways as well as extend its
More informationA Gentle Introduction to Gradient Boosting. Cheng Li College of Computer and Information Science Northeastern University
A Gentle Introduction to Gradient Boosting Cheng Li chengli@ccs.neu.edu College of Computer and Information Science Northeastern University Gradient Boosting a powerful machine learning algorithm it can
More informationHoKyu Lee Department of Mathematics, Ewha Womans University, Seoul , Korea
HoKyu Lee Department of Mathematics, Ewha Womans University, Seoul 0-0, Korea SeungKyung Park Department of Mathematics, Yonsei University, Seoul 0-, Korea (Submitted May 00-Final Revision April 00). I
More information