FORMULAS FOR P + 3^ + + n p
|
|
- Sharyl Harrison
- 5 years ago
- Views:
Transcription
1 FORMULAS FOR + 2 P + 3^ + + n p G* F C. de Bruyn and J. M. de Villiers Department of Mathematics, University of Stellenbosch, Stellenbosch, South Africa (Submitted December 992). INTRODUCTION Let S (ri) = + 2 P + 3 P n p, withw and/? positive integers. In [3] R. A. Khan, using the binomial theorem and a definite integral, gave a proof of the general recurrence formula for S^ri), S 2 (n), S 3 (ri),... in terms of powers of n. A matrix formula for S (ri), obtained by solving a difference equation by matrix methods, is given in [2]. In this note the recurrence formulas in terms of powers of n and of n + are given in symbolic form, only using the binomial theorem. These formulas are both easily remembered and applied. These recurrence formulas are then used to establish, employing Cramer's rule, explicit expressions for S p (ri) in determinant form. Finally, the usual formulas for S (ri) as polynomials of degree p + \ mn and n + l, with coefficients in terms of the Bernoulli numbers, are derived from these determinants. It is noted that it is possible to do this without prior knowledge of the Bernoulli numbers. 2, A Recurrence Formula 2. FORMULAS IN TERMS OF POWERS OF n Let n GN, with TV the set of positive integers. For k GN, let S k () =, and take S (n) = n. Then n k =S k (n)-s k (n-l) r=l n f k r=iv/=(a ' = S k (n)m k \-\) k - i S i (n) (2.-) /=(A ' 994] 27
2 FORMULAS FOR + 2 P + 3 P + + n p The equation S k -(S-l) k =n k, in which the binomial power is expanded and S (i -,,2,, provides a mnemonic for (2..). For example, for k = 2, formula (2..3) yields and thus giving the well-known result Next, for & = 3, it similarly follows that S 2 -(S 2-2S + l) = n\ 2S (n)-n = n 2, (2..3) k) are then replaced by S^ri),,(/!) = - ( /! +!). (2..4) 3S 2 (n)-3s l (n) + n = n\ so that substitution of (2..4) leads to the formula 2.2 S p (n) as a Determinant,(/!) = - (» + l)(2/, + l). 6 Let / > # and let k = l,2,...,p,p + l in (2..2). Then, solving for S p (n) in the resulting (p +) x (p +) lower triangular linear system by means of Cramer's rule, the determinant representation SM = (p+iy. - c-ir (-i) p (?) (-l)'(f) (-)^) (5) (-l)^(f) (-\y + \r?) :/-,) (S) H» 2» 3 n p n" + (2.2.) p\!!! ni «i (2.2.2) (-) p-\ (-> / > + ( - i ) p ( - ) ' (p+iy. ("> (/>-!)! (p-2)! (p-)! (/?+!)! 272 [JUNE-JULY
3 FORMULAS FOR + 2 ^ +3 P + +U P is obtained. The step from (2.2.) to (2.2.2) follows by first multiplying the / th row of the determinant by /z! for i = l,2,...,p + l, and then multiplying the j i h column of the resulting determinant by (j -)! for j = 2,3,..., /?. 2.3 ^ ( / i ) as a Polynomial By expanding the determinant (2.2.2) with respect to the last column, with a p+l = -Jx and, for r = \,2,...,p, ^(») = I f l^'" r. p I r= (2.3.) 4 p+l-r i-iy P \ (p + l-r)\ (-D r (~l) r " (r+l)!! (-D r (r-)! ("l) r (~l) r (r-2)! c-d r (r-)! X! p\ {p + \-r)\ -is i : (-i) r + 2 (-ir 3 (r+l)!! _L (-D r+ (r-)! c-ir 2 ( - l ) r (r-2)! c-ir (r-)! (2.3.2) Now multiply the 2 n, 4?... columns of the determinant in (2.3.2) by - and then multiply the 2 nd, 4 th,... rows of the resulting determinant by -. Then a p+ip\ (p + l-r)\ Hs i (r+d!! (r-)!! (r-2)! (r-)!! (2.3.3) Next, recall (see, e.g., [4], p. 323) that the Bernoulli numbers Bj, j-,2,..., by the determinants A - o Bj = (-l) J ji! can be represented (2.3.4) i j _ i 994] 273
4 FORMULAS FOR + 2 P +3 P + +n p Hence, by (2.3.3) and (2.3.4), Thus, by (2.3.), Since B 2r+l = a p+l _ r = -(-\y[p; ]B r, r = l,2,...,p. p + l ^(") = -^ri(- ) r K + W + - r - (2-3.5) p + r=q V / (ren), s M - f «+ I -. + I^Bl «.- + I(^4 ^ +... with the last term either containing nor n 2. This is the form in which S p (n) was given by Jacques Bernoulli in []. 3. A Recurrence Formula 3, FORMULAS IN TERMS OF POWERS OF n + Let nen. For ICGN, let S;(w) = + 2*+3* + -»+w* =E / '* and take S 6 (n) = n +. Then, arguing as in the steps leading to (2..) and (2..2), The equation (n + l) k =S k (n + l)-s k (n) = t(f)sm)s k (») (3..) /= k-\ (3..2) wy<* /=o v J (5 + )*-^* =(w + l) fc, (3..3) in which the binomial power is expanded and S (i =,,2,..., k) are then replaced by Sj(n), provides a mnemonic for (3..). Note in particular that (3..3) can be obtained from (2..3) by merely increasing the values of S, S-, and n by one. For example, let k = 2 in (3..3). Then + IS = (n +) 2 and thus n (H) = (w +) 2, again yielding (2..4). 3.2 S p (n) as a Determinant Let pgn and let # = l,2,...,/?,/? + l in (3..2). It follows as in section 2.2, with (-l) r replaced by, that 274 [JUNE-JULY
5 FORMULAS FOR + 2 ^ +3 P +--+n p or, alternatively, S p {n)-- S p (n) = --p\ G> + )!! (o e?)! (?) c")! o..» o U 7 + {n + lf {n + lf (A) ( n + l Y ( i) (H+ir ^ o («+ ) 3 U (3.2.) (3.2.2) P } - (p+iy. (p-iy. I pi (/>-2)! (p-)! (n+l) P! />! (»+l) P + (p+)! Note in particular that the determinants in (3.2.) and (3.2.2) can be obtained from their counterparts in (2.2.) and (2.2.2) by merely replacing n by «+ l in the last column, and replacing all negative entries by their absolute values. 3.3 S p {n) as a Polynomial Proceeding as in section 2.3, (3.2.2) can now be employed to establish the formula with c p+ = -^ and, for r =,2 '"p+l-r Hence, by (2.3.4) and (3.3.2), Thus, by (3.3.), S p (n) = f j c p+l _ r (" + V P+ - r, (3.3.) P, (-!//>! (p + l - r )! (r+)! i_(w! (r-)! (r-2)! J. (r-)! 5 r = l,2, (3.3.2) S p (n) = - } ~ { P r )B r (n + iy +l ~ r. (3.3.3) This standard form of S (ri) is usually established with the aid of the generating function xe* I (e x -) of the Bernoulli polynomials. 994] 275
6 FORMULAS FOR + 2 ^ +3 P + +n p The question arises if this method could have led to formulas (2.3.5) and (3.3.3) with B =, B x = - y, B 2 = \, B 3 =, B 4 = --^-,... without prior knowledge of the Bernoulli numbers. This indeed is the case. First note that, by (2.3.) and (2.3.3), and (3.3.) and (3.3.2), and w^ifrv^with b = and, for r =,2,..., /?, SM = ^tim P r l ) b r np+l - r > P~T~ l r= Ar=(-l) r r (r+)!! v (r-)! (r-2)! _L (r-)! y = i_!!! * ol (r-)! (r-2)! (r+)! (r-)! Now observe that the last determinant differs from that of S r (n), as obtained by setting/? = r in (3.2.2), only with respect to the last column the entries of b r, from top to bottom, are,,..., while those of S r (n) are ^, ^ ^,..., ^ g ~. It follows [cf (3..2)] that Z>,A? * 2,... satisfy the recurrence formula *o = l, XffU=(r = 2,3,4,...), which generates the numbers, - y, ^,, - ^,..., i.e., the Bernoulli numbers. REFERENCES. J.Bernoulli. Arsconjectandi D. Kalman. "Sums of Powers by Matrix Methods." The Fibonacci Quarterly 28. (99): R. A. Khan. "A Simple Derivation of a Formula for Z" k= k r." The Fibonacci Quarterly 9.2 (98): L. A. Lyusternik & A. R. Yanpol'skii, eds. Mathematical Analysis Functions, Limits, Series, Continued Fractions. New York: Pergamon Press, 965. AMS Classification Numbers: 5A, 5A9 276 [JUNE-JULY
1 Introduction. 2 Determining what the J i blocks look like. December 6, 2006
Jordan Canonical Forms December 6, 2006 1 Introduction We know that not every n n matrix A can be diagonalized However, it turns out that we can always put matrices A into something called Jordan Canonical
More informationTHE RAYLEIGH FUNCTION NAND KISHORE
THE RAYLEIGH FUNCTION NAND KISHORE The present paper is a study of a set of symmetric functions of the zeros of Jv(z), the Bessel function of the first kind. Let the zeros of z~'j,(z) be denoted by j,,m,
More informationC O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS
C O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS Nathan D. Cahill, John R. D'Errico, and John P* Spence Eastman Kodak Company, 343 State Street, Rochester, NY 4650 {natfaan. cahill,
More informationMultiplying a Monomial times a Monomial. To multiply a monomial term times a monomial term with radicals you use the following rule A B C D = A C B D
Section 7 4A: Multiplying Radical Expressions Multiplying a Monomial times a Monomial To multiply a monomial term times a monomial term with radicals you use the following rule A B C D = A C B D In other
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 informationGENERALIZED RABBITS FOR GENERALIZED FIBONACCI NUMBERS. V.E.Hoggatt^Jro. San Jose State College, San Jose, Calif e 1. INTRODUCTION
GENERALIZED RABBITS FOR GENERALIZED FIBONACCI NUMBERS V.E.Hoggatt^ro San ose State College, San ose, Calif e 1. INTRODUCTION The original Fibonacci number sequence arose from an academic rabbit production
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 informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
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 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 informationTransformations Preserving the Hankel Transform
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 10 (2007), Article 0773 Transformations Preserving the Hankel Transform Christopher French Department of Mathematics and Statistics Grinnell College Grinnell,
More informationSUMS OF POWERS OF INTEGERS VIA GENERATING FUNCTIONS. F. T. Howard Wake Forest University, Winston-Salem, NC 27109, (Submitted August J 994)
F. T. Howard Wake Forest University, Winston-Salem, NC 27109, (Submitted August J 994) Let ) 1. INTRODUCTION S kn (a,d) = a k + (a+df + (a + 2d? + ---+[a + (n-l)df, (1.1) where k and n are nonnegative
More informationAlgebraic Expressions and Identities
9 Algebraic Epressions and Identities introduction In previous classes, you have studied the fundamental concepts of algebra, algebraic epressions and their addition and subtraction. In this chapter, we
More informationName: Chapter 7: Exponents and Polynomials
Name: Chapter 7: Exponents and Polynomials 7-1: Integer Exponents Objectives: Evaluate expressions containing zero and integer exponents. Simplify expressions containing zero and integer exponents. You
More information{~}) n -'R 1 {n, 3, X)RU, k, A) = {J (" J. j =0
2l WEIGHTED STIRLING NUMBERS OF THE FIRST AND SECOND KIND II [Oct. 6. CONCLUSION We have proven a number-theoretical problem about a sequence, which is a computer-oriented type, but cannot be solved by
More informationPascal Eigenspaces and Invariant Sequences of the First or Second Kind
Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea
More informationCHAPTER 1 POLYNOMIALS
1 CHAPTER 1 POLYNOMIALS 1.1 Removing Nested Symbols of Grouping Simplify. 1. 4x + 3( x ) + 4( x + 1). ( ) 3x + 4 5 x 3 + x 3. 3 5( y 4) + 6 y ( y + 3) 4. 3 n ( n + 5) 4 ( n + 8) 5. ( x + 5) x + 3( x 6)
More informationAND OCCUPANCY PROBLEMS
COMBINATIONS, COMPOSITIONS AND OCCUPANCY PROBLEMS MORTON ABRAMSON York University, Downsview, Toronto, Canada Let r < k be positive integers,, INTRODUCTION By a composition of k into r parts (an r-composition
More informationMCR3U Unit 7 Lesson Notes
7.1 Arithmetic Sequences Sequence: An ordered list of numbers identified by a pattern or rule that may stop at some number or continue indefinitely. Ex. 1, 2, 4, 8,... Ex. 3, 7, 11, 15 Term (of a sequence):
More informationSumming Symbols in Mutual Recurrences
Summing Symbols in Mutual Recurrences Berkeley R Churchill 1 and Edmund A Lamagna 2 1 University of California, Santa Barbara, CA, USA Department of Mathematics 2 University of Rhode Island, Kingston,
More informationNamed numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7
Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named
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 informationMultiplying matrices by diagonal matrices is faster than usual matrix multiplication.
7-6 Multiplying matrices by diagonal matrices is faster than usual matrix multiplication. The following equations generalize to matrices of any size. Multiplying a matrix from the left by a diagonal matrix
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 information1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 8 >< 0, if 0 n < r 1; G n = 1, if n = r
More informationDiscrete Math. Instructor: Mike Picollelli. Day 10
Day 10 Fibonacci Redux. Last time, we saw that F n = 1 5 (( 1 + ) n ( 5 2 1 ) n ) 5. 2 What Makes The Fibonacci Numbers So Special? The Fibonacci numbers are a particular type of recurrence relation, a
More informationAND RELATED NUMBERS. GERHARD ROSENBERGER Dortmund, Federal Republic of Germany (Submitted April 1982)
ON SOME D I V I S I B I L I T Y PROPERTIES OF FIBONACCI AND RELATED NUMBERS Universitat GERHARD ROSENBERGER Dortmund, Federal Republic of Germany (Submitted April 1982) 1. Let x be an arbitrary natural
More informationGeneralized Akiyama-Tanigawa Algorithm for Hypersums of Powers of Integers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 16 (2013, Article 1332 Generalized Aiyama-Tanigawa Algorithm for Hypersums of Powers of Integers José Luis Cereceda Distrito Telefónica, Edificio Este
More informationF A M I L I E S OF IDENTITIES INVOLVING SUMS OF POWERS OF THE FIBONACCI AND LUCAS NUMBERS
F A M I L I E S OF IDENTITIES INVOLVING SUMS OF POWERS OF THE FIBONACCI AND LUCAS NUMBERS R. S. Melham School of Mathematical Sciences, University of Technology, Sydney PO Box 123, Broadway, NSW 2007 Australia
More informationIn memoriam Péter Kiss
Kálmán Liptai Eszterházy Károly Collage, Leányka út 4, 3300 Eger, Hungary e-mail: liptaik@gemini.ektf.hu (Submitted March 2002-Final Revision October 2003) In memoriam Péter Kiss ABSTRACT A positive integer
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 informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationA Probabilistic View of Certain Weighted Fibonacci Sums
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 8-1-2003 A Probabilistic View of Certain Weighted Fibonacci Sums Arthur T. Benjamin Harvey Mudd
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 information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationMath Spring 2011 Final Exam
Math 471 - Spring 211 Final Exam Instructions The following exam consists of three problems, each with multiple parts. There are 15 points available on the exam. The highest possible score is 125. Your
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationUnderstand the vocabulary used to describe polynomials Add polynomials Subtract polynomials Graph equations defined by polynomials of degree 2
Section 5.1: ADDING AND SUBTRACTING POLYNOMIALS When you are done with your homework you should be able to Understand the vocabulary used to describe polynomials Add polynomials Subtract polynomials Graph
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 informationThe Adjoint of a Linear Operator
The Adjoint of a Linear Operator Michael Freeze MAT 531: Linear Algebra UNC Wilmington Spring 2015 1 / 18 Adjoint Operator Let L : V V be a linear operator on an inner product space V. Definition The adjoint
More informationA GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL PARAMETERS
A GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL PARAMETERS HELMUT PRODINGER Abstract A generalize Filbert matrix from [] is further generalize, introucing 3 aitional parameters Explicit formulæ
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 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 informationREDUCTION FORMULAS FOR THE SUMMATION OF RECIPROCALS IN CERTAIN SECOND-ORDER RECURRING SEQUENCES
REDUCTION FORMULAS FOR THE SUMMATION OF RECIPROCALS IN CERTAIN SECOND-ORDER RECURRING SEQUENCES R. S. Melham Department of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway, NSW
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 informationCounting Palindromic Binary Strings Without r-runs of Ones
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8.7 Counting Palindromic Binary Strings Without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University
More informationCONVOLUTION TREES AND PASCAL-T TRIANGLES. JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 1986) 1.
JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 986). INTRODUCTION Pascal (6-66) made extensive use of the famous arithmetical triangle which now bears his name. He wrote
More informationLinear Recurrence Relations for Sums of Products of Two Terms
Linear Recurrence Relations for Sums of Products of Two Terms Yan-Ping Mu College of Science, Tianjin University of Technology Tianjin 300384, P.R. China yanping.mu@gmail.com Submitted: Dec 27, 2010; Accepted:
More informationFaulhaber s Problem Revisited: Alternate Methods for Deriving the Bernoulli Numbers Part I
arxiv:82.83v math.nt] 27 Dec 28 Faulhaber s Problem Revisited: Alternate Methods for Deriving the Bernoulli Numbers Part I Christina Taylor, South Dakota School of Mines & Technology Abstract December
More information-V-2 ^ r-\ a, r-2. ar-l
APPLICATION OF MARKOV CHAINS PROPERTIES TO r-generalized FIBONACCI SEQUENCES Mehdi Mouline and Mustapha Rachidi Departement de Mathematiques et Informatique Faculte des Sciences, Universite Mohammed V,
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
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 informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
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 informationA196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers
Karlsruhe October 14, 2011 November 1, 2011 A196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers Wolfdieter L a n g 1 The sum of the k th power of the first n positive
More informationGENERALIZATIONS OF THE DUAL ZECKENDORF INTEGER REPRESENTATION THEOREMS DISCOVERY BY FIBONACCI TREES AND WORD PATTERNS
GENERALIZATIONS OF THE DUAL ZECKENDORF INTEGER REPRESENTATION THEOREMS DISCOVERY BY FIBONACCI TREES AND WORD PATTERNS J. C. T u r n e r a n d T. D. Robb University of Waikato, Hamilton, New Zealand (Submitted
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationTHE GENERALIZED TRIBONACCI NUMBERS WITH NEGATIVE SUBSCRIPTS
#A3 INTEGERS 14 (014) THE GENERALIZED TRIBONACCI NUMBERS WITH NEGATIVE SUBSCRIPTS Kantaphon Kuhapatanakul 1 Dept. of Mathematics, Faculty of Science, Kasetsart University, Bangkok, Thailand fscikpkk@ku.ac.th
More informationSomething that can have different values at different times. A variable is usually represented by a letter in algebraic expressions.
Lesson Objectives: Students will be able to define, recognize and use the following terms in the context of polynomials: o Constant o Variable o Monomial o Binomial o Trinomial o Polynomial o Numerical
More informationarxiv: v1 [math.nt] 6 Apr 2018
THE GEOMETRY OF SOME FIBONACCI IDENTITIES IN THE HOSOYA TRIANGLE RIGOBERTO FLÓREZ, ROBINSON A. HIGUITA, AND ANTARA MUKHERJEE arxiv:1804.02481v1 [math.nt] 6 Apr 2018 Abstract. In this paper we explore some
More informationWe say that a polynomial is in the standard form if it is written in the order of decreasing exponents of x. Operations on polynomials:
R.4 Polynomials in one variable A monomial: an algebraic expression of the form ax n, where a is a real number, x is a variable and n is a nonnegative integer. : x,, 7 A binomial is the sum (or difference)
More information7-7 Multiplying Polynomials
Example 1: Multiplying Monomials A. (6y 3 )(3y 5 ) (6y 3 )(3y 5 ) (6 3)(y 3 y 5 ) 18y 8 Group factors with like bases together. B. (3mn 2 ) (9m 2 n) Example 1C: Multiplying Monomials Group factors with
More informationPolynomials and Rational Functions (2.1) The shape of the graph of a polynomial function is related to the degree of the polynomial
Polynomials and Rational Functions (2.1) The shape of the graph of a polynomial function is related to the degree of the polynomial Shapes of Polynomials Look at the shape of the odd degree polynomials
More informationEIGENVALUES OF THE ADJACENCY MATRIX OF CUBIC LATTICE GRAPHS
PACIFIC JOURNAL OF MATHEMATICS Vol. 29, No. 3, 1969 EIGENVALUES OF THE ADJACENCY MATRIX OF CUBIC LATTICE GRAPHS RENU LASKAR A cubic lattice graph is defined to be a graph G, whose vertices are the ordered
More informationEQUATIONS WHOSE ROOTS ARE T I E nth POWERS OF T I E ROOTS OF A GIVEN CUBIC EQUATION
EQUATIONS WHOSE ROOTS ARE T I E nth POWERS OF T I E ROOTS OF A GIVEN CUBIC EQUATION N. A, DRAiMand MARJORIE BICKNELL Ventura, Calif, and Wilcox High School, Santa Clara, Calif. Given the cubic equation
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationA LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS
Applicable Analysis and Discrete Mathematics, 1 (27, 371 385. Available electronically at http://pefmath.etf.bg.ac.yu A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS H. W. Gould, Jocelyn
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 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 VEN, PA 17745. This
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 informationSection 5.2 Solving Recurrence Relations
Section 5.2 Solving Recurrence Relations If a g(n) = f (a g(0),a g(1),..., a g(n 1) ) find a closed form or an expression for a g(n). Recall: nth degree polynomials have n roots: a n x n + a n 1 x n 1
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationNew Multiple Harmonic Sum Identities
New Multiple Harmonic Sum Identities Helmut Prodinger Department of Mathematics University of Stellenbosch 760 Stellenbosch, South Africa hproding@sun.ac.za Roberto Tauraso Dipartimento di Matematica Università
More informationIntroduction to Determinants
Introduction to Determinants For any square matrix of order 2, we have found a necessary and sufficient condition for invertibility. Indeed, consider the matrix The matrix A is invertible if and only if.
More informationInteger Multiplication
Integer Multiplication in almost linear time Martin Fürer CSE 588 Department of Computer Science and Engineering Pennsylvania State University 1/24/08 Karatsuba algebraic Split each of the two factors
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 informationChapter 6: Polynomials
Chapter : Polynomials Chapter : Polynomials POLYNOMIALS Definition: A polynomial is an algebraic epression that is a sum of terms, where each term contains only variables with whole number eponents and
More informationMath 113 Homework 5. Bowei Liu, Chao Li. Fall 2013
Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name
More informationZ J7 TT I?2 17 n r n+l''' r n+4m+l (1 A \
SUMS O F CERTAIN PRODUCTS O F F I B O N A C C I AND LUCAS N U M B E R S - P A R T II R. S* Melham School of Mathematical Sciences, University of Technology, Sydney PO Box 123, Broadway, NSW 2007 Australia
More information5.2 Polynomial Operations
5.2 Polynomial Operations At times we ll need to perform operations with polynomials. At this level we ll just be adding, subtracting, or multiplying polynomials. Dividing polynomials will happen in future
More informationLinear transformations preserving the strong q-log-convexity of polynomials
Linear transformations preserving the strong q-log-convexity of polynomials Bao-Xuan Zhu School of Mathematics and Statistics Jiangsu Normal University Xuzhou, PR China bxzhu@jsnueducn Hua Sun College
More informationQuestionnaire for CSET Mathematics subset 1
Questionnaire for CSET Mathematics subset 1 Below is a preliminary questionnaire aimed at finding out your current readiness for the CSET Math subset 1 exam. This will serve as a baseline indicator for
More informationLesson 3 Algebraic expression: - the result obtained by applying operations (+, -,, ) to a collection of numbers and/or variables o
Lesson 3 Algebraic expression: - the result obtained by applying operations (+, -,, ) to a collection of numbers and/or variables o o ( 1)(9) 3 ( 1) 3 9 1 Evaluate the second expression at the left, if
More information{ 0! = 1 n! = n(n 1)!, n 1. n! =
Summations Question? What is the sum of the first 100 positive integers? Counting Question? In how many ways may the first three horses in a 10 horse race finish? Multiplication Principle: If an event
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 informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 1
MATH 56A: STOCHASTIC PROCESSES CHAPTER. Finite Markov chains For the sake of completeness of these notes I decided to write a summary of the basic concepts of finite Markov chains. The topics in this chapter
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors MAT 67L, Laboratory III Contents Instructions (1) Read this document. (2) The questions labeled Experiments are not graded, and should not be turned in. They are designed for
More informationSection 1.1: Systems of Linear Equations
Section 1.1: Systems of Linear Equations Two Linear Equations in Two Unknowns Recall that the equation of a line in 2D can be written in standard form: a 1 x 1 + a 2 x 2 = b. Definition. A 2 2 system of
More informationPartitions, permutations and posets Péter Csikvári
Partitions, permutations and posets Péter Csivári In this note I only collect those things which are not discussed in R Stanley s Algebraic Combinatorics boo Partitions For the definition of (number) partition,
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 VEN, PA 17745. This
More informationVector Spaces ปร ภ ม เวกเตอร
Vector Spaces ปร ภ ม เวกเตอร 5.1 Real Vector Spaces ปร ภ ม เวกเตอร ของจ านวนจร ง Vector Space Axioms (1/2) Let V be an arbitrary nonempty set of objects on which two operations are defined, addition and
More informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More informationENGG5781 Matrix Analysis and Computations Lecture 8: QR Decomposition
ENGG5781 Matrix Analysis and Computations Lecture 8: QR Decomposition Wing-Kin (Ken) Ma 2017 2018 Term 2 Department of Electronic Engineering The Chinese University of Hong Kong Lecture 8: QR Decomposition
More informationMODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function
MODEL ANSWERS TO THE FIRST QUIZ 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function A: I J F, where I is the set of integers between 1 and m and J is
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 MATRIX GENERALIZATION OF A THEOREM OF FINE
A MATRIX GENERALIZATION OF A THEOREM OF FINE ERIC ROWLAND To Jeff Shallit on his 60th birthday! Abstract. In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients ( n, for m
More informationOn Tornheim s double series
ACTA ARITHMETICA LXXV.2 (1996 On Tornheim s double series by James G. Huard (Buffalo, N.Y., Kenneth S. Williams (Ottawa, Ont. and Zhang Nan-Yue (Beijing 1. Introduction. We call the double infinite series
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 informationAlgebra 2 Matrices. Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Find.
Algebra 2 Matrices Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Find. Evaluate the determinant of the matrix. 2. 3. A matrix contains 48 elements.
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 information