DOCSLIB.ORG

The Riemann Zeta Function and Bernoulli Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Riemann Zeta Function and Bernoulli Numbers The Riemann zeta function and Bernoulli numbers 1 Bernoulli numbers and power sums Last time we observed that the exponential generating function for the power sums was expressed in terms of Bernoulli numbers. More precisely, if k > 0, then n k X k X k Sk(n) = i = i : i=1 i=0 For k = 0, note that the two sums actually differ (since the sum starting at 1 has n terms while the sum starting at 0 has n + 1 terms). Nevertheless, we will use the latter expression to establish that X tk ent − 1 t S (n − 1) = : k k! t et − 1 k≥0 t We defined the Bernoulli numbers as the coefficients in the Maclaurin series expansion of 1−et . In other words: 1 t X tk = B : et − 1 k k! k=0 You can work out the first few Bernoulli numbers by explicitly computing derivatives of the function 1 1 on the left hand side at t = 0. In particular, we have B0 = 1, B1 = − 2 , B2 = 6 , B3 = 0 etc. 1−ent If we evaluate the series for t , we may put these two facts together to obtain a “closed form” expression for the power sums. Indeed 1 ent − 1 1 X (nt)j = ( − 1): t t j! j=0 Since the term with j = 0 is 1, once we cancel the ones, every term within the parentheses contains a power of t that is ≥ 1. In other words, we may divide by t to get 1 t X tj−1 = nj : 1 − ent j! j=1 Multiplying out we get 1 1 ent − 1 t X tj−1 X ti = ( nj )( B ): t et − 1 j! i i! j=1 i=0 1 2 1 Bernoulli numbers and power sums Writing out the first few terms we get: t t2 t3 t2 t3 (n + n2 + n3 + n4 + ··· )(B + B t + B + B + ··· ) 2! 3! 4! 0 1 2 2! 3 3! Multiplying these out yields B B B B nB + (n2 0 + nB )t + (n3 0 + n2 1 + n 2 )t2 0 2! 1 3! 2! 2! B B B B + (n4 0 + n3 1 + n2 2 + n 3 )t3 4! 3! (2!)(2!) 3! tn To relate these to power sums, we want to write coefficients in terms of n! . Thus, in the third term, we get B B B t2 B t2 1 3 3 3 2!(n3 0 +n2 1 +n 2 ) = (n3 0 +n2B +nB ) = (n3 B +n2 B +n B ) 3! 2! 2! 2! 3 1 2 2! 3 0 0 1 1 2 2 and in the fourth term we get: B B B B t3 B 3! t3 3!(n4 0 + n3 1 + n2 2 + n 3 ) = (n4 0 + n3B + n2 B + nB ) 4! 3! (2!)(2!) 3! 3! 4 1 2!2! 2 3 3! 1 4 4 4 4 t3 = (n4 B + n3 B + n2 B + n B ) : 4 0 0 1 1 2 2 3 3 3! These computations generalize to the following statement, which is sometimes known as Faul- haber’s formula. Theorem 1.1. For any integer k ≥ 0, we have k X tk ent − 1 t X 1 X k + 1 tk S (n − 1) = = ( nk+1−j B ) ; k k! t et − 1 k + 1 j j k! k≥0 k≥0 j=0 i.e., equating coefficients: k 1 X k + 1 S (n − 1) = nk+1−j B : k k + 1 j j j=0 Proof. Exercise, generalize the observations above! Remark 1.2. The above statement refines our prior assertions that Sk(n − 1) was a polynomial of 1 degree k + 1 in n with leading coefficient k+1 and constant term 0, by giving a precise formula for all the coefficients of the relevant polynomial! In the recursive approach to evaluating power sums with which we began, it was completely unclear that there should be any structural regularity to the form of the coefficients in the polynomial of degree k + 1 that we knew represented a power sum! Thus, the problem has been modified a bit: give more information about the Bernoulli numbers Bk. For example, one may show that Bn vanishes for all odd values of n that are strictly greater than 1, so many terms in the above sums are actually zero. 3 2 The zeta function 2 The zeta function Above, we investigated the sums n X k Sk(n) := i ; i=1 but the expression on the right makes sense for any value of k, even values that are integers. In particular, it makes sense for negative values of k, in which case we are summing reciprocals of powers. For negative values of k, this finite sum actually converges to a limit as n ! 1 as well, unlike the situation for positive powers of k. Bearing this in mind, we define X 1 ζ(s) := : ns n≥1 This function is one of the most important functions in number theory. It turns out the difference between the finite sum and the infinite sum can also be controlled using Bernoulli numbers via the Euler-Maclaurin summation formula, so we will focus on analyzing ζ(s). Remark 2.1. The zeta function may also be thought of as a kind of generating function: if an; n ≥ 1 is a sequence, then we may consider the function X an ; ns n≥0 a series of this kind is called a Dirichlet series. For example, X 1 ζ(2) = : n2 n≥1 The problem of evaluating this sum was known as the Basel problem. It was eventually solved by Euler, and our next goal will be to evaluate this sum. Observe that on the right hand side, we may break the sum into two pieces corresponding to n even and n odd. Indeed X 1 X 1 1 X 1 X 1 ζ(2) = + = ( ) + : (2n)2 (2n + 1)2 4 n2 (2n + 1)2 n≥1 n≥0 n≥0 n≥0 4 P 1 In other words, ζ(2) = 3 n≥0 (2n+1)2 , and it will suffice for us to evaluate this sum. We will do this solely by means of techniques you learned in Calculus II. The general binomial theorem Previously, we stated the binomial theorem for integer values of n, i.e., we gave a formula for (a + b)n. However, if jx < 1j, we may also compute the Maclaurin series for (1 + x)a for a a real number that is not necessarily an integer. Indeed, if you repeatedly differentiate (1 + x)a using the power and chain rule, and plug in x = 0, then one obtains dn (1 + x)aj = a(a − 1) ··· (a − (n − 1)) dxn x=0 4 2 The zeta function Then, we get the following fact. We will write a a(a − 1) ··· (a − (n − 1)) := ; n n! this notion coincides with the usual binomial coefficient if a is an integer. Theorem 2.2. For jxj < 1, a(a − 1) X a (1 + x)a = 1 + ax + x2 + ··· = xn 2! n n≥0 Evaluation of ζ(2) Using the general binomial theorem we can compute a Maclaurin series for arcsin(x). The deriva- 2 − 1 tive of the arcsine function is (1 − x ) 2 . Therefore, the fundamental theorem of calculus tells us that: Z x 2 − 1 arcsin(x) := (1 − x ) 2 ; 0 when jxj < 1. We may write a series for the expression inside the integrand on the right using the binomial theorem: replace x by (−x)2 and take a = −1=2. If we integrate the resulting series term by term, one obtains the following result. Remark 2.3. The products of odd and even numbers up to a point have nice expressions in terms of factorials and powers of 2. Indeed: 2 · 4 ··· 2n − 2 · 2n = 2nn!: Similarly, 1 · 2 ··· 2n − 1 · 2n (2n)! 1 · 3 ···· 2n − 1 = = : 2 · 4 ··· 2n − 2 · 2n 2n(n!) You can (and should!) prove both of these formulas by induction. Theorem 2.4. If jxj ≤ 1, then 1 X (2n)! x2n+1 1 x3 1 · 3 x5 arcsin(x) = = x + + + ··· : 22n(n!)2 2n + 1 2 3 2 · 4 5 n=0 Proof. First, let us write the terms of the series. Each term takes the form Z x −1 −1 x2n+1 2 (−t2)ndt = 2 (−1)n : 0 n n 2n + 1 Thus, we just have to write an explicit formula for −1 (− 1 )(− 3 ) ··· (− 1 − n + 1) 2 = 2 2 2 : n n! 5 2 The zeta function −1 Now, ( 1 − n + 1) = −1−2n+2 = −2n+1 = − 2n−1 . In other words, the numerator of 2 is a 2 2 2 2 n product of odd numbers from −1 through −(2n − 1) divided by 2n, i.e., (−1)n times the product of the odd numbers from 1 to 2n − 1 divided by 2n. Since 2n · n! is the product of the first n −1 even numbers, and since the (−1)n coming from 2 multiplied by the (−1)n coming from the n integral of (−t2)n gives (−1)2n = 1, we see that the formula for the coefficient of the n-th term takes the stated form. You can (and should) prove this by induction! The convergence of the series for jxj < 1 follows from the convergence statement in the general binomial theorem. In that case, convergence follows, e.g., by appeal to the ratio test. When jxj = 1, the ratio test is inconclusive. Nevertheless, a slight extension of the ratio test called Raabe’s test can be used to guarantee convergence in this case.
Load more

Recommended publications
  • The Unilateral Z–Transform and Generating Functions
    The Unilateral z{Transform and Generating Functions Recall from \Discrete{Time Linear, Time Invariant Systems and z-Transforms" that the behaviour of a discrete{time LTI system is determined by its impulse response function h[n] and that the z{transform of h[n] is 1 k H(z) = z− h[k] k=X −∞ If the LTI system is causal, then h[n] = 0 for all n < 0 and 1 k H(z) = z− h[k] Xk=0 Definition 1 (Unilateral z{Transform) The unilateral z{transform of the discrete{time signal x[n] (whether or not x[n] = 0 for negative n's) is defined to be 1 n (z) = z− x[n] X nX=0 When there is any danger of confusing the regular z{transform with the unilateral z{transform, 1 n X(z) = z− x[n] nX= 1 − is called the bilateral z{transform. Example 2 The signal x[n] = anu[n] is zero for all n < 0. So the unilateral z{transform of x[n] is the same as the ordinary z{transform. So, as we saw in Example 7 of \Discrete{Time Linear, Time Invariant Systems and z-Transforms", 1 n n 1 (z) = X(z) = z− a = 1 X 1 z− a nX=0 − 1 provided that z− a < 1, or equivalently z > a . Since the unilateral z{transform of any x[n] is always j j j j j j equal to the bilateral z{transform of the right{sided signal x[n]u[n], the region of convergence of a unilateral z{transform is always the exterior of a circle.
    [Show full text]
  • Ordinary Generating Functions
    CHAPTER 10 Ordinary Generating Functions Introduction We’ll begin this chapter by introducing the notion of ordinary generating functions and discussing the basic techniques for manipulating them. These techniques are merely restatements and simple applications of things you learned in algebra and calculus. You must master these basic ideas before reading further. In Section 2, we apply generating functions to the solution of simple recursions. This requires no new concepts, but provides practice manipulating generating functions. In Section 3, we return to the manipulation of generating functions, introducing slightly more advanced methods than those in Section 1. If you found the material in Section 1 easy, you can skim Sections 2 and 3. If you had some difficulty with Section 1, those sections will give you additional practice developing your ability to manipulate generating functions. Section 4 is the heart of this chapter. In it we study the Rules of Sum and Product for ordinary generating functions. Suppose that we are given a combinatorial description of the construction of some structures we wish to count. These two rules often allow us to write down an equation for the generating function directly from this combinatorial description. Without such tools, we may get bogged down in lengthy algebraic manipulations. 10.1 What are Generating Functions? In this section, we introduce the idea of ordinary generating functions and look at some ways to manipulate them. This material is essential for understanding later material on generating functions. Be sure to work the exercises in this section before reading later sections! Definition 10.1 Ordinary generating function (OGF) Suppose we are given a sequence a0,a1,..
    [Show full text]
  • 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]
  • The Bloch-Wigner-Ramakrishnan Polylogarithm Function
    Math. Ann. 286, 613424 (1990) Springer-Verlag 1990 The Bloch-Wigner-Ramakrishnan polylogarithm function Don Zagier Max-Planck-Insfitut fiir Mathematik, Gottfried-Claren-Strasse 26, D-5300 Bonn 3, Federal Republic of Germany To Hans Grauert The polylogarithm function co ~n appears in many parts of mathematics and has an extensive literature [2]. It can be analytically extended to the cut plane ~\[1, ~) by defining Lira(x) inductively as x [ Li m_ l(z)z-tdz but then has a discontinuity as x crosses the cut. However, for 0 m = 2 the modified function O(x) = ~(Liz(x)) + arg(1 -- x) loglxl extends (real-) analytically to the entire complex plane except for the points x=0 and x= 1 where it is continuous but not analytic. This modified dilogarithm function, introduced by Wigner and Bloch [1], has many beautiful properties. In particular, its values at algebraic argument suffice to express in closed form the volumes of arbitrary hyperbolic 3-manifolds and the values at s= 2 of the Dedekind zeta functions of arbitrary number fields (cf. [6] and the expository article [7]). It is therefore natural to ask for similar real-analytic and single-valued modification of the higher polylogarithm functions Li,. Such a function Dm was constructed, and shown to satisfy a functional equation relating D=(x-t) and D~(x), by Ramakrishnan E3]. His construction, which involved monodromy arguments for certain nilpotent subgroups of GLm(C), is completely explicit, but he does not actually give a formula for Dm in terms of the polylogarithm. In this note we write down such a formula and give a direct proof of the one-valuedness and functional equation.
    [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]