DOCSLIB.ORG

Bernoulli Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Bernoulli Numbers Bernoulli numbers Ezra Getzler Department of Mathematics Northwestern University Tsinghua Math Camp 2017.7.20 Bernoulli numbers 1 / 43 Triangular numbers Everyone is familiar with the sum n(n + 1) 1 + 2 + ··· + n = : 2 These numbers are called the triangular numbers. For example, 1(1 + 1) 1 = = 1 2 2(2 + 1) 1 + 2 = = 3 2 3(3 + 1) 1 + 2 + 3 = = 6 2 4(4 + 1) 1 + 2 + 3 + 4 = = 10 2 5(5 + 1) 1 + 2 + 3 + 4 + 5 = = 15 2 Bernoulli numbers 2 / 43 Pyramidal numbers Many of you will also be familiar with the pyramidal numbers: these are the sums of squares: n(n + 1)(2n + 1) 12 + 22 + ··· + n2 = 6 For example, 1(1 + 1)(2 + 1) 12 = = 1 6 2(2 + 1)(4 + 1) 12 + 22 = = 5 6 3(3 + 1)(6 + 1) 12 + 22 + 32 = = 14 6 4(4 + 1)(8 + 1) 12 + 22 + 32 + 42 = = 30 6 5(5 + 1)(10 + 1) 12 + 22 + 32 + 42 + 52 = = 55 6 Bernoulli numbers 3 / 43 Generalizations? Is there a general story here? If k is a natural number larger than 2, is there a formula for the sum of the kth powers of the first n natural numbers? 1k + ··· + nk =??? Bernoulli numbers 4 / 43 Nicomachus Nicomachus (Niko'maqoc) was a Hellenistic mathematician who lived between around 60 CE and 120 CE in the Roman city of Gerasa, east of the Jordan River. He was a Neopythagorean, who believed in religious doctrines based on the Greek philosophers Pythagorus and Plato. Among their beliefs, they associated God with the number One. Bernoulli numbers 5 / 43 Nicomachus's Theorem Nicomachus gave a formula for the sum of cubes: 13 + 23 + ··· + n3 = 1 + 2 + ··· + n2 This is a beautiful formula but it doesn't really give an idea of how to understand the general sums 1k + ··· + nk =??? The proof uses mathematical induction. For n = 1, both sides of the equation 13 + 23 + ··· + n3 = 1 + 2 + ··· + n2 equal 1. Bernoulli numbers 6 / 43 Suppose we have proved that 13 + 23 + ··· + n3 = 1 + 2 + ··· + n2 We want to prove that replacing n by n + 1, both sides increase by the same amount, namely (n + 1)3. Consider the square with sides (n + 1)(n + 2) 1 + 2 + ··· + n + (n + 1) = ; 2 and subdivide the sides into two segments, of length n(n + 1) 1 + 2 + ··· + n = 2 and n + 1 respectively. Bernoulli numbers 7 / 43 n(n + 1)=2 n + 1 n(n + 1)=2 AB n + 1 CD We see that (1 + 2 + ··· + n + (n + 1))2 = A + B + C + D n(n + 1)2 n(n + 1)2 = (1 + 2 + ··· + n)2 + + + (n + 1)2 2 2 = (13 + 23 + ··· + n3) + n(n + 1)2 + (n + 1)2 = (13 + 23 + ··· + n3) + (n + 1)3: Bernoulli numbers 8 / 43 Johannes Faulhaber The next steps in this subject were taken by Johannes Faulhaber (1585-1635), a mathematician who was born and lived in the German city of Ulm. Bernoulli numbers 9 / 43 Faulhaber's Theorem Faulhaber showed that for any fixed natural number k, the sum of powers k k k Σk (n) = 1 + 2 + ··· + n ; thought of as a function of n, is a polynomial of degree k + 1. We have already seen this explicitly for k = 0, 1, 2 and 3, where the polynomials are respectively n, n(n + 1)=2, n(n + 1)(2n + 1)=6, and n2(n + 1)2=4. In other words, there are numbers bk;i for i = 1;:::; k + 1, such that k k k k+1 k 2 1 + 2 + ··· + n = bk;k+1n + bk;k n + ··· + bk;2n + bk;1n: It turns out that all of the coefficients of these polynomials are rational numbers. (The constant term bk;0 is absent because both sides vanish when n = 0.) Bernoulli numbers 10 / 43 When we take k = 4, something interesting happens | the coefficient of the linear term n has quite a large denominator. n5 n4 n3 n Σ (n) = + + − : 4 5 2 3 30 Let's prove this special case of Faulhaber's Theorem: the general case is actually proved in exactly the same way. Suppose that the left-hand side is a polynomial in n of degree 5: 5 4 3 2 Σ4(n) = b4;5n + b4;4n + b4;3n + b4;2n + b4;1n If we can find values of b4;k such that both sides are equal for n = 0, and the right-hand side jumps by n4 as we go from n − 1 to n, then the formula will be proved. The case n = 0 is easy: both sides vanish. Bernoulli numbers 11 / 43 It remains to check that 5 4 3 2 b4;5n + b4;4n + b4;3n + b4;2n + b4;1n 5 4 3 2 4 − b4;5(n − 1) + b4;4(n − 1) + b4;3(n − 1) + b4;2(n − 1) + b4;1(n − 1) = n : The left-hand side equals 5 5 4 4 3 3 2 2 b4;5(n − (n − 1) ) + b4;4(n − (n − 1) ) + b4;3(n − (n − 1) ) + b4;2(n − (n − 1) ) + b4;1(n − (n − 1)) 4 3 2 3 2 2 = b4;5(5n − 10n + 10n − 5n + 1) + b4;4(4n − 6n + 4n − 1) + b4;3(3n − 3n + 1) + b4;2(2n − 1) + b4;1 The induction step consists of showing that the numbers b4;i may be chosen in such a way that this equals n4. Bernoulli numbers 12 / 43 To do this, it suffices to solve the simultaneous linear equations 5b4;5 = 1 −10b4;5 + 4b4;4 = 0 10b4;5 − 6b4;4 + 3b4;3 = 0 −5b4;5 + 4b4;4 − 3b4;3 + 2b4;2 = 0 b4;5 − b4;4 + b4;3 − b4;2 + b4;1 = 0: It is easy to see that these have a unique solution, in which each coefficient b4;i is a rational number: (b4;5; b4;4; b4;3; b4;2; b4;1) = (1=5; 1=2; 1=3; 0; −1=30): Two things about this solution are striking: the quadratic term is missing (that is, b4;2 = 0), and the linear term has the peculiar coefficient −1=30. Bernoulli numbers 13 / 43 Let us list the coefficients bk;i in a table for k = 1;:::; 6: k bk;1 bk;2 bk;3 bk;4 bk;5 bk;6 bk;7 0 1 1 1=2 1=2 2 1=6 1=2 1=3 3 0 1=4 1=2 1=4 4 −1=30 0 1=3 1=2 1=5 5 0 −1=12 0 5=12 1=2 1=6 6 1=42 0 −1=6 0 1=2 1=2 1=7 The numbers in the left column have a name: they are the Bernoulli numbers Bk . Along the diagonals, this table shows some nice patterns. A little experimentation shows that the following conjectural formula holds explains all of the diagonal patterns in the table: k! B b = k−i+1 : k;i i! (k − i + 1)! Bernoulli numbers 14 / 43 Jakob Bernoulli Jakob Bernoulli (1645{1705) was a member of a famous family of mathematicians in the Swiss city of Basel. He wrote an important book Ars Conjectandi (The Art of Conjecture) on probability and games of chance, and discovered the number e. Bernoulli numbers 15 / 43 Jakob Bernoulli gave the first description of the numbers now named after him. In modern language, the numbers Bk are defined recursively by k+1 k+1 k+1 k+1 k = 1 B1 + ··· + k−2 Bk−2 + k−1 Bk−1 + k Bk : 1 = 2 B1 , so that B1 = 1=2 2 = 3 B1 + 3 B2 , so that B2 = 1=6 3 = 4 B1 + 6 B2 + 4 B3 , so that B3 = 0 4 = 5 B1 + 10 B2 + 10 B3 + 5 B4 , so that B4 = −1=30 It is not hard to calculate a few more of these numbers for yourself. Eventually, you reach the bizarre number B12 = −691=2730: this hints that the Bernoulli numbers present a richer structure than most sequences of numbers you will have met in mathematics. Bernoulli numbers 16 / 43 The Bernoulli numbers have many remarkable properties. Theorem If k > 1 is odd, then Bk = 0. To see this, we extend the function Σk (n) to negative values of n. Observe that Σk (n) is completely determined by the formulas Σk (0) = 0 and k Σk (n) − Σk (n − 1) = n . This makes it natural to set k k k Σk (−n) = (−n + 1) + (−n + 2) + ··· + (−1) : This gives the remarkable identity k Σk (−n) = (−1) Σk (n − 1): Bernoulli numbers 17 / 43 If k is odd, we can calculate Σk (n) + Σk (−n) in two different ways: if k is odd, the above identity shows that k Σk (n) + Σk (−n) = Σk (n) − Σk (n − 1) = n : On the other hand, Faulhaber's Theorem shows that k k−2 k−4 Σk (n) + Σk (−n) = 2 bk;k n + bk;k−2n + bk;k−4n + ··· + bk;1n : It follows that if k > 1, Bk = bk;1 = 0 (and B1 = 1=2, but we already knew this). Bernoulli numbers 18 / 43 Theorem The signs of the even Bernoulli numbers oscillate: B2, B6, . , are positive, and B4, B8, . , are negative. There are two ways to prove this result. The first is as a corollary of the following theorem. Theorem The derivative k−1 d tan(x) k−1 dx x=0 k=2−1 k k equals (−1) 2 (2 − 1)Bk =k. It vanishes if k is odd, and is a positive integer if k is even.
Load more

Recommended publications
  • An Appreciation of Euler's Formula
    Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 17 An Appreciation of Euler's Formula Caleb Larson North Dakota State University Follow this and additional works at: https://scholar.rose-hulman.edu/rhumj Recommended Citation Larson, Caleb (2017) "An Appreciation of Euler's Formula," Rose-Hulman Undergraduate Mathematics Journal: Vol. 18 : Iss. 1 , Article 17. Available at: https://scholar.rose-hulman.edu/rhumj/vol18/iss1/17 Rose- Hulman Undergraduate Mathematics Journal an appreciation of euler's formula Caleb Larson a Volume 18, No. 1, Spring 2017 Sponsored by Rose-Hulman Institute of Technology Department of Mathematics Terre Haute, IN 47803 [email protected] a scholar.rose-hulman.edu/rhumj North Dakota State University Rose-Hulman Undergraduate Mathematics Journal Volume 18, No. 1, Spring 2017 an appreciation of euler's formula Caleb Larson Abstract. For many mathematicians, a certain characteristic about an area of mathematics will lure him/her to study that area further. That characteristic might be an interesting conclusion, an intricate implication, or an appreciation of the impact that the area has upon mathematics. The particular area that we will be exploring is Euler's Formula, eix = cos x + i sin x, and as a result, Euler's Identity, eiπ + 1 = 0. Throughout this paper, we will develop an appreciation for Euler's Formula as it combines the seemingly unrelated exponential functions, imaginary numbers, and trigonometric functions into a single formula. To appreciate and further understand Euler's Formula, we will give attention to the individual aspects of the formula, and develop the necessary tools to prove it.
    [Show full text]
  • Newton and Leibniz: the Development of Calculus Isaac Newton (1642-1727)
    Newton and Leibniz: The development of calculus Isaac Newton (1642-1727) Isaac Newton was born on Christmas day in 1642, the same year that Galileo died. This coincidence seemed to be symbolic and in many ways, Newton developed both mathematics and physics from where Galileo had left off. A few months before his birth, his father died and his mother had remarried and Isaac was raised by his grandmother. His uncle recognized Newton’s mathematical abilities and suggested he enroll in Trinity College in Cambridge. Newton at Trinity College At Trinity, Newton keenly studied Euclid, Descartes, Kepler, Galileo, Viete and Wallis. He wrote later to Robert Hooke, “If I have seen farther, it is because I have stood on the shoulders of giants.” Shortly after he received his Bachelor’s degree in 1665, Cambridge University was closed due to the bubonic plague and so he went to his grandmother’s house where he dived deep into his mathematics and physics without interruption. During this time, he made four major discoveries: (a) the binomial theorem; (b) calculus ; (c) the law of universal gravitation and (d) the nature of light. The binomial theorem, as we discussed, was of course known to the Chinese, the Indians, and was re-discovered by Blaise Pascal. But Newton’s innovation is to discuss it for fractional powers. The binomial theorem Newton’s notation in many places is a bit clumsy and he would write his version of the binomial theorem as: In modern notation, the left hand side is (P+PQ)m/n and the first term on the right hand side is Pm/n and the other terms are: The binomial theorem as a Taylor series What we see here is the Taylor series expansion of the function (1+Q)m/n.
    [Show full text]
  • Mathematics (MATH)
    Course Descriptions MATH 1080 QL MATH 1210 QL Mathematics (MATH) Precalculus Calculus I 5 5 MATH 100R * Prerequisite(s): Within the past two years, * Prerequisite(s): One of the following within Math Leap one of the following: MAT 1000 or MAT 1010 the past two years: (MATH 1050 or MATH 1 with a grade of B or better or an appropriate 1055) and MATH 1060, each with a grade of Is part of UVU’s math placement process; for math placement score. C or higher; OR MATH 1080 with a grade of C students who desire to review math topics Is an accelerated version of MATH 1050 or higher; OR appropriate placement by math in order to improve placement level before and MATH 1060. Includes functions and placement test. beginning a math course. Addresses unique their graphs including polynomial, rational, Covers limits, continuity, differentiation, strengths and weaknesses of students, by exponential, logarithmic, trigonometric, and applications of differentiation, integration, providing group problem solving activities along inverse trigonometric functions. Covers and applications of integration, including with an individual assessment and study inequalities, systems of linear and derivatives and integrals of polynomial plan for mastering target material. Requires nonlinear equations, matrices, determinants, functions, rational functions, exponential mandatory class attendance and a minimum arithmetic and geometric sequences, the functions, logarithmic functions, trigonometric number of hours per week logged into a Binomial Theorem, the unit circle, right functions, inverse trigonometric functions, and preparation module, with progress monitored triangle trigonometry, trigonometric equations, hyperbolic functions. Is a prerequisite for by a mentor. May be repeated for a maximum trigonometric identities, the Law of Sines, the calculus-based sciences.
    [Show full text]
  • The Discovery of the Series Formula for Π by Leibniz, Gregory and Nilakantha Author(S): Ranjan Roy Source: Mathematics Magazine, Vol
    The Discovery of the Series Formula for π by Leibniz, Gregory and Nilakantha Author(s): Ranjan Roy Source: Mathematics Magazine, Vol. 63, No. 5 (Dec., 1990), pp. 291-306 Published by: Mathematical Association of America Stable URL: http://www.jstor.org/stable/2690896 Accessed: 27-02-2017 22:02 UTC JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at http://about.jstor.org/terms Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to Mathematics Magazine This content downloaded from 195.251.161.31 on Mon, 27 Feb 2017 22:02:42 UTC All use subject to http://about.jstor.org/terms ARTICLES The Discovery of the Series Formula for 7r by Leibniz, Gregory and Nilakantha RANJAN ROY Beloit College Beloit, WI 53511 1. Introduction The formula for -r mentioned in the title of this article is 4 3 57 . (1) One simple and well-known moderm proof goes as follows: x I arctan x = | 1 +2 dt x3 +5 - +2n + 1 x t2n+2 + -w3 - +(-I)rl2n+1 +(-I)l?lf dt. The last integral tends to zero if Ix < 1, for 'o t+2dt < jt dt - iX2n+3 20 as n oo.
    [Show full text]
  • 1. More Examples Example 1. Find the Slope of the Tangent Line at (3,9)
    1. More examples Example 1. Find the slope of the tangent line at (3; 9) to the curve y = x2. P = (3; 9). So Q = (3 + ∆x; 9 + ∆y). 9 + ∆y = (3 + ∆x)2 = (9 + 6∆x + (∆x)2. Thus, we have ∆y = 6 + ∆x. ∆x If we let ∆ go to zero, we get ∆y lim = 6 + 0 = 6. ∆x→0 ∆x Thus, the slope of the tangent line at (3; 9) is 6. Let's consider a more abstract example. Example 2. Find the slope of the tangent line at an arbitrary point P = (x; y) on the curve y = x2. Again, P = (x; y), and Q = (x + ∆x; y + ∆y), where y + ∆y = (x + ∆x)2 = x2 + 2x∆x + (∆x)2. So we get, ∆y = 2x + ∆x. ∆x Letting ∆x go to zero, we get ∆y lim = 2x + 0 = 2x. ∆x→0 ∆x Thus, the slope of the tangent line at an arbitrary point (x; y) is 2x. Example 3. Find the slope of the tangent line at an arbitrary point P = (x; y) on the curve y = ax3, where a is a real number. Q = (x + ∆x; y + ∆y). We get, 1 2 y + ∆y = a(x + ∆x)3 = a(x3 + 3x2∆x + 3x(∆x)2 + (∆x)3). After simplifying we have, ∆y = 3ax2 + 3xa∆x + a(∆x)2. ∆x Letting ∆x go to 0 we conclude, ∆y 2 2 mP = lim = 3ax + 0 + 0 = 3ax . x→0 ∆x 2 Thus, the slope of the tangent line at a point (x; y) is mP = 3ax . Example 4.
    [Show full text]
  • Multipermutations 1.1. Generating Functions
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector JOURNALOF COMBINATORIALTHEORY, Series A 67, 44-71 (1994) The r- Multipermutations SEUNGKYUNG PARK Department of Mathematics, Yonsei University, Seoul 120-749, Korea Communicated by Gian-Carlo Rota Received October 1, 1992 In this paper we study permutations of the multiset {lr, 2r,...,nr}, which generalizes Gesse| and Stanley's work (J. Combin. Theory Ser. A 24 (1978), 24-33) on certain permutations on the multiset {12, 22..... n2}. Various formulas counting the permutations by inversions, descents, left-right minima, and major index are derived. © 1994 AcademicPress, Inc. 1. THE r-MULTIPERMUTATIONS 1.1. Generating Functions A multiset is defined as an ordered pair (S, f) where S is a set and f is a function from S to the set of nonnegative integers. If S = {ml ..... mr}, we write {m f(mD, .... m f(mr)r } for (S, f). Intuitively, a multiset is a set with possibly repeated elements. Let us begin by considering permutations of multisets (S, f), which are words in which each letter belongs to the set S and for each m e S the total number of appearances of m in the word is f(m). Thus 1223231 is a permutation of the multiset {12, 2 3, 32}. In this paper we consider a special set of permutations of the multiset [n](r) = {1 r, ..., nr}, which is defined as follows. DEFINITION 1.1. An r-multipermutation of the set {ml ..... ran} is a permutation al ""am of the multiset {m~ ....
    [Show full text]
  • 40 Chapter 6 the BINOMIAL THEOREM in Chapter 1 We Defined
    Chapter 6 THE BINOMIAL THEOREM n In Chapter 1 we defined as the coefficient of an-rbr in the expansion of (a + b)n, and r tabulated these coefficients in the arrangement of the Pascal Triangle: n Coefficients of (a + b)n 0 1 1 1 1 2 1 2 1 3 1 3 3 1 4 1 4 6 4 1 5 1 5 10 10 5 1 6 1 6 15 20 15 6 1 ... n n We then observed that this array is bordered with 1's; that is, ' 1 and ' 1 for n = 0 n 0, 1, 2, ... We also noted that each number inside the border of 1's is the sum of the two closest numbers on the previous line. This property may be expressed in the form n n n%1 (1) % ' . r&1 r r This formula provides an efficient method of generating successive lines of the Pascal Triangle, but the method is not the best one if we want only the value of a single binomial coefficient for a 100 large n, such as . We therefore seek a more direct approach. 3 It is clear that the binomial coefficients in a diagonal adjacent to a diagonal of 1's are the 40 n numbers 1, 2, 3, ... ; that is, ' n. Now let us consider the ratios of binomial coefficients 1 to the previous ones on the same row. For n = 4, these ratios are: (2) 4/1, 6/4 = 3/2, 4/6 = 2/3, 1/4. For n = 5, they are (3) 5/1, 10/5 = 2, 10/10 = 1, 5/10 = 1/2, 1/5.
    [Show full text]
  • Q-Combinatorics
    q-combinatorics February 7, 2019 1 q-binomial coefficients n n Definition. For natural numbers n; k,the q-binomial coefficient k q (or just k if there no ambi- guity on q) is defined as the following rational function of the variable q: (qn − 1)(qn−1 − 1) ··· (q − 1) : (1.1) (qk − 1)(qk−1 − 1) ··· (q − 1) · (qn−k − 1)(qn−k−1 − 1) ··· (q − 1) For n = 0, k = 0, or n = k, we interpret the corresponding products 1, as the value of the empty product. If we exclude certain roots of unity from the domain of q, (1.1) is equal to (qn − 1)(qn−1 − 1) ··· (qn−k+1 − 1) (1.2) (qk − 1)(qk−1 − 1) ··· (q − 1) · 1 (qn−1 + ::: + q + 1) ··· (q2 + q + 1)(q + 1) · 1 = : (qk−1 + ::: + q + 1) ··· (q2 + q + 1)(q + 1) · 1(qn−k−1 + ::: + q + 1) ··· (q2 + q + 1)(q + 1) · 1 As the notation starts to be overwhelming, we introduce to q-analogue of the positive integer n, n−1 denoted by [n] or [n]q, as q + ::: + q + 1; and the q-analogue of the factorial of the positive integer n, denoted by [n]! or [n]q!, as [n]q! = [1]q · [2]q ··· [n]q. With this additional notation, we also can say n [n] ! = q ; (1.3) k q [k]q![n − k]q! when we avoid certain roots of unity with q. It is easy too see from (1.1) that n n = = 1 0 q n q and that for every 0 ≤ k ≤ n the symmetry rule n n = k q n − k q holds.
    [Show full text]
  • Leonhard Euler: His Life, the Man, and His Works∗
    SIAM REVIEW c 2008 Walter Gautschi Vol. 50, No. 1, pp. 3–33 Leonhard Euler: His Life, the Man, and His Works∗ Walter Gautschi† Abstract. On the occasion of the 300th anniversary (on April 15, 2007) of Euler’s birth, an attempt is made to bring Euler’s genius to the attention of a broad segment of the educated public. The three stations of his life—Basel, St. Petersburg, andBerlin—are sketchedandthe principal works identified in more or less chronological order. To convey a flavor of his work andits impact on modernscience, a few of Euler’s memorable contributions are selected anddiscussedinmore detail. Remarks on Euler’s personality, intellect, andcraftsmanship roundout the presentation. Key words. LeonhardEuler, sketch of Euler’s life, works, andpersonality AMS subject classification. 01A50 DOI. 10.1137/070702710 Seh ich die Werke der Meister an, So sehe ich, was sie getan; Betracht ich meine Siebensachen, Seh ich, was ich h¨att sollen machen. –Goethe, Weimar 1814/1815 1. Introduction. It is a virtually impossible task to do justice, in a short span of time and space, to the great genius of Leonhard Euler. All we can do, in this lecture, is to bring across some glimpses of Euler’s incredibly voluminous and diverse work, which today fills 74 massive volumes of the Opera omnia (with two more to come). Nine additional volumes of correspondence are planned and have already appeared in part, and about seven volumes of notebooks and diaries still await editing! We begin in section 2 with a brief outline of Euler’s life, going through the three stations of his life: Basel, St.
    [Show full text]
  • The Binomial Theorem and Combinatorial Proofs Shagnik Das
    The Binomial Theorem and Combinatorial Proofs Shagnik Das Introduction As we live our lives, we are faced with innumerable decisions on a daily basis1. Can I get away with wearing these clothes again before I have to wash them? Which frozen pizza should I have for dinner tonight? What excuse should I use for skipping the gym today? While it may at times seem tiring to be faced with all these choices on a regular basis, it is this exercise of free will that separates us from the machines we live with.2 This multitude of choices, then, provides some measure of our own vitality | the more options we have, the more alive we truly are. What, then, could be more important than being able to count how many options one actually has?4 As we have already seen during our first week of lectures, one of the main protagonists in these counting problems is the binomial coefficient, whose definition is given below. n Definition 1. Given non-negative integers n and k, the binomial coefficient k denotes the number of subsets of size k of a set of n elements. Equivalently, it is the number of unordered choices of k distinct elements from a set of n elements. However, the binomial coefficient leads a double life. Not only does it have the above definition, but also the formula below, which we proved in lecture. Proposition 2. For non-negative integers n and k, n nk n(n − 1)(n − 2) ::: (n − k + 1) n! = = = : k k! k! k!(n − k)! In this note, we will prove several more facts about this most fascinating of creatures.
    [Show full text]
  • Chapter 3.3, 4.1, 4.3. Binomial Coefficient Identities
    Chapter 3.3, 4.1, 4.3. Binomial Coefficient Identities Prof. Tesler Math 184A Winter 2019 Prof. Tesler Binomial Coefficient Identities Math 184A / Winter 2019 1 / 36 Table of binomial coefficients n k k = 0 k = 1 k = 2 k = 3 k = 4 k = 5 k = 6 n = 0 1 0 0 0 0 0 0 n = 1 1 1 0 0 0 0 0 n = 2 1 2 1 0 0 0 0 n = 3 1 3 3 1 0 0 0 n = 4 1 4 6 4 1 0 0 n = 5 1 5 10 10 5 1 0 n = 6 1 6 15 20 15 6 1 n n! Compute a table of binomial coefficients using = . k k! (n - k)! We’ll look at several patterns. First, the nonzero entries of each row are symmetric; e.g., row n = 4 is 4 4 4 4 4 0 , 1 , 2 , 3 , 4 = 1, 4, 6, 4, 1 , n n which reads the same in reverse. Conjecture: k = n-k . Prof. Tesler Binomial Coefficient Identities Math 184A / Winter 2019 2 / 36 A binomial coefficient identity Theorem For nonegative integers k 6 n, n n n n = including = = 1 k n - k 0 n First proof: Expand using factorials: n n! n n! = = k k! (n - k)! n - k (n - k)! k! These are equal. Prof. Tesler Binomial Coefficient Identities Math 184A / Winter 2019 3 / 36 Theorem For nonegative integers k 6 n, n n n n = including = = 1 k n - k 0 n Second proof: A bijective proof. We’ll give a bijection between two sets, one counted by the left n n side, k , and the other by the right side, n-k .
    [Show full text]
  • The Legacy of Leonhard Euler: a Tricentennial Tribute (419 Pages)
    P698.TP.indd 1 9/8/09 5:23:37 PM This page intentionally left blank Lokenath Debnath The University of Texas-Pan American, USA Imperial College Press ICP P698.TP.indd 2 9/8/09 5:23:39 PM Published by Imperial College Press 57 Shelton Street Covent Garden London WC2H 9HE Distributed by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library. THE LEGACY OF LEONHARD EULER A Tricentennial Tribute Copyright © 2010 by Imperial College Press All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the Publisher. For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher. ISBN-13 978-1-84816-525-0 ISBN-10 1-84816-525-0 Printed in Singapore. LaiFun - The Legacy of Leonhard.pmd 1 9/4/2009, 3:04 PM September 4, 2009 14:33 World Scientific Book - 9in x 6in LegacyLeonhard Leonhard Euler (1707–1783) ii September 4, 2009 14:33 World Scientific Book - 9in x 6in LegacyLeonhard To my wife Sadhana, grandson Kirin,and granddaughter Princess Maya, with love and affection.
    [Show full text]