Irregular continued fractions

Size: px
Start display at page:

Download "Irregular continued fractions"

Transcription

1 9 Irregular continued fractions We finish our expedition with a look at irregular continued fractions and pass by some classical gems en route. 9. General theory There exist many generalisations of classical continued fractions. One of the most natural generalisations, which admits many applications not only in number theory but also in analysis, is the following irregular continued fraction: which is written as a 0 + a + a 2 + b b 2 b 3 a a n + b n a n a 0 + b a + b 2 a 2 + b 3 a b n a n., For the regular continued fractions considered earlier, we have b n = for all n. An infinite irregular continued fraction can then be written as a 0 + b a + b 2 a 2 + b 3 a b n a n + (9.) and is formalised as follows. For two given sequences of numbers or indeterminates (a n ) n=0 and (b n) n=, we define rational functions S n(x) by the rule ( b ) n S 0 (x) = a 0 + x, S n (x) = S n, n =, 2, 3,... a n + x 6

2 62 Irregular continued fractions By induction on n =, 2,... it is not hard to show that Therefore, r 0 = S 0 (0) = a 0 and S n (x) = a 0 + b + b 2 + b b n a a 2 a 3 a n + x. r n = S n (0) = a 0 + b a + b 2 a 2 + b 3 a b n a n, n =, 2, 3,... If we assign numerical values to the sequences (a n ) n=0 and (b n) n= (assuming that b n 0 for n N) then we can consider the limit α = lim n r n. If this limit exists α is said to be the value of the irregular continued fraction (9.); the numbers r n, where n = 0,, 2,..., are called the nth convergents. As in the case of regular continued fractions, to every continued fraction (9.) we assign the sequences of numerators (p n ) n= and denominators (q n) n= of the convergents. They are determined by the linear recurrence equations p =, p 0 = a 0, p n = a n p n + b n p n 2, n =, 2,..., q = 0, q 0 =, q n = a n q n + b n q n 2, n =, 2,... (9.2) (When b n we have our familiar regular continued fraction recursions.) The fact that these sequences indeed provide the numerators and denominators of the corresponding convergents is proved in the following statement. Theorem 9. If p n and q n are the sequences generated by (9.2) for a given continued fraction (9.) and S n (x) is the above sequence of rational transformations then S n (x) = p n + p n x q n + q n x, p nq n p n q n 0, n = 0,, 2,... In particular, r n = S n (0) = p n q n, n = 0,, 2,... Exercise 9.2 Prove Theorem 9. by induction on n = 0,, 2,... Once again, a 2 2 matrix approach is useful. From the recurrence relations in (9.2), we see that ( ) ( ) ( ) ( ) a0 a an pn p = n. 0 b 0 b n 0 q n q n By taking the determinant of both sides, we obtain immediately

3 Corollary 9.3 We have p n q n p n q n = ( ) n 9. General theory 63 n b k for n = 0,, 2,... k= Summarising, the sequence of convergents of a continued fraction (9.) is uniquely determined by the sequences ( p n ) n= and (q n) n=, which, in turn, are constructed by means of the recurrence relations (9.2). As the following theorem shows, the converse holds as well: the sequences (9.2) define the continued fraction (9.) in a unique way. Theorem 9.4 Let ( p n ) n= and (q n) n= be two sequences of numbers such that q = 0, p = q 0 = and p n q n p n q n 0 for n = 0,, 2,... Then there exists a unique continued fraction (9.) whose nth numerator is b n and nth denominator is a n, for each n 0. More precisely, a 0 = p 0, a = q, b = p p 0 q, a n = p nq n 2 p n 2 q n, p n q n 2 p n 2 q n b n = p n q n p n q n = 2, 3,... n, p n q n 2 p n 2 q n Proof Again, the proof is by induction on n = 0,, 2,... Theorem 9. provides us with a simple algorithm for computing the value of an irregular continued fraction. Namely, implying that r n = p n q n = p 0 + = a 0 + ( pl p ) l q l q l ( ) l l k= b k, n = 0,, 2,..., q l q l l= l= a 0 + b a + b 2 a 2 + b 3 a b n a n + = a 0 + l= ( ) l l k= b k q l q l. Therefore, the convergence problem for continued fractions of the form (9.) can be reduced to a convergence problem for the corresponding series. Two (irregular) continued fractions a 0 + b + b 2 + b b n + and a 0 a a 2 a 3 a + b n a + b 2 a + b 3 2 a + + b n 3 a + n (9.3)

4 64 Irregular continued fractions with corresponding sequences of convergents (r n ) n=0 and (r n) n=0, respectively, are said to be equivalent if r n = r n for all n = 0,, 2,... Theorem 9.5 Two continued fractions (9.3) are equivalent iff there exists a sequence of nonzero numbers (c n ) n=0 with c 0 = such that a n = c n a n, n = 0,, 2,..., b n = c n c n b n, n =, 2,... (9.4) Proof First, assume that relations (9.4) hold. Then it can be easily shown by induction on n = 0,, 2,..., with the help of the recurrence relations (9.2), that n n p n = p n c l, q n = q n c l, (9.5) l=0 implying that r n = p n/q n = p n /q n = r n. Second, if r n = r n for all n = 0,, 2,... then take c 0 = and define recursively c n = p n/ ( p n n l=0 c l). Now we arrive at the relations in (9.5), which imply (9.4) in accordance with the formulae of Theorem 9.4. Finally, we stress that the value of an infinite irregular continued fraction is not necessarily an irrational number even when the a k and b k are required to be positive integers. An example is given in the following exercise. Exercise 9.6 l=0 Compute the value of the continued fraction Finite identities such as 9.2 Euler continued fraction a 0 + a + a a 2 + a a 2 a 3 + a a 2 a 3 a 4 = a 0 + a + a 2 + a 2 + a 3 + a 3 + a 4 + a 4 are easily verified symbolically. The general form a 0 + a + a a 2 + a a 2 a a a 2 a 3 a N = a 0 + a + a 2 + a 2 + a 3 + a a N + a N (9.6) can then be obtained by substituting a N + a N a N+ for a N and checking that the form of the right-hand side is preserved. Equation (9.6) allows many series to be re-expressed as irregular continued

5 9.2 Euler continued fraction 65 fractions. For example, with a 0 = 0, a = z, a 2 = z 2 /3, a 3 = 3z 2 /5,..., we find that arctan z = z z3 3 + z5 5 z7 7 + z9 9 (9.7) with z, can be expressed as an irregular continued fraction due to Euler: arctan z = z + z2 3 z 2 + 9z2 5 3z z2 7 5z 2 +. When z =, this becomes what is now viewed as the first infinite continued fraction, given by Lord Brouncker ( ): 4 π = (9.8) Brouncker intuited this result from Stirling s work on the factorial. Legitimate the derivation of Brouncker s irregu- Exercise 9.7 (see also [74]) lar fraction (9.8) for 4/π. Furthermore, since arctan z = log( + iz) log( iz), 2i we also obtain a variant of Euler s continued fraction for log ( ( + z)/( z) ). Exercise 9.8 ([74]) Find the value of the continued fraction While elegant, Euler s continued fraction is much less useful than that of Gauss, to which we now turn.

6 66 Irregular continued fractions 9.3 Gauss continued fraction for the hypergeometric function A classical result on an irregular continued fraction for the so-called hypergeometric function goes back to Gauss. The function is defined by the series F(a, b; c; z) = where the notation n=0 (a) n (b) n z n n!(c) n = + a b a(a + ) b(b + ) z + z 2 c 2 c(c + ) a(a + )(a + 2) b(b + )(b + 2) + z 3 +, 2 3 c(c + )(c + 2) (a) n = Γ(a + n) Γ(a) = a(a + ) (a + n ) stands for the Pochhammer symbol (or shifted factorial; note that () n = n!). It is not hard to check that the series converges for z <. Among the many properties possessed by the function F(z) = F(a, b; c; z), the fact that it satisfies a second-order linear homogeneous differential equation, z( z) d2 F dz 2 + (c (a + b + ) z)df abf = 0, dz is crucial. Using this relation one can efficiently construct the analytic continuation of the function F(z), originally defined by the series above, to the whole complex plane with a branch cut along the real ray [, ). An important feature of the hypergeometric function (and its generalisations) is that it encompasses many other functions, including elementary ones, as either special or limiting cases. For example, log( + z) = zf(, ; 2; z), ( + z) a = F(a, b; b; z), e z = lim b F(, b;, z/b), arcsin z = zf(/2, /2; 3/2; z 2 ) and arctan z = zf(, /2; 3/2; z 2 ). Lemma 9.9 The following contiguous relation holds: F(a, b; c; z) F(a +, b; c + ; z) = (a c)b zf(a +, b + ; c + 2; z). (9.9) c(c + )

7 9.3 Gauss continued fraction for the hypergeometric function 67 Proof Indeed, we have F(a, b; c; z) F(a +, b; c + ; z) (a) n (b) ( n c + n = n!(c + ) n c = = = n=0 n= m=0 a + n a (a) n (b) n (a c)n z n n!(c + ) n ac (a) m+ (b) m+ a c m!(c + ) m+ ac z m+ (a c)bz c(c + ) m=0 ) z n (a + ) m (b + ) m m!(c + 2) m z m. Note that, because of the symmetry between a and b in the hypergeometric function F(a, b; c; z), we also obtain from (9.9) another contiguous relation: F(a, b; c; z) F(a, b + ; c + ; z) = Theorem 9.0 (Gauss continued fraction) F(a +, b; c + ; z) cf(a, b; c; z) = c + λ 0z c + + a(b c) zf(a +, b + ; c + 2; z). (9.0) c(c + ) We have λ z c where λ 2k = (a + k)(b c k) and λ 2k = (a c k)(b + k). λ n z c + n + +, (9.) Proof For k = 0,, 2,..., define F 2k (z) = F(a + k, b + k; c + 2k; z) and Then F 2k+ (z) = F(a + k +, b + k; c + 2k + ; z). (a c k)(b + k) F 2k (z) F 2k+ (z) = (c + 2k)(c + 2k + ) zf 2k+2(z), F 2k (z) F 2k (z) = (a + k)(b c k) (c + 2k )(c + 2k) zf 2k+(z), by the contiguous relations (9.9) and (9.0), respectively. Therefore F n+ (z) F n (z) = + λ n z (c + n)(c + n + ), F n+2 (z) F n+ (z)

8 68 Irregular continued fractions where λ 2k = (a c k)(b + k) and λ 2k = (a + k)(b c k), so that F (z) F 0 (z) = + λ0z c(c+) + λ z (c+)(c+2) + + λ n z (c+n)(c+n+) +. It remains to pass to the equivalent continued fraction by taking c n = c + n for n =, 2,... in the notation of Theorem 9.5. Our derivation of the Gauss continued fraction follows the lines of Section 2.0, where we derived a continued fraction for a confluent hypergeometric function, also known as Bessel s function. By taking the limit a 0 in (9.) and specialising to c = b, we obtain the continued fraction z n F(, b; b + ; z) = b + n b n=0 = b + λ 0 z b + + λ z b λ nz b + n + +, (9.2) where λ 2k = k2 and λ 2k = (b + k)2 ; this can be used to construct continued fractions for log( + z) = zf(, ; 2; z) and arctan z = zf(, /2; 3/2; z 2 ), as well as for the tails of their power series. Theorem 9. Proof and N log( + z) For N =, 2,..., we have n= N arctan z Use n=0 ( ) n z n n ( ) n z 2n+ 2n + N log( + z) N arctan z n=0 n= ( ) n z 2n+ 2n + = ( )N z N N + (N + )2 z N + 3 = ( )N z 2N+ 2N + + (2N + 3)2 z 2 2N + 7 ( ) n z n n + N2 z N z N z N + 4 +, (9.3) + (2N + )2 z 2 2N z 2 2N z 2 2N (9.4) = zn F(, N; N + ; z) N = z2n+ F(, N + /2; N + 2/2; z 2 ) 2(N + /2)

9 9.4 Ramanujan s AGM continued fraction 69 together with the continued fraction (9.2). Note that further specialisation to z = in (9.4) leads to a continued fraction for the tail of the approximation of π/4 by Gregory s series: π N 4 ( ) n 2n + = ( )N (2N + )2 + 2N + 2N N + 5 n=0 while its special case N = 0 gives + π = n 2 (2N + 3)2 2N N + 9 +, (9.5) 2n + +. (9.6) The estimates given in [25, Theorem 4] show that, for large b and z from the range z < 0, the quality of approximation of the hypergeometric value by the nth convergent from (9.2) is roughly bounded by (z/(z )) n. The estimate is applicable in the case of (9.5), thus showing that the convergents to the continued fraction can be used to accelerate the convergence of Gregory s series. Note that the paper [25] discusses an interesting phenomenon concerning the tail (9.5) of Gregory s series, which relates to its asymptotic power series in /N as N. Finally, we mention that, on using the Nth convergent of the continued fraction in (9.3) for z =, it is possible to demonstrate that the resulting rational approximations to log 2 are sufficient for proving the irrationality of the number (using Theorem.34) as well as for producing a bound for its irrationality exponent (using Theorem.35). We will not pursue this topic further here, but the idea is developed by M. Prévost in [37] for irrationality proofs of the constants ζ(2) and ζ(3). 9.4 Ramanujan s AGM continued fraction In this section we give a taste of Ramanujan s AGM continued fraction; the more famous Rogers Ramanujan continued fraction is discussed in the chapter notes. The substantial technical details can be found in the papers [26, 27, 9] and [02]. In [26, 27] one of the present authors considered the arithmetic-geometric mean (AGM) fraction, found in Chapter 8 of Ramanujan s second notebook

10 70 Irregular continued fractions [3]. For a, b, η > 0 we have a R η (a, b) = b 2 η + 4a 2 η + η + 9b2 η +..., (9.7) one of whose remarkable properties is a formal AGM relation that is known to be true at least for positive real a, b: ( a + b R 2, ) ab = R (a, b) + R (b, a). (9.8) 2 However, this relation is of dubious validity for general complex parameters [26] despite claims in the literature. Note that R η (a, b) = R (a/η, b/η) and that validity of (9.8) depends only on the ratio a/b, which can be thought as a point of the extended complex field C = C { }. Figure 9. Cardioid on whose complement (shaded) AGM relation (9.8) holds. Work in [27] focused on the convergence domain It was proved therein that, with D 0 = { (a, b) C 2 : R (a, b) converges on C }. D = {(a, b) C 2 : a b } {(a, b) C 2 : a 2 = b 2 (, 0)}, we have D D 0, so that the Ramanujan continued fraction converges for almost all complex pairs (a, b). The article [9] showed that D = D 0. Equivalently, the fraction R diverges whenever 0 a = be iϕ with cos 2 ϕ or a 2 = b 2 (, 0). It was also shown that remarkable and explicit chaotic dynamics occur on the imaginary axis, say for R (i, i ). Key to all this analysis is

11 9.4 Ramanujan s AGM continued fraction 7 the following theorem, whose components date back to the nineteenth century. The notation ϑ 2 (q) = q k2 /4 = 2q /4 q n(n+), ϑ 3 (q) = q k2 /4 = + 2 q n2 k Z k odd n=0 stands for the classical theta (null) functions [66]. Theorem 9.2 ([26, 9]) function parametrisations η k Z k odd η k Z k even k Z k even n= For real y, η > 0 and q = e πy, we have the theta sech(kπy/2) η 2 + k 2 sech(kπy/2) η 2 + k 2 = R η (ϑ 2 2 (q), ϑ2 3 (q)), = R η (ϑ 2 3 (q), ϑ2 2 (q)). Moreover, the equality (9.8) holds when a/b belongs to the closed exterior of the cardioid knot shown in Figure 9., which in polar coordinates is given by r 2 + (2 cos ϕ 4)r + = 0. Interpreting Theorem 9.2 as giving a Riemann integral in the limit b a (for a > 0), gives a slew of relations involving the psi or digamma function ψ(z) = d log Γ(z), dz the hypergeometric function and the Gauss continued fraction (see Section 9.3). Corollary 9.3 ([26]) For all a > 0, sech(πx/(2a)) R (a, a) = dx 0 + x 2 ( ) k+ = 2a + (2k )a k= = ( ( 3 ψ 2 4 4a) + ( ψ 4 4a)) + = 2a ( + a F 2a + 2, ; 2a + 3 ) 2 ; = 2 = 0 0 t /a + t 2 dt e x/a sech x dx.

12 72 Irregular continued fractions No closed form is known for any case with a b. In [29, 30] various extensions were studied and fractions with period 3 and other features were elaborated. Exercise 9.4 Derive a restricted parametrised form of (9.8) from Theorem 9.2 (as q q 2 ). Exercise 9.5 Derive Corollary 9.3 from Theorem 9.2. Hint The expressions are listed in an order suited to proving each expression from the previous one. Exercise 9.6 ([26]) Use Corollary 9.3 to determine that R (, ) = log 2 and R (/2, /2) = 2 π/2. Obtain for positive integers p, q that R ( p q, p q ) p+q = 2p 2 + 2π n= 0<k<2p k odd 0<k<2p k odd ( ) δn p+q (mod 4p) δ n 3p+q (mod 4p) n ) cos (p + q)kπ 2p ( 2 k 4p where δ X denotes the indicator of set X. ) sin ( log 2 sin kπ 4p (p + q)kπ, 2p The convergence of (9.7) is slowest at an arithmetic rate when a = b. The key to analysing the AGM fraction is the replacement of the irregular fraction by a reduced continued fraction, in which, as observed earlier, we have the same form as in a regular fraction except that we require that a n be real or complex. Exercise 9.7 where Show that for all a, b we have a R (a, b) = [a, a 2,..., a n,... ], a n = n!2 bn 4 n (n/2)! 4 a n 2 b n πn a n for even n, ((n )/2)!4 n an a n = 4 n! 2 b π a n n+ 2abn b n for odd n, and so the series n= a n diverges. Now, the Seidel Stern theorem [82, 03] asserts that for reduced fractions with positive terms the sum diverges iff the fraction converges. This shows that for real a, b > 0 the continued fraction R (a, b) converges.

13 9.5 An irregular continued fraction for ζ(2) = π 2 /6 73 Effective algorithms for computing (9.7) in the full complex plane are given in [26, 27]. They produce D good digits for O(D) operations where the order constant D is independent of a, b, η. 9.5 An irregular continued fraction for ζ(2) = π 2 /6 Recall the definition of the Riemann zeta function from (.8). In this section we will construct an irregular continued fraction for the number ζ(2) = n= n 2. The fact that ζ(2) = π 2 /6 is known from analysis. For example, it follows from the Fourier expansion of the function x 2 or from the product formula for the function sin x; see [57, 28]. Exercise 9.8 ([28]) Show by elementary methods that ( n= ( ) n ) 2 = 2n + Deduce from this that ζ(2) = π 2 /6. Hint δ N = Let N m,n= N ( ) n+m N (2n + )(2m + ) k= N Show that ε N /(N n + ), while δ N = N m,n= N m n n= (2n + ) 2. (2k + ) 2 and ε N = For each n = 0,, 2,..., define the rational function and consider the quantity N m,n= N m n m n. ( ) n+m (2n + )(m n) 0. R n (t) = ( ) n n! n j= (t j) nj=0 (t + j) 2 r n = R n (ν). The latter series converges (absolutely), since R n (t) = O(t 2 ) as t. ν=

14 74 Irregular continued fractions Lemma 9.9 The following representation holds: where q n = r n = q n ζ(2) p n, n = 0,, 2,..., ( Rn (t)(t + k) 2) t= k Q and p n Q, n = 0,, 2,... In addition, for n = 0 and n = we have r 0 = ζ(2) and r = 3ζ(2) 5, that is, p 0 = 0, q 0 = and p = 5, q = 3. Proof First, consider the particular cases n = 0 and n =. For n = 0 we have R 0 (t) = /t 2, and hence r 0 = R 0 (ν) = ζ(2). ν= For n = we decompose the function R (t) into a sum of partial fractions: Thus, R (t) = t t 2 (t + ) 2 = t (t + ) 2 3 t + 3 t +. ( r = R (ν) = t (t + ) 3 2 t + 3 ) t + ν= ν= = ν + 2 ( 2 ν ν + 3 ) ν ν= ν=2 ν= = ζ(2) + 2(ζ(2) ) 3 = 3ζ(2) 5. In the general case, let us replace the quantity r n with the power series r n (z) = R n (ν) z ν, ν= which converges at z = by the argument indicated above. The partial-fraction decomposition of R n (t) is as follows: R n (t) = ( A k (t + k) 2 + B k t + k where A k and B k are certain rational numbers. For the moment, we need explicit formulae for the coefficients A k = ( R n (t)(t + k) 2) t= k, k = 0,,..., n, ),

15 only. We obtain where 9.5 An irregular continued fraction for ζ(2) = π 2 /6 75 r n (z) = R n (ν) z ν = ν= ν= ν= A k z ν (ν + k) + 2 ν= = A k z k z ν+k (ν + k) + B 2 k z k = ( A k z k = A(z) = A(z) A(z) = l= l= l= z l k l 2 l= z l l + B(z) 2 l= z l l z l ) + l 2 ν= B k z ν ν + k z ν+k ν + k ( B k z k C(z) z l l 2 + B(z)( log( z) ) C(z), A k z k Q[z ], B(z) = C(z) = A k z k k z l l + B 2 k z k l= l= z l l k l= B k z k Q[z ], k l= z l l Q[z ]. Since the power series r n (z) converges at z =, we can use Abel s theorem, which says that the right-hand side of the resulting series r n (z) has a finite limit r n as z. In particular, this means that B() = 0 and r n = r n () = A()ζ(2) C(). It remains to take q n = A() = n A k and p n = C(). Note that the function R n+ (t)/r n (t) is a rational function not only of the parameter t but also of n. Let us define another (rational) function S n (t) = s n (t)r n (t), where z l ) l s n (t) = n 2 + 9n (2n + )t t 2. (9.9) Lemma 9.20 For each integer n =, 2,..., the following identity holds: (n + ) 2 R n+ (t) (n 2 + n + 3)R n (t) n 2 R n (t) = S n (t + ) S n (t). (9.20) Proof Since R n (t) R n (t) S n (t + ) R n (t) (t + n)2 = n(t n), = S n(t + ) R n (t + ) R n (t + ) R n (t) R n+ (t) R n (t) (n + )(t n ) =, (t + n + ) 2 t 3 = s n (t + ) (t n)(t + n + ), 2

16 76 Irregular continued fractions the proof is reduced to verification of the identity ( (n + ) 2 (n + )(t n ) ) ( (n 2 + n + 3) n 2 (t + ) n)2 (t + n + ) 2 n(t n) t 3 = s n (t + ) (t n)(t + n + ) s n(t), (9.2) 2 where the polynomial s n (t) is given in (9.9). Calculation shows that both sides of (9.2) are equal to ξ n (t) (t n)(t + n + ) 2 where ξ n (t) = nt 4 (7n 2 + 9n + 3)t 3 (6n n n + 7)t 2 + (7n n 3 + 3n 2 6n 2)t + (n 4 + 3n 3 + 3n 2 + 3n + 2)n. Theorem 9.2 The sequences (r n ) n=0, (q n) n=0 and (p n) n=0 recurrence relation each satisfy the (n + ) 2 r n+ (n 2 + n + 3)r n n 2 r n = 0, n =, 2,... (9.22) Proof We use the definition of r n and Lemma 9.20: thus, (n + ) 2 r n+ (n 2 + n + 3)r n n 2 r n ( = S n (t + ) S n (t) ) t=ν = S n () = s n () R n () = 0, ν= because R n () = 0 for n =, 2,... For the sequence of coefficients q n, we use the formula from the proof of Lemma 9.9: ( q n = Rn (t)(t + k) 2) t= k ( = Rn (t)(t + k) 2) t= k, where we have ( R n (t)(t + k) 2) t= k = 0 for k < 0 and k > n for trivial reasons. With the help of identity (9.20) we find that k Z (n + ) 2 q n+ (n 2 + n + 3)q n n 2 q n ( = (S n (t + ) S n (t))(t + k) 2) t= k k Z ( = (S n (l k + ) S n (l k))l 2) l=0 k Z ( = l 2 ( S n (l k + ) S n (l k) )) = 0 k Z l=0

17 9.5 An irregular continued fraction for ζ(2) = π 2 /6 77 for n = 0,, 2,..., since the inner sum over k telescopes. Finally, the sequence p n = q n ζ(2) r n satisfies the required recurrence as a linear combination (with constant coefficients) of the sequences q n and r n. Lemma 9.22 n. For all n = 0,, 2,... we have q n. Moreover, r n 0 as Proof From Lemma 9.9 we have q 0 = and q = 3 >. Hence an inductive argument gives us q n+ = (n2 + n + 3)q n + n 2 q n (n + ) 2 (n2 + n + 3) + n 2 (n + ) 2 > for n =, 2,... The fact that r n 0 as n (indeed, a stronger statement than that about the asymptotics of the quantities r n ) will be proved in the next section. As a consequence, we derive that p n = ζ(2) r n ζ(2) q n q n as n. (9.23) Thus, we have constructed a sequence of rational numbers (p n ) n=0 and (q n) n=0 that satisfy the recurrence relation P(n ) (n )2 p n = p n 2 n + p n 2 n 2, P(n ) (n )2 q n = q n 2 n + q n 2 n 2, where P(n) = n 2 + n + 3, for n = 2, 3,... Setting p =, q = 0 and taking into account that p 0 = 0, q 0 = and p = 5, q = 3, by Lemma 9.9, we conclude that p = 3p 0 + 5p, q = 3q 0 + 5q. We are now in a position to apply Theorem 9.. The continued fraction given by b a + b 2 a 2 + b 3 a b n a n +, P(n ) with a n = for n =, 2,..., n 2 b = 5, b n = (n )2 n 2 for n = 2, 3,..., (9.24) has (p n ) n= and (q n) n= as the sequences of numerators and denominators of its convergents; moreover, we have p n /q n ζ(2) as n by (9.23). Hence

18 78 Irregular continued fractions ζ(2) is the value of the continued fraction (9.24). Developing the equivalent transformation of the resulted continued fraction (see Theorem 9.5) with the choices c 0 = and c n = n 2 for n =, 2,..., we finally arrive at the continued fraction ζ(2) = b a + b 2 a + b 3 2 a + + b n 3 a + n with a n = P(n ) for n =, 2,..., b = 5, b n = (n ) 4 for n = 2, 3,... Let us summarise our findings in the following statement. Theorem 9.23 We have the following (irregular) continued fraction: where P(n) = n 2 + n + 3. ζ(2) = P() + 24 P(2) + + n4 P(n) +, Take the rational func- Exercise 9.24 (Irregular continued fraction for ζ(3)) tion nj= (t j) 2 R n (t) = nj=0 (t + j) 2 and, for each n = 0,, 2,..., consider the (absolutely convergent) series d R n (t) r n = dt. t=ν (a) Show that ν= r 0 = 2ζ(3) and r = 0ζ(3) 2. (b) Show that, for each n = 0,, 2,..., we have r n = q n ζ(3) p n, where p n and q n are rational numbers, q n > 0. (c) Define S n (t) = s n (t) R n (t), where Check that s n (t) = 4(2n + )( 2t 2 + t + (2n + ) 2 ). (n + ) 3 R n+ (t) (2n + )(7n 2 + 7n + 5) R n (t) + n 3 R n (t) for n =, 2,... = S n (t + ) S n (t) (9.25)

19 9.6 The irrationality of π 2 79 (d) Using (c), show that the sequences ( r n ) n=0, ( q n) n=0 and ( p n) n=0 each satisfy the recurrence relation (n + ) 3 r n+ (2n + )(7n 2 + 7n + 5) r n + n 3 r n = 0, n =, 2,... (9.26) (e) Assuming that r n 0 as n, prove the following continued fraction expansion for ζ(3): ζ(3) = Q() + 26 Q(2) + + n6 Q(n) +, where Q(n) = (2n + )(7n 2 + 7n + 5). 9.6 The irrationality of π 2 The aim of this final section is to prove that ζ(2) is irrational. Theorem 9.25 The number ζ(2) = π 2 /6 is irrational. The proof, which we present below, is based on the original construction of Apéry (who also proved the irrationality of ζ(3); see Exercises 9.24 and 9.30). However, our ideas considerably differ from those of Apéry. Note that the irrationality problem of the numbers ζ(5), ζ(7), ζ(9),... is not yet resolved. As in the previous section, to each n = 0,, 2,... we assign the rational function R n (t) = ( ) n n! n j= (t j) nj=0 (t + j) 2 and the corresponding quantity r n = R n (ν) = q n ζ(2) p n. ν= Let d n = lcm(, 2,..., n). The corollary of the prime number theorem (see Theorem.20) asserts that in other words, that d n grows with n as e n+o(n). log d n lim = ; (9.27) n n Lemma 9.26 The rational coefficients in the partial-fraction decomposition ( A k R n (t) = (t + k) + B ) k 2 t + k

20 80 Irregular continued fractions satisfy the inclusions A k Z and d n B k Z for k = 0,,..., n. Proof Write R n (t) as a product of two simpler rational functions, R (t) = n! nj=0 (t + j) = A k t + k and Then whence R (t) = ( )n n j= (t j) nj=0 (t + j) = ( ) A k = n! n ( ) k k!(n k)! = ( )k Z, k ( )( ) A k = (n + k)!/k! n n + k ( ) k k!(n k)! = ( )k Z, k k implying that R n (t) = R (t)r (t) = = A k A k (t + k) + 2 ( n A k = A k A k = k B k = l=0 l k A k A l A k A k (t + k) + 2 l=0 k l ) 2 ( n + k k A l A k l k, A k A ( l l k ), l=0 k l A k t + k. k = 0,,..., n, A k A l (t + k)(t + l) t + k t + l ), k = 0,,..., n. Since l k n in the last sum, the resulting formulae for A k and B k give us grounds for the required inclusions. Lemma 9.27 The rational coefficients of the linear form r n = q n ζ(2) p n satisfy q n Z and dn 2 p n Z. In other words, the sequence ( ) 2 ( ) n n + k q n =, n = 0,, 2,..., k k

21 9.6 The irrationality of π 2 8 which satisfies the recurrence relation (n + ) 2 q n+ (n 2 + n + 3)q n n 2 q n = 0, is integer-valued. Proof have In accordance with the formulae from the proof of Lemma 9.9, we q n = A k, p n = A k l= k l + 2 k B k l= l. Using the inclusions of Lemma 9.26 as well as d n k l= l Z and d2 n k l= Z for k = 0,,..., n, l2 we arrive at the desired claim. Lemma 9.28 For each n =, 2,..., the following estimate holds: 0 < r n < 7n 0 n. Proof Let us estimate the product M = m(m+) (m+n ) of n successive positive integers. As in the proof of Lemma 2.59, we have implying that m+n m log x dx < log M = m+n l=m log l < m+n m log x dx Thus, log M > (x log x x) m+n x=m = log (m + n )m+n e n (m ) m, log M < (x log x x) m+n x=m = log (m + n)m+n e n m m. n! < (n + )n+ e n, n j= n ν ν e n (ν j) < (ν n) ν n, j= (ν + j) > (ν + n)ν+n e n ν ν

22 82 Irregular continued fractions for ν n + ; hence where 0 < ( ) n (n + )n+ n n ν 3ν R n (ν) < ν 2 n n (ν n) ν n (ν + n) 2(ν+n) = n ( + ) n+ (ν/n) 3ν ν 2 n (ν/n ) ν n (ν/n + ) 2(ν+n) < 4n ( ν ) n ν f, 2 n f (x) = x 3x (x ) x (x + ) 2(x+). Let C stand for the maximum of the function f (x) in the interval x >. Then implying that 0 < ( ) n r n < 4nC n 0 < ( ) n R n (ν) < 4n ν 2 Cn, ν=n+ It remains to compute the maximum C. We have ν 2 4ζ(2)nCn < 7nC n. f (x) f (x) = d ( ) 3x log x (x ) log(x ) 2(x + ) log(x + ) dx x 3 = 3 log x log(x ) 2 log(x + ) = log (x )(x + ) ; 2 hence f (x) = 0 if x 3 = (x )(x + ) 2. A unique root of the latter quadratic equation x 2 + x + = 0 in the interval x > is equal to x 0 = ( + 5)/2. Therefore, C = f (x 0 ) = x 3x 0 0 (x 0 ) x 0 (x 0 + ) 2(x 0+) = x 0 (x 0 + ) 2 ( x 3 0 (x 0 )(x 0 + ) 2 ) x0 = ( + 5)/2 ( ( + 5)/2 + ) 2 = This completes our proof of the lemma. ( 5 ) 5 < 2 0. Remark 9.29 Dividing both sides of the linear recurrence relation of Theorem 9.2 by n 2, we see that the limiting form of the recurrence for the sequences (r n ) n=0, (q n) n=0 and (p n) n=0 is the difference equation r n+ r n r n = 0

23 9.6 The irrationality of π 2 83 with constant coefficients. By Theorem.27 a general solution of this equation has the form r n = c λ n + c 2λ n 2, where c, c 2 R, while λ = ( ( 5)/2 )5 and λ 2 = ( ( + 5)/2 )5 are the roots of characteristic polynomial λ 2 λ = 0. A consequence of the general formula for r n is the following limit: lim n n λ 2 if c 2 0; rn = λ if c 2 = 0 and c 0. Our original difference equation does not have constant coefficients, which constitutes a natural obstacle to obtaining a simple formula for a general solution. However, the limiting relation lim sup n n rn { λ, λ 2 } (9.28) continues to hold whenever r n is a nontrivial solution. This fact is a classical theorem from analysis due to Poincaré; its proof is not difficult but rather technical [66, Chapter V]. The reasonableness of Poincaré s theorem derives, in part, from its validity for difference equations with constant coefficients (which follows from Theorem.27). Elementary estimation shows that lim sup n n r n ; hence, using (9.28), we obtain lim sup n n r n = λ < /0. Thus, Poincaré s theorem could save us from the involved computation in the proof of Lemma Proof of Theorem 9.25 Suppose that, on the contrary, that ζ(2) = a/b, where a and b are certain positive integers. For each n = 0,, 2,..., the number r n = bd 2 n r n = ( ) n (d 2 n q n a d 2 n p n b) is an integer satisfying 0 < r n < 7nbd 2 n (/0) n. Clearly r n, while (9.27) yields 7nbd 2 n < 3 2n for all sufficiently large n. The resulting estimate r n < (9/0) n is a contradiction, and proves the theorem. Exercise 9.30 Assume the notation of Exercise (a) Show that, for each n = 0,,..., at least one of r n and r n+ is nonzero; in other words, the sequence ( r n ) n=0 is a nontrivial solution of the difference equation from Exercise 9.24(d). (b) Using Poincaré s theorem, verify that lim sup n n rn { ( 2 ) 4, ( 2 + ) 4}. (c) Show, by an elementary estimation, that r n < Cn for a certain constant C > 0.

24 84 Irregular continued fractions (d) Deduce from (a) (c) that lim sup n n rn = ( 2 ) 4 < (e) Show that the coefficients of the linear form r n = q n ζ(3) p n satisfy q n Z and d 3 n p n Z for n = 0,, 2,... (f) Deduce from (d) and (e) that ζ(3) is irrational. Notes Throughout this chapter and the rest of this book there lies an iceberg of computation, symbolic and numeric, most of which has not been directly exposed to the reader. The reader would be well advised to keep a computer algebra package open and to implement as much as she or he can! The writers certainly had to use such methods to check or develop many of the more subtle results presented in the book. One should not miss reading the historical-mathematical account of Apéry s proof [8] of the irrationality of ζ(2) and ζ(3) given by Alf van der Poorten in [27]. Our proofs in Sections 9.5 and 9.6 produce Apéry s rational approximations to ζ(2) (and ζ(3)) but use a somewhat different approach; see [6, 37] for other proofs. It is now apparent that the original construction of Apéry was highly influenced [7, 38] by a continued fraction given by Ramanujan. It should be mentioned that Ramanujan was an indefatigable producer of explicit and highly nontrivial continued fraction expansions, which one could easily classify as beautiful. Here we limit ourselves to recording the Rogers Ramanujan continued fractions: for q, R(q) = q /5 ( q 5n+ )( q 5n+4 ) ( q 5n+2 )( q 5n+3 ) = q /5 q, (9.29) + q q n=0 Then R() = φ, where φ is our old friend the golden ratio, see Exercise 2.3, and R(q) may be thought of as a q-analogue of the golden mean. Ramanujan showed that R(e π r ) is algebraic for each rational number r; Sloane s sequence A in [56] gives the exact values of r n = R(e π n )

25 for n 0. In particular, famously, r 2 = Notes We highly recommend to our readers that they browse through Berndt s edition of Ramanujan s notebooks [3] and the Andrews Berndt edition of Ramanujan s lost notebook [5] (see also [6]), since just listing Ramanujan s contributions to this particular subject deserves a separate volume. Turning to the end of Section 9.4, a recent unifying presentation on the more general Seidel Stern theorem and its relatives, where terms may be complex, is to be found in [2]. The basic building blocks are as follows, where Z n represents the nth partial quotient. Theorem 9.3 (The Seidel Stern theorem, 846) If each a n is positive then the sequences Z 2n and Z 2n+ are monotonic and convergent. If, in addition, n a n diverges then Z n converges. Theorem 9.32 (The Stern Stolz theorem, 860) If Z n converges then n a n diverges. Theorem 9.33 (Van Vleck s theorem, 90) Suppose that 0 θ < π/2 and that arg(b n ) θ whenever a n 0. Then the sequences Z 2n and Z 2n+ converge. Further, Z n converges if and only if n a n diverges. Examples and pictures in [29, 30], and elsewhere, show the need for such restrictions to rule out period-3 and higher-period behaviour of the convergents. They are based on the irregular fraction S(b) given by S(b) = + 2 b b b (9.30) where the string (b n ) is periodic and is most interesting when all terms have the same modulus. The case of period 2 is the setting for Ramanujan s AGM fraction. It is convenient to set (9.30) obeys t n = q n /n!, where p n /q n is the nth partial convergent of S(b), so that t n = n t n + n b 2 n n t n 2. (9.3) For example, with b n of period 3 we obtain Figure 9.2 for (b, b 2, b 3 ) = ( exp(iπ/4), exp(iπ/4), exp(iπ/4 + / 2) ). (9.32)

26 86 Irregular continued fractions Note the scaling is that suggested by (9.28). Exercise 9.34 (Pictures for R) In the original Ramanujan fraction setting, draw graphs with b = b 2 = corresponding to that of Figure 9.2. You should see three cases depending on whether none, one or two of the parameters are roots of unity. However, in all cases the graphs produce points lying on two circles and look nothing like Figure 9.2. Figure 9.2 Dynamics for cycles of length 3. Shown are the iterates nt n for t n given by (9.3) with the choice (9.32). The odd iterates are light and the even iterates are dark. We remark that the magic appearance of the identities (9.20) and (9.25) is not accidental: the explicit form of the functions S n (t) and S n (t) is the output of the so-called algorithm of creative telescoping due to Gosper and Zeilberger, which can be found in [26]. The algorithm is implemented in some computer algebra systems, including Maple and Mathematica. It is interesting to note that recurrence equations like (9.22) and (9.26) encode a lot of number theory in addition to the material explored above. In recent years such Apéry-like difference equations and their generalisations have become a subject of independent interest [4, 7]. While the irrationality proof for ζ(2) prefigures that for ζ(3), the most direct proof of the irrationality of π is probably Ivan Niven s 947 short proof [20]. It illustrates well the ingredients of many more difficult proofs of the irrationality of other constants and indeed of Lindemann s proof of the transcendence of π, which builds on on Hermite s 873 proof of the transcendence of e. Theorem 9.35 ([20]) The number π is irrational. Proof Let π = a/b, the quotient of positive integers. We define the polynomials f (x) = x n (a bx) n /n! and F(x) = f (x) f (2) (x) + f (4) (x) + ( ) n f (2n) (x); the positive integer n will be specified later. Since n! f (x) has integral coefficients and terms in x of degree not less than n, the polynomial f (x) and its

27 Notes 87 derivatives f ( j) (x) have integral values for x = 0; also for x = π = a/b, since f (x) = f (a/b x). By elementary calculus we have and d dx (F (x) sin x F(x) cos x) = F (x) sin x + F(x) sin x = f (x) sin x π 0 f (x) sin x dx = ( F (x) sin x F(x) cos x ) π = F(π) + F(0). (9.33) 0 Now F(π)+ F(0) is an integer, since f ( j) (0) and f ( j) (π) are integers. But, for 0 < x < π, 0 < f (x) sin x < πn a n n!, so that the integral in (9.33) is positive but less than for sufficiently large n. Thus (9.33) is false, and so is our assumption that π is rational. This proof can be enhanced to cover ζ(2) as Niven did later [2]. There is a deep connection between the (classical) orthogonal polynomials with respect to a linear functional L: C[x] C and the continued fraction expansions of the generating function n=0 L(x n )z n for its moments; this has nontrivial applications to the evaluation of Kronecker Hankel determinants. We refer the interested reader to the highly accessible review [89] of this story (see also [50, pp. 9 99]).

Continued fractions for complex numbers and values of binary quadratic forms

Continued fractions for complex numbers and values of binary quadratic forms arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties

More information

Beukers integrals and Apéry s recurrences

Beukers integrals and Apéry s recurrences 2 3 47 6 23 Journal of Integer Sequences, Vol. 8 (25), Article 5.. Beukers integrals and Apéry s recurrences Lalit Jain Faculty of Mathematics University of Waterloo Waterloo, Ontario N2L 3G CANADA lkjain@uwaterloo.ca

More information

Considering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.

Considering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial. Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and

More information

Chapter 11 - Sequences and Series

Chapter 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 information

Mathematics 324 Riemann Zeta Function August 5, 2005

Mathematics 324 Riemann Zeta Function August 5, 2005 Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define

More information

The primitive root theorem

The primitive root theorem The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under

More information

NOTES ON IRRATIONALITY AND TRANSCENDENCE

NOTES ON IRRATIONALITY AND TRANSCENDENCE NOTES ON IRRATIONALITY AND TRANSCENDENCE Frits Beukers September, 27 Introduction. Irrationality Definition.. Let α C. We call α irrational when α Q. Proving irrationality and transcendence of numbers

More information

Irrationality proofs, moduli spaces, and dinner parties

Irrationality proofs, moduli spaces, and dinner parties Irrationality proofs, moduli spaces, and dinner parties Francis Brown, IHÉS-CNRS las, Members Colloquium 17th October 2014 1 / 32 Part I History 2 / 32 Zeta values and Euler s theorem Recall the Riemann

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS

More information

MS 3011 Exercises. December 11, 2013

MS 3011 Exercises. December 11, 2013 MS 3011 Exercises December 11, 2013 The exercises are divided into (A) easy (B) medium and (C) hard. If you are particularly interested I also have some projects at the end which will deepen your understanding

More information

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite

More information

Math Homework 2

Math Homework 2 Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

More information

Complex numbers, the exponential function, and factorization over C

Complex numbers, the exponential function, and factorization over C Complex numbers, the exponential function, and factorization over C 1 Complex Numbers Recall that for every non-zero real number x, its square x 2 = x x is always positive. Consequently, R does not contain

More information

1 Homework. Recommended Reading:

1 Homework. Recommended Reading: Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis

More information

Chapter One Hilbert s 7th Problem: It s statement and origins

Chapter One Hilbert s 7th Problem: It s statement and origins Chapter One Hilbert s 7th Problem: It s statement and origins At the second International Congress of athematicians in Paris, 900, the mathematician David Hilbert was invited to deliver a keynote address,

More information

Automatic Proofs of Identities: Beyond A=B

Automatic Proofs of Identities: Beyond A=B Bruno.Salvy@inria.fr FPSAC, Linz, July 20, 2009 Joint work with F. Chyzak and M. Kauers 1 / 28 I Introduction 2 / 28 Examples of Identities: Definite Sums, q-sums, Integrals n k=0 + 0 1 2πi n=0 ( ) H n

More information

Prime Numbers and Irrational Numbers

Prime Numbers and Irrational Numbers Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.

More information

Notes on uniform convergence

Notes on uniform convergence Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean

More information

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real

More information

Infinite Continued Fractions

Infinite 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 information

CONTINUED FRACTIONS Lecture notes, R. M. Dudley, Math Lecture Series, January 15, 2014

CONTINUED FRACTIONS Lecture notes, R. M. Dudley, Math Lecture Series, January 15, 2014 CONTINUED FRACTIONS Lecture notes, R. M. Dudley, Math Lecture Series, January 5, 204. Basic definitions and facts A continued fraction is given by two sequences of numbers {b n } n 0 and {a n } n. One

More information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

Lecture 9. = 1+z + 2! + z3. 1 = 0, it follows that the radius of convergence of (1) is.

Lecture 9. = 1+z + 2! + z3. 1 = 0, it follows that the radius of convergence of (1) is. The Exponential Function Lecture 9 The exponential function 1 plays a central role in analysis, more so in the case of complex analysis and is going to be our first example using the power series method.

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

Solutions to Practice Final

Solutions to Practice Final s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (

More information

Bernoulli Numbers and their Applications

Bernoulli 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 information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Algorithms: Background

Algorithms: 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 information

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 = Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values

More information

CHAPTER 4. Series. 1. What is a Series?

CHAPTER 4. Series. 1. What is a Series? CHAPTER 4 Series Given a sequence, in many contexts it is natural to ask about the sum of all the numbers in the sequence. If only a finite number of the are nonzero, this is trivial and not very interesting.

More information

Notes on Complex Analysis

Notes on Complex Analysis Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................

More information

are the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).

are 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 information

Analytic Number Theory Solutions

Analytic Number Theory Solutions Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.

More information

Irrationality exponent and rational approximations with prescribed growth

Irrationality exponent and rational approximations with prescribed growth Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

Mathematics 228(Q1), Assignment 2 Solutions

Mathematics 228(Q1), Assignment 2 Solutions Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k

More information

(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.

(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2. 1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of

More information

q-series Michael Gri for the partition function, he developed the basic idea of the q-exponential. From

q-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 information

Elliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR

Elliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR Elliptic Curves & Number Theory R. Sujatha School of Mathematics TIFR Aim: To explain the connection between a simple ancient problem in number theory and a deep sophisticated conjecture about Elliptic

More information

1 Continued Fractions

1 Continued Fractions Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction

More information

Sequences of Real Numbers

Sequences of Real Numbers Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next

More information

Asymptotics of Integrals of. Hermite Polynomials

Asymptotics of Integrals of. Hermite Polynomials Applied Mathematical Sciences, Vol. 4, 010, no. 61, 04-056 Asymptotics of Integrals of Hermite Polynomials R. B. Paris Division of Complex Systems University of Abertay Dundee Dundee DD1 1HG, UK R.Paris@abertay.ac.uk

More information

Riemann sphere and rational maps

Riemann sphere and rational maps Chapter 3 Riemann sphere and rational maps 3.1 Riemann sphere It is sometimes convenient, and fruitful, to work with holomorphic (or in general continuous) functions on a compact space. However, we wish

More information

Chapter 2: Linear Independence and Bases

Chapter 2: Linear Independence and Bases MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space

More information

Needles and Numbers. The Buffon Needle Experiment

Needles and Numbers. The Buffon Needle Experiment eedles and umbers This excursion into analytic number theory is intended to complement the approach of our textbook, which emphasizes the algebraic theory of numbers. At some points, our presentation lacks

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 998 Comments to the author at krm@mathsuqeduau All contents copyright c 99 Keith

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can

More information

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES You will be expected to reread and digest these typed notes after class, line by line, trying to follow why the line is true, for example how it

More information

Week 2: Sequences and Series

Week 2: Sequences and Series QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime

More information

Lecture 3. Frits Beukers. Arithmetic of values of E- and G-function. Lecture 3 E- and G-functions 1 / 20

Lecture 3. Frits Beukers. Arithmetic of values of E- and G-function. Lecture 3 E- and G-functions 1 / 20 Lecture 3 Frits Beukers Arithmetic of values of E- and G-function Lecture 3 E- and G-functions 1 / 20 G-functions, definition Definition An analytic function f (z) given by a powerseries a k z k k=0 with

More information

arxiv: v6 [math.nt] 12 Sep 2017

arxiv: v6 [math.nt] 12 Sep 2017 Counterexamples to the conjectured transcendence of /α) k, its closed-form summation and extensions to polygamma functions and zeta series arxiv:09.44v6 [math.nt] Sep 07 F. M. S. Lima Institute of Physics,

More information

Chapter 8. P-adic numbers. 8.1 Absolute values

Chapter 8. P-adic numbers. 8.1 Absolute values Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.

More information

CHAPTER 3. Sequences. 1. Basic Properties

CHAPTER 3. Sequences. 1. Basic Properties CHAPTER 3 Sequences We begin our study of analysis with sequences. There are several reasons for starting here. First, sequences are the simplest way to introduce limits, the central idea of calculus.

More information

2 Complex Functions and the Cauchy-Riemann Equations

2 Complex Functions and the Cauchy-Riemann Equations 2 Complex Functions and the Cauchy-Riemann Equations 2.1 Complex functions In one-variable calculus, we study functions f(x) of a real variable x. Likewise, in complex analysis, we study functions f(z)

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

Introduction to Abstract Mathematics

Introduction to Abstract Mathematics Introduction to Abstract Mathematics Notation: Z + or Z >0 denotes the set {1, 2, 3,...} of positive integers, Z 0 is the set {0, 1, 2,...} of nonnegative integers, Z is the set {..., 1, 0, 1, 2,...} of

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

More information

PRIME NUMBERS YANKI LEKILI

PRIME 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 information

1 Prologue (X 111 X 14 )F = X 11 (X 100 X 3 )F = X 11 (X 200 X 6 ) = X 211 X 17.

1 Prologue (X 111 X 14 )F = X 11 (X 100 X 3 )F = X 11 (X 200 X 6 ) = X 211 X 17. Prologue In this chapter we give a couple of examples where the method of auxiliary polynomials is used for problems that have no diophantine character. Thus we are not following Sam Goldwyn s advice to

More information

INTRODUCTION TO REAL ANALYTIC GEOMETRY

INTRODUCTION TO REAL ANALYTIC GEOMETRY INTRODUCTION TO REAL ANALYTIC GEOMETRY KRZYSZTOF KURDYKA 1. Analytic functions in several variables 1.1. Summable families. Let (E, ) be a normed space over the field R or C, dim E

More information

Moreover this binary operation satisfies the following properties

Moreover this binary operation satisfies the following properties Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

NORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY

NORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY NORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY Introduction In a first course on algebraic number theory, a typical homework problem may possibly ask the student to determine the class group of a quadratic

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

On The Weights of Binary Irreducible Cyclic Codes

On The Weights of Binary Irreducible Cyclic Codes On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:

More information

ζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1.

ζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1. Problem Sheet 3. From Theorem 3. we have ζ (s) = + s s {u} u+sdu, (45) valid for Res > 0. i) Deduce that for Res >. [u] ζ (s) = s u +sdu ote the integral contains [u] in place of {u}. ii) Deduce that for

More information

7 Asymptotics for Meromorphic Functions

7 Asymptotics for Meromorphic Functions Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

An Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010

An Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010 An Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010 John P. D Angelo, Univ. of Illinois, Urbana IL 61801.

More information

1. Introduction This paper investigates the properties of Ramanujan polynomials, which, for each k 0, the authors of [2] define to be

1. Introduction This paper investigates the properties of Ramanujan polynomials, which, for each k 0, the authors of [2] define to be ZEROS OF RAMANUJAN POLYNOMIALS M. RAM MURTY, CHRIS SMYTH, AND ROB J. WANG Abstract. In this paper, we investigate the properties of Ramanujan polynomials, a family of reciprocal polynomials with real coefficients

More information

ON THE LINEAR INDEPENDENCE OF THE SET OF DIRICHLET EXPONENTS

ON THE LINEAR INDEPENDENCE OF THE SET OF DIRICHLET EXPONENTS ON THE LINEAR INDEPENDENCE OF THE SET OF DIRICHLET EXPONENTS Abstract. Given k 2 let α 1,..., α k be transcendental numbers such that α 1,..., α k 1 are algebraically independent over Q and α k Q(α 1,...,

More information

SOME 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. 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 information

Complex Continued Fraction Algorithms

Complex Continued Fraction Algorithms Complex Continued Fraction Algorithms A thesis presented in partial fulfilment of the requirements for the degree of Master of Mathematics Author: Bastiaan Cijsouw (s3022706) Supervisor: Dr W Bosma Second

More information

COMPLEX NUMBERS AND SERIES

COMPLEX NUMBERS AND SERIES COMPLEX NUMBERS AND SERIES MIKE BOYLE Contents 1. Complex Numbers 1 2. The Complex Plane 2 3. Addition and Multiplication of Complex Numbers 2 4. Why Complex Numbers Were Invented 3 5. The Fundamental

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES 11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES Infinite sequences and series were introduced briefly in A Preview of Calculus in connection with Zeno s paradoxes and the decimal representation

More information

MORE CONSEQUENCES OF CAUCHY S THEOREM

MORE CONSEQUENCES OF CAUCHY S THEOREM MOE CONSEQUENCES OF CAUCHY S THEOEM Contents. The Mean Value Property and the Maximum-Modulus Principle 2. Morera s Theorem and some applications 3 3. The Schwarz eflection Principle 6 We have stated Cauchy

More information

Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011)

Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Before we consider Gelfond s, and then Schneider s, complete solutions to Hilbert s seventh problem let s look back

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 13 Sequences and Series of Functions These notes are based on the notes A Teacher s Guide to Calculus by Dr. Louis Talman. The treatment of power series that we find in most of today s elementary

More information

Math 314 Course Notes: Brief description

Math 314 Course Notes: Brief description Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be

More information

8.6 Partial Fraction Decomposition

8.6 Partial Fraction Decomposition 628 Systems of Equations and Matrices 8.6 Partial Fraction Decomposition This section uses systems of linear equations to rewrite rational functions in a form more palatable to Calculus students. In College

More information

Power series and Taylor series

Power 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 information

Section 8.2: Integration by Parts When you finish your homework, you should be able to

Section 8.2: Integration by Parts When you finish your homework, you should be able to Section 8.2: Integration by Parts When you finish your homework, you should be able to π Use the integration by parts technique to find indefinite integral and evaluate definite integrals π Use the tabular

More information

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1. Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence

More information

The arithmetic geometric mean (Agm)

The arithmetic geometric mean (Agm) The arithmetic geometric mean () Pictures by David Lehavi This is part of exercise 5 question 4 in myc> calculus class Fall 200: a = c a n+ =5a n 2 lim n an = a = a an + bn a n+ = 2 b = b b n+ = a nb n

More information

Additional material: Linear Differential Equations

Additional material: Linear Differential Equations Chapter 5 Additional material: Linear Differential Equations 5.1 Introduction The material in this chapter is not formally part of the LTCC course. It is included for completeness as it contains proofs

More information

MTH 299 In Class and Recitation Problems SUMMER 2016

MTH 299 In Class and Recitation Problems SUMMER 2016 MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation

More information

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31 Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

Metric Spaces and Topology

Metric Spaces and Topology Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

More information

1 Lecture 1 (1/5/2009)

1 Lecture 1 (1/5/2009) 1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think

More information

1 Lecture 1 (1/5/2009)

1 Lecture 1 (1/5/2009) 1 Lecture 1 (1/5/2009) Notation 1.1 Introduce N := {0, 1, 2,... }, Z, Q, R, and C. Also let Z + := N \ {0}. Set notations. Recalled basic notions of a function being one to one, onto, and invertible. Think

More information

Standard forms for writing numbers

Standard forms for writing numbers Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,

More information

2.1 Convergence of Sequences

2.1 Convergence of Sequences Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written

More information

Constructions with ruler and compass.

Constructions with ruler and compass. Constructions with ruler and compass. Semyon Alesker. 1 Introduction. Let us assume that we have a ruler and a compass. Let us also assume that we have a segment of length one. Using these tools we can

More information

9. Series representation for analytic functions

9. Series representation for analytic functions 9. Series representation for analytic functions 9.. Power series. Definition: A power series is the formal expression S(z) := c n (z a) n, a, c i, i =,,, fixed, z C. () The n.th partial sum S n (z) is

More information

SCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING. Self-paced Course

SCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING. Self-paced Course SCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING Self-paced Course MODULE ALGEBRA Module Topics Simplifying expressions and algebraic functions Rearranging formulae Indices 4 Rationalising a denominator

More information

Modified Bessel functions : Iα, Kα

Modified Bessel functions : Iα, Kα Modified Bessel functions : Iα, Kα The Bessel functions are valid even for complex arguments x, and an important special case is that of a purely imaginary argument. In this case, the solutions to the

More information