Sums of Powers of Integers. Julien Doucet. and A. Saleh-Jahromi
|
|
- Denis Ford
- 5 years ago
- Views:
Transcription
1 Sums of Powers of Integers by Julien Doucet Louisiana State University in Shreveport Department of Mathematics and Computer Science One University Place Shreveport, LA telephone: (38) and A. Saleh-Jahromi Loyola Marymount University Physics Department One LMU Drive Los Angeles, CA telephone: (30)
2 Abstract The Edwards-Owens-Bloom Algorithm provides a simple technique which generates formulae for the sum of powers of integers. These formulae up to degree 7 were published in the early 7th Century without leaving any records of how they were derived. We present a proof of the Algorithm using simple techniques which where known during that era.
3 Sums of Powers of Integers Julien Doucet and A. Saleh-Jahromi. Introduction. Sometime ago, we became interested in the sums of powers of integers. One usually sees these formulae in developing the concept of Riemann Sums for the definite integral while teaching Calculus. The following are some of these sums: n, () j n(n+) 2 2 n2 + 2n, (2) j 2 n(n+)(2n+) 6 3 n3 + 2 n2 + 6n, (3) j 3 n2 (n+) n4 + 2 n3 + 4 n2, (4) j 4 n(n+)(2n+)(3n2 +3n ) 30 5 n5 + 2 n4 + 3 n3 30n, (5). j p n + 2 np + (lower powers of n). (6) These are found in most Calculus books to compute areas. They are usually used to b develop the integral formula x n dx bn+ a n+ for integers n 0,, 2, 3, 4,...,p. a n + These sums are used in analyzing the number of operations needed to solve linear equations by Gaussian elimination. ( See 0. ) We became interested in finding a method to derive a formula for the finite sums of powers of integers, j p (where p is a non-negative integer), as a polynomial in terms of n. Itturns out that we can find a polynomial of degree that will do the job., i.e., for integers n 0,p 0, j p P p (n) a p j nj (7) or p +2 p +3 p n p P p (n) a p n + a p pn p + a p p np a p 2 n2 + a p n + ap 0 for some polynomial of n, P p (n), of degree p + with (rational) coefficients a p,ap p,a p p,
4 ...,a p 2,ap,ap 0. Methods using finite differences can be used to develop these formulae in general. We will derive formulae for j p (for integers p 0) expressed as a polynomial of degree p + using the simplest technique. And we will show how to apply a simple algorithm to generate the coefficients of the polynomials. One could generate these formulae and then use finite mathematical induction to prove them, case by case. Usually, one verifies the formulae () (6), using finite mathematical induction in a Calculus course. In general, this could be done for the formula (7) after the coefficients are determined. But the question that remains is how to determine the values of the coefficients. Johann Faulhaber published formulae for (7) up to p 7 in 63 without leaving any record of how he developed these formulae. See 6 p. 9. We give the formulae up to p 5below. n j 2 n2 + 2 n j 2 3 n3 + 2 n2 + 6 n j 3 4 n4 + 2 n3 + 4 n2 j 4 5 n5 + 2 n4 + 3 n3 30 n j 5 6 n6 + 2 n n4 2 n2 Methods using finite differences, factorial polynomials, and summations could generate these formulae. A good presentation of this is in 8 p Fortunately, there is a simple algorithm which will generate these formulae. See 2, p Robert W. Owens in 7 and David Bloom in 2 revealed this algorithm that is very briefly given in 4. We shall refer to that algorithm as the Edwards-Owens-Bloom Algorithm in this paper. As far as we have been able to determine from present day literature on the subject, it is derived using differentiation, Bernoulli numbers, and other methods and techniques which were not known in the early 7th Century. In this article, we shall try to derive the algorithm using simpler methods and techniques which were well understood during Faulhaber s time. 2
5 The standard formula for P p (n) isp p (n) a p j nj, where a p j Cp j B j j j for all p 0, where B k are the Bernoulli numbers. In 7, Owens gives a proof for the algorithm using the Binomial Theorem, mathematical induction, differentiation, and the fact that two polynomials agreeing at infinitely many points must be identical. In 2, Bloom gives a simple proof for this algorithm using Bernoulli numbers. Inductive arguments was used for arithmetic sequences and sums of integral cubes and by Abū Bakr al-karajī (c. 000) and continued others ( 5 p. 255 ). Levi ben Gerson ( ) used the essentials of the method of induction involving combinatorics and sums involving integers and powers ( 5 p ). It appears that induction was well developed by 653. It seems that Faulhaber would have been familiar with the process when he published his formulae. The Binomial Theorem was known in Europe as far back as 527 ( 3 p. 42 ). According to Smith, the triangular array called Pascal s Triangle first appeared in print in 527 in a publication by Apianus. See 9 p Edwards-Owens-Bloom Algorithm. We shall now present some theorems and their proofs and develop the Edwards-Owens-Bloom Algorithm. Lemma. Forany constant k and any integer n 0, k kn. Inparticular, n. The proof of the following theorem was suggested to us. It is Pascal s 654 proof. ( See p ) It is better and more illuminating than the proof that we had given originally. Students may find it a good exercise to prove it formally by finite induction. Theorem. (i) For any polynomial Q of degree q, there exists a polynomial R such that Q(j) R(n) for n 0 and deg(r) q +. (ii) In particular, for p, n 0, there exists a polynomial P p such that j p P p (n) and deg ( ) P p p +. 3
6 We shall use the following convention in the material below. Let p, n be integers such that p, n 0. From Theorem, we have j p P p (n) for some polynomial P p of degree p +. So, P p (x) a p x + a p px p + a p p xp a p 2 x2 + a p x + ap 0 for some constants a p,ap p,a p p,...,ap 2,ap,ap 0 and ap 0. The coefficients of P p(x), a p j (0 j p + ), must be unique, since j p P p (n) holds for at least 0 n p +2. The results of Theorem 2 below is not new but we shall prove it in a new manner which will require simple algebraic manipulations and finite induction only. We present several lemmata prior to the theorem. Lemma 2. Forany integers n, p 0: Proof: We have n+ j p (a p j + Cp j )nj + a p n. (8) j p P p (n) a p j nj for 0 n, p. (9) Then, it follows from (9) that n+ j p j p +(n +) p P p (n)+(+n) p a p j nj + a p j nj + a p n + C p j nj (a p j + Cp j )nj + a p n. Lemma 3. Forany integers n, p 0: C p j p j n j (a p j nj + C p j nj )+a p n n+ j p a p k Ck j nj + a p n. (0) kj Proof: Now, it also follows from (9) in Lemma 2 that ( n+ j p P p (n +) a p j (n +)j a p j ( + n)j k0 j a p j Cj k nk a p j Cj k nk a p k Ck j nj + a p C kj a p k Ck j nj k0 jk kj n kj a p j k0 ) j C j k j k n k a p k Ck j nj + a p n. Lemma 4. Forintegers j, p such that j p +: a p j j C p j 4 kj+ C k j ap k. ()
7 Proof: Combining Lemmata 2 and 3, i.e., (8) and (0), we get: (a p j + Cp j )nj + a p n a p k Ck j nj + a p n for 0 n, p. kj kj By equating coefficients of like terms of n j,weget for 0 j p: a p j + Cp j a p k Ck j ap j +ap j+ (j +)+ a p k Ck j ap j +(j +)ap j+ + a p k Ck j. kj+2 kj+2 Then, C p j (j +)ap j+ + a p k Ck j and (j +)ap j+ Cp j j +,weget a p j+ j+ C p j j +with j, weget (). kj+2 a p k Ck j kj+2 a p k Ck j kj+2. Dividing by for 0 j p or j + p +. Replacing Lemma 5. Forintegers k and p such that 0 k p: a p+2 k p+2 k ap k. (2) Proof: We will prove Lemma 5, i.e., (2) by strong induction on k. Let 0 p. Then p +.From Lemma 4, i.e., (), we have: a p Cp p Cp k a p k 0. Therefore, kp+2 a p+2 p+2 p+2 p+2 ap. Hence, (2) holds for 0 k p. Suppose (2) holds for all k such that 0 k K. It suffices to show that (2) then holds for k K +. Let K + p. Then 0 k K<K+ p. Hence, 0 K + p. (3) Also, we now have 2K ++ K p + K p + p +2,i.e., p + K p +2. (4) Since K + p, then p K. Since 0 K, then p K p p +. Combining these, we have p K p +. (5) And, it follows that p+2 a p+2 (K+) a K K C p K Cp K l a l by () and (4) lp+2 K K ()! K (K+)! (p K)! C p+2 l p K a p+2 l l0 K ()! K (K+)! (p K)! (p+2 l)! (K l+2)! (p K)! a p+2 l l0 5
8 K K K K ()! (K+)! (p K)! (p+2 l)! (K l+2)! (p K)! l0 ()! (K+)! (p K)! (+l)! (K+l )! (p K)! lp K+ () (p K) () ( K) (p K) p! (K+)! (p K )! () (p K) C p p K lp K+ () (p+2 l) ap l () (+l) ap l {since (2) holds for 0 l K l! (K+l )! (p K )! ap l lp K+ C l p K ap l () ( K) ap p K by () and (5) p+2 (K+) ap (K+) Hence, (2) is true for k K +. Theorem 2. If 0 p and j p +,then a j+ j+ ap j. Proof: Letting j p + k in Lemma 5, i.e., (2), we get: a j+ a p+2 k p+2 k ap k j+ ap j for 0 K + p by (3). for 0 k p. But, 0 k p p k 0 p + p + k + p + 0+p + p + k p + j p +. Hence, a j+ j+ ap j for j p +. The following theorems and corollary do not yield new results. Their proofs are short and require little effort with the above results. Theorem 3. For any p 0, a p 0 0. Proof: We have j p P p (n) a p j nj for 0 n, p. Setting n 0,weget a p 0 0. Theorem 4. For any p 0, a p j. Proof: By Theorem 3, j p a p j nj for 0 n, p. Setting n,weget a p j. Corollary. For any p 0, a p a p j. j2 6
9 Using Theorem 4, we get P p (n) a p j nj 0 p. Hence, a p j nj +a p 0 a p j nj +0 a p j nj for j p P p (n) a p j nj a p x +a p px p +a p p xp +...+a p 3 x3 +a p 2 x2 +a p x for 0 n, p. Using Theorem 2 and Corollary, we can develop the Edwards-Owens-Bloom Algorithm. The Edwards-Owens-Bloom Algorithm generates the coefficients of P (n) from the coefficients of P p (n) for p 0. The algorithm is as follows: The Edwards-Owens-Bloom Algorithm () Given: P p (n) a p j nj with known coefficients a p j ( j p + ). (2) Multiply each a p j by j+ to produce a j+ ( j p + ). This will generate the coefficients of P (n): a j for 2 j p +2. All of the coefficients of P (n) will have been determined, except for a. (3) To produce the last (missing) coefficient of P (n), a : (a) add all of the coefficients of P (n) generated in Step (2); (b) subtract the sum in (a) from ; and (c) a is the resultant difference produced in (b). The above algorithm is illustrated in the diagram below. a p x + a p px p + a p p x p a p j x j a p 3x 3 + a p 2x 2 + a p x p+2 p j a p+2x p+2 + a x + a p x p a j+x j a 4 x 4 + a 3 x 3 + a 2 x 2 + a x {}}{ p+2 a j j2 3. Epilogue. In 7, Owens used the binomial theorem, mathematical induction, and differentiation to derive the Edwards-Owens-Bloom Algorithm. In 2, Bloom used Bernoulli numbers to justify the algorithm. In our opinion, Faulhaber could not have 7
10 derived the algorithm as did Owens in 7 and as did Bloom in 2. In this article, the formulae for (7) could be derived by using finite differences. This method can be continued to derive the formula in (7) for any arbitrarily fixed integer p 0. The Edwards-Owens- Bloom Algorithm was derived in this article using simple methods, i.e., using algebraic manipulations which were well understood in the 7th Century. Perhaps, he used method of finite differences or, as we think more likely, he developed the Edwards-Owens-Bloom Algorithm which could have been derived using the algebraic manipulations in Lemma, Theorem, Lemmata 2 5, Theorems 2 4, and Corollary. Acknowledgments. We wish to thank George Boros, Carlos G. Spaht II, Dan Kalman, and Carl Libis for their encouragement to further investigate this topic and to write an article on it. George Boros was particularly helpful to us with some of the reference materials. Carl Libis pointed out some minor errors in this article and expressed some of his opinions about the material and history involved. We are grateful to him for his help and suggestions. Also, we wish to express our appreciation for suggestions for some improvements from an anonymous person. References Alan F. Beardon, Sums of powers of integers, The American Mathematical Monthly 03 (996), David M. Bloom, An old algorithm for the sums of integer powers, Mathematics Magazine 66 (993), Carl B. Boyer, A history of mathematics, John Wiley & Sons, Inc., New York, New York, Harold M. Edwards, Fermat s last theorem: a genetic introduction to algebraic number theory, Springer-Verlag, Inc., New York, New York, Howard Whitley Eves, An introduction to the history of mathematics, 5th ed., Saun- 8
11 ders College Publishing, Philadelphia, Pennsylvania, H. K. Krishnapriyan, Eulerian polynomials and Faulhaber s result on sums of powers of integers, The College Mathematics Journal 26 (995), Robert W. Owens, Sums of powers of integers, Mathematics Magazine 65 (992), Francis Scheid, Schaum s outline of theory and problems of numerical analysis, 2nd ed., Mc-Graw-Hill, Inc., New York, New York, David Eugene Smith, History of mathematics, Vol. II, Dover Publications, Inc., New York, New York, Sidney Yakowitz and Ferenc Szidarovszky, An introduction to numerical computations, 2nd ed., MacMillan Publishing Company, Inc., 989, 67. 9
Polynomial Formula for Sums of Powers of Integers
Polynomial Formula for Sums of Powers of Integers K B Athreya and S Kothari left K B Athreya is a retired Professor of mathematics and statistics at Iowa State University, Ames, Iowa. right S Kothari is
More informationMath Bootcamp 2012 Miscellaneous
Math Bootcamp 202 Miscellaneous Factorial, combination and permutation The factorial of a positive integer n denoted by n!, is the product of all positive integers less than or equal to n. Define 0! =.
More informationSUMS OF POWERS AND BERNOULLI NUMBERS
SUMS OF POWERS AND BERNOULLI NUMBERS TOM RIKE OAKLAND HIGH SCHOOL Fermat and Pascal On September 22, 636 Fermat claimed in a letter that he could find the area under any higher parabola and Roberval wrote
More informationBernoulli Numbers and their Applications
Bernoulli Numbers and their Applications James B Silva Abstract The Bernoulli numbers are a set of numbers that were discovered by Jacob Bernoulli (654-75). This set of numbers holds a deep relationship
More informationCollege Algebra. Basics to Theory of Equations. Chapter Goals and Assessment. John J. Schiller and Marie A. Wurster. Slide 1
College Algebra Basics to Theory of Equations Chapter Goals and Assessment John J. Schiller and Marie A. Wurster Slide 1 Chapter R Review of Basic Algebra The goal of this chapter is to make the transition
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More informationHence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n
Appendix A: The Principle of Mathematical Induction We now present an important deductive method widely used in mathematics: the principle of mathematical induction. First, we provide some historical context
More informationA video College Algebra course & 6 Enrichment videos
A video College Algebra course & 6 Enrichment videos Recorded at the University of Missouri Kansas City in 1998. All times are approximate. About 43 hours total. Available on YouTube at http://www.youtube.com/user/umkc
More informationSome thoughts concerning power sums
Some thoughts concerning power sums Dedicated to the memory of Zoltán Szvetits (929 20 Gábor Nyul Institute of Mathematics, University of Debrecen H 00 Debrecen POBox 2, Hungary e mail: gnyul@scienceunidebhu
More informationq-series Michael Gri for the partition function, he developed the basic idea of the q-exponential. From
q-series Michael Gri th History and q-integers The idea of q-series has existed since at least Euler. In constructing the generating function for the partition function, he developed the basic idea of
More informationSequences and Series, Induction. Review
Sequences and Series, Induction Review 1 Topics Arithmetic Sequences Arithmetic Series Geometric Sequences Geometric Series Factorial Notation Sigma Notation Binomial Theorem Mathematical Induction 2 Arithmetic
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 informationPierre de Fermat ( )
Section 04 Mathematical Induction 987 8 Find the sum of the first ten terms of the sequence: 9 Find the sum of the first 50 terms of the sequence: 0 Find the sum of the first ten terms of the sequence:
More informationGiven a sequence a 1, a 2,...of numbers, the finite sum a 1 + a 2 + +a n,wheren is an nonnegative integer, can be written
A Summations When an algorithm contains an iterative control construct such as a while or for loop, its running time can be expressed as the sum of the times spent on each execution of the body of the
More informationThe Sum n. Introduction. Proof I: By Induction. Caleb McWhorter
The Sum 1 + + + n Caleb McWhorter Introduction Mathematicians study patterns, logic, and the relationships between objects. Though this definition is so vague it could be describing any field not just
More informationReceived: 2/7/07, Revised: 5/25/07, Accepted: 6/25/07, Published: 7/20/07 Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 2007, #A34 AN INVERSE OF THE FAÀ DI BRUNO FORMULA Gottlieb Pirsic 1 Johann Radon Institute of Computational and Applied Mathematics RICAM,
More informationAS1051: Mathematics. 0. Introduction
AS1051: Mathematics 0 Introduction The aim of this course is to review the basic mathematics which you have already learnt during A-level, and then develop it further You should find it almost entirely
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 information5.1 Modelling Polynomials
5.1 Modelling Polynomials FOCUS Model, write, and classify polynomials. In arithmetic, we use Base Ten Blocks to model whole numbers. How would you model the number 234? In algebra, we use algebra tiles
More informationCHINO VALLEY UNIFIED SCHOOL DISTRICT INSTRUCTIONAL GUIDE ALGEBRA II
CHINO VALLEY UNIFIED SCHOOL DISTRICT INSTRUCTIONAL GUIDE ALGEBRA II Course Number 5116 Department Mathematics Qualification Guidelines Successful completion of both semesters of Algebra 1 or Algebra 1
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 informationAlgorithmic Approach to Counting of Certain Types m-ary Partitions
Algorithmic Approach to Counting of Certain Types m-ary Partitions Valentin P. Bakoev Abstract Partitions of integers of the type m n as a sum of powers of m (the so called m-ary partitions) and their
More informationPRECALCULUS BISHOP KELLY HIGH SCHOOL BOISE, IDAHO. Prepared by Kristina L. Gazdik. March 2005
PRECALCULUS BISHOP KELLY HIGH SCHOOL BOISE, IDAHO Prepared by Kristina L. Gazdik March 2005 1 TABLE OF CONTENTS Course Description.3 Scope and Sequence 4 Content Outlines UNIT I: FUNCTIONS AND THEIR GRAPHS
More informationPower series and Taylor series
Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series
More informationTrinity Christian School Curriculum Guide
Course Title: Calculus Grade Taught: Twelfth Grade Credits: 1 credit Trinity Christian School Curriculum Guide A. Course Goals: 1. To provide students with a familiarity with the properties of linear,
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationGambler s Ruin with Catastrophes and Windfalls
Journal of Grace Scientific Publishing Statistical Theory and Practice Volume 2, No2, June 2008 Gambler s Ruin with Catastrophes and Windfalls B unter, Department of Mathematics, University of California,
More informationArithmetic properties of lacunary sums of binomial coefficients
Arithmetic properties of lacunary sums of binomial coefficients Tamás Mathematics Department Occidental College 29th Journées Arithmétiques JA2015, July 6-10, 2015 Arithmetic properties of lacunary sums
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationDeterminants of Block Matrices and Schur s Formula by Istvan Kovacs, Daniel S. Silver*, and Susan G. Williams*
Determinants of Block Matrices and Schur s Formula by Istvan Kovacs, Daniel S. Silver*, and Susan G. Williams* For what is the theory of determinants? It is an algebra upon algebra; a calculus which enables
More informationConjectures and proof. Book page 24-30
Conjectures and proof Book page 24-30 What is a conjecture? A conjecture is used to describe a pattern in mathematical terms When a conjecture has been proved, it becomes a theorem There are many types
More informationExplicit formulas using partitions of integers for numbers defined by recursion
Explicit formulas using partitions of integers for numbers defined by recursion Giuseppe Fera, Vittorino Talamini, arxiv:2.440v2 [math.nt] 27 Feb 203 DCFA, Sezione di Fisica e Matematica, Università di
More informationFUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME. Introduction
FUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME DAVID LONDON and ZVI ZIEGLER (Received 7 March 966) Introduction Let F p be the residue field modulo a prime number p. The mappings of F p into itself are
More informationSection 4.1: Sequences and Series
Section 4.1: Sequences and Series In this section, we shall introduce the idea of sequences and series as a necessary tool to develop the proof technique called mathematical induction. Most of the material
More informationchapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS
chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationLesson 2: Introduction to Variables
Lesson 2: Introduction to Variables Topics and Objectives: Evaluating Algebraic Expressions Some Vocabulary o Variable o Term o Coefficient o Constant o Factor Like Terms o Identifying Like Terms o Combining
More informationn f(k) k=1 means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other words: n f(k) = f(1) + f(2) f(n). 1 = 2n 2.
Handout on induction and written assignment 1. MA113 Calculus I Spring 2007 Why study mathematical induction? For many students, mathematical induction is an unfamiliar topic. Nonetheless, this is an important
More information5. Sequences & Recursion
5. Sequences & Recursion Terence Sim 1 / 42 A mathematician, like a painter or poet, is a maker of patterns. Reading Sections 5.1 5.4, 5.6 5.8 of Epp. Section 2.10 of Campbell. Godfrey Harold Hardy, 1877
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
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 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 informationDeterminants of Partition Matrices
journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised
More informationInfinite Continued Fractions
Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with
More informationCHAPTER 1: Functions
CHAPTER 1: Functions 1.1: Functions 1.2: Graphs of Functions 1.3: Basic Graphs and Symmetry 1.4: Transformations 1.5: Piecewise-Defined Functions; Limits and Continuity in Calculus 1.6: Combining Functions
More informationThe KMO Method for Solving Non-homogenous, mth Order Differential Equations
Rose-Hulman Undergraduate Mathematics Journal Volume 15 Issue 1 Article 8 The KMO Method for Solving Non-homogenous, mth Order Differential Equations David Krohn University of Notre Dame Daniel Mariño-Johnson
More informationQuadratics and Other Polynomials
Algebra 2, Quarter 2, Unit 2.1 Quadratics and Other Polynomials Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned Know and apply the Fundamental Theorem of Algebra
More informationCourse Outcome Summary
Course Information: Algebra 2 Description: Instruction Level: 10-12 Total Credits: 2.0 Prerequisites: Textbooks: Course Topics for this course include a review of Algebra 1 topics, solving equations, solving
More informationOn Certain Sums of Stirling Numbers with Binomial Coefficients
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015, Article 15.9.6 On Certain Sums of Stirling Numbers with Binomial Coefficients H. W. Gould Department of Mathematics West Virginia University
More informationELECTRICAL NETWORK THEORY AND RECURRENCE IN DISCRETE RANDOM WALKS
ELECTRICAL NETWORK THEORY AND RECURRENCE IN DISCRETE RANDOM WALKS DANIEL STRAUS Abstract This paper investigates recurrence in one dimensional random walks After proving recurrence, an alternate approach
More informationCathedral Catholic High School Course Catalog
Cathedral Catholic High School Course Catalog Course Title: Pre-Calculus Course Description: This course is designed to prepare students to begin their college studies in introductory Calculus. Students
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 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 informationTEACHER NOTES FOR YEAR 12 SPECIALIST MATHEMATICS
TEACHER NOTES FOR YEAR 12 SPECIALIST MATHEMATICS 21 November 2016 CHAPTER 1: MATHEMATICAL INDUCTION A The process of induction Topic 1 B The principle of mathematical Sub-topic 1.1 induction Induction
More informationMany proofs that the primes are infinite J. Marshall Ash 1 and T. Kyle Petersen
Many proofs that the primes are infinite J. Marshall Ash and T. Kyle Petersen Theorem. There are infinitely many prime numbers. How many proofs do you know that there are infinitely many primes? Nearly
More informationON UNIVERSAL SUMS OF POLYGONAL NUMBERS
Sci. China Math. 58(2015), no. 7, 1367 1396. ON UNIVERSAL SUMS OF POLYGONAL NUMBERS Zhi-Wei SUN Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn
More informationNotes on Special Functions
Spring 25 1 Notes on Special Functions Francis J. Narcowich Department of Mathematics Texas A&M University College Station, TX 77843-3368 Introduction These notes are for our classes on special functions.
More informationAlgebra , Martin-Gay
A Correlation of Algebra 1 2016, to the Common Core State Standards for Mathematics - Algebra I Introduction This document demonstrates how Pearson s High School Series by Elayn, 2016, meets the standards
More informationPrentice Hall: Algebra 2 with Trigonometry 2006 Correlated to: California Mathematics Content Standards for Algebra II (Grades 9-12)
California Mathematics Content Standards for Algebra II (Grades 9-12) This discipline complements and expands the mathematical content and concepts of algebra I and geometry. Students who master algebra
More informationCounting Matrices Over a Finite Field With All Eigenvalues in the Field
Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu
More informationSection 4.2: Mathematical Induction 1
Section 4.: Mathematical Induction 1 Over the next couple of sections, we shall consider a method of proof called mathematical induction. Induction is fairly complicated, but a very useful proof technique,
More informationIntroduction to Series and Sequences Math 121 Calculus II Spring 2015
Introduction to Series and Sequences Math Calculus II Spring 05 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial of infinite
More informationDIVISIBILITY OF BINOMIAL COEFFICIENTS AT p = 2
DIVISIBILITY OF BINOMIAL COEFFICIENTS AT p = 2 BAILEY SWINFORD Abstract. This paper will look at the binomial coefficients divisible by the prime number 2. The paper will seek to understand and explain
More informationSERIES
SERIES.... This chapter revisits sequences arithmetic then geometric to see how these ideas can be extended, and how they occur in other contexts. A sequence is a list of ordered numbers, whereas a series
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationNotes on generating functions in automata theory
Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series
More informationCryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press
AN INTRODUCTION TO Number Theory with Cryptography James S Kraft Gilman School Baltimore, Maryland, USA Lawrence C Washington University of Maryland College Park, Maryland, USA CRC Press Taylor & Francis
More informationLinear Algebra Fall mathx.kaist.ac.kr/~schoi/teaching.html.
Linear Algebra Fall 2013 mathx.kaist.ac.kr/~schoi/teaching.html. Course HPs klms.kaist.ac.kr: some announcements, can ask questions here, also link to my page. Also, grades for quizzes and exames. math.kaist.ac.kr/~schoi:
More informationSMSU Mathematics Course Content
Southwest Minnesota State University Department of Mathematics SMSU Mathematics Course Content 2012-2013 Thefollowing is a list of possibletopics and techniques to cover in your SMSU College Now course.
More informationCorrelation to the Common Core State Standards
Correlation to the Common Core State Standards Go Math! 2011 Grade 6 Common Core is a trademark of the National Governors Association Center for Best Practices and the Council of Chief State School Officers.
More informationTeaching with a Smile
Teaching with a Smile Igor Minevich Boston College AMS - MAA Joint Mathematics Meetings January 11, 2015 Outline 1 Introduction 2 Puzzles and Other Fun Stuff 3 Projects Yin-Yang of Mathematics Yang Logic
More informationAlgebra 2 Secondary Mathematics Instructional Guide
Algebra 2 Secondary Mathematics Instructional Guide 2009-2010 ALGEBRA 2AB (Grade 9, 10 or 11) Prerequisite: Algebra 1AB or Geometry AB 310303 Algebra 2A 310304 Algebra 2B COURSE DESCRIPTION Los Angeles
More informationExamples of Finite Sequences (finite terms) Examples of Infinite Sequences (infinite terms)
Math 120 Intermediate Algebra Sec 10.1: Sequences Defn A sequence is a function whose domain is the set of positive integers. The formula for the nth term of a sequence is called the general term. Examples
More informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
More informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More informationPrecalculus Graphical, Numerical, Algebraic Media Update 7th Edition 2010, (Demana, et al)
A Correlation of Precalculus Graphical, Numerical, Algebraic Media Update To the Virginia Standards of Learning for Mathematical Analysis February 2009 INTRODUCTION This document demonstrates how, meets
More information= 5 2 and = 13 2 and = (1) = 10 2 and = 15 2 and = 25 2
BEGINNING ALGEBRAIC NUMBER THEORY Fermat s Last Theorem is one of the most famous problems in mathematics. Its origin can be traced back to the work of the Greek mathematician Diophantus (third century
More informationAlgebra and Trigonometry 2006 (Foerster) Correlated to: Washington Mathematics Standards, Algebra 2 (2008)
A2.1. Core Content: Solving problems The first core content area highlights the type of problems students will be able to solve by the end of, as they extend their ability to solve problems with additional
More informationGeneralized Geometric Series, The Ratio Comparison Test and Raabe s Test
Generalized Geometric Series The Ratio Comparison Test and Raae s Test William M. Faucette Decemer 2003 The goal of this paper is to examine the convergence of a type of infinite series in which the summands
More informationCompositions of n with no occurrence of k. Phyllis Chinn, Humboldt State University Silvia Heubach, California State University Los Angeles
Compositions of n with no occurrence of k Phyllis Chinn, Humboldt State University Silvia Heubach, California State University Los Angeles Abstract A composition of n is an ordered collection of one or
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More informationSpiral Review Probability, Enter Your Grade Online Quiz - Probability Pascal's Triangle, Enter Your Grade
Course Description This course includes an in-depth analysis of algebraic problem solving preparing for College Level Algebra. Topics include: Equations and Inequalities, Linear Relations and Functions,
More information1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation
1. Foundations of Numerics from Advanced Mathematics Mathematical Essentials and Notation Mathematical Essentials and Notation, October 22, 2012 1 The main purpose of this first chapter (about 4 lectures)
More information1.1.1 Algebraic Operations
1.1.1 Algebraic Operations We need to learn how our basic algebraic operations interact. When confronted with many operations, we follow the order of operations: Parentheses Exponentials Multiplication
More informationVarious Proofs of Sylvester s (Determinant) Identity
Various Proofs of Sylvester s Determinant Identity IMACS Symposium SC 1993 Alkiviadis G Akritas, Evgenia K Akritas, University of Kansas Department of Computer Science Lawrence, KS 66045-2192, USA Genadii
More informationCOURSE OF STUDY MATHEMATICS
COURSE OF STUDY MATHEMATICS Name of Course: Pre-Calculus Course Number: 340 Grade Level: 12 Length of Course: 180 Days Type of Offering: Academic/Elective Credit Value: 1 credit Prerequisite/s: Algebra
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationDOES XY 2 = Z 2 IMPLY X IS A SQUARE?
DOES XY 2 = Z 2 IMPLY X IS A SQUARE? JACK S. CALCUT 1. Introduction Ordinary integers have the property that if the product of a number and a square is a square, then the number itself is a square. That
More information9.4. Mathematical Induction. Introduction. What you should learn. Why you should learn it
333202_090.qxd 2/5/05 :35 AM Page 73 Section 9. Mathematical Induction 73 9. Mathematical Induction What you should learn Use mathematical induction to prove statements involving a positive integer n.
More informationHistory of Mathematics
History of Mathematics Paul Yiu Department of Mathematics Florida Atlantic University Spring 2014 10A: Newton s binomial series Issac Newton (1642-1727) obtained the binomial theorem and the area of a
More informationPreface. Figures Figures appearing in the text were prepared using MATLAB R. For product information, please contact:
Linear algebra forms the basis for much of modern mathematics theoretical, applied, and computational. The purpose of this book is to provide a broad and solid foundation for the study of advanced mathematics.
More informationALGEBRA 1 H2 COURSE SYLLABUS
ALGEBRA 1 H2 COURSE SYLLABUS Primary Course Materials: Book: Big Ideas Math Algebra 1 Publisher: Big Ideas Learning LCC Authors: Larson and Boswell Additional Resources: Algebra 1Student Journals, Algebra
More informationThe theory of continued fractions and the approximations of irrational numbers
교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the approximations of irrational numbers 202 년 2 월 인하대학교교육대학원 수학교육전공 정미라 교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
More informationAveraging sums of powers of integers and Faulhaber polynomials
Annales Mathematicae et Informaticae 42 (20. 0 htt://ami.ektf.hu Averaging sums of owers of integers and Faulhaber olynomials José Luis Cereceda a a Distrito Telefónica Madrid Sain jl.cereceda@movistar.es
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationESCONDIDO UNION HIGH SCHOOL DISTRICT COURSE OF STUDY OUTLINE AND INSTRUCTIONAL OBJECTIVES
ESCONDIDO UNION HIGH SCHOOL DISTRICT COURSE OF STUDY OUTLINE AND INSTRUCTIONAL OBJECTIVES COURSE TITLE: Algebra II A/B COURSE NUMBERS: (P) 7241 / 2381 (H) 3902 / 3903 (Basic) 0336 / 0337 (SE) 5685/5686
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More information