# SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES THOMAS SCHMELZER AND ROBERT BAILLIE 1 Abstract The harmonic series diverges But if we delete from it all terms whose denominators contain any string of digits such as 9, 42, or , then the sum of the remaining terms converges These series converge far too slowly to compute their sums directly We describe an algorithm to compute these and related sums to high precision For example, the sum of the series whose denominators contain no is approximately We explain why this sum is so close to 10 6 log 10 by developing asymptotic estimates for sums that omit strings of length n, as n approaches infinity The harmonic series 2 Introduction and History s=1 diverges Suppose we delete from the series all terms whose denominators, in base 10, contain the digit 9 (that is, 1/9, 1/19, 1/29, ) Kempner [12] proved in 1914 that the sum of the remaining terms converges At first glance, this is counter-intuitive because it appears that we are removing only every tenth term from the harmonic series If that were the case, then the sum of the remaining terms would indeed diverge This series converges because in the long run, we in fact delete almost everything from it We begin by deleting 1/9, 1/19, 1/29, But when we reach 1/89, we delete 11 terms in a row: 1/89, then 1/90 through 1/99 When we reach 1/889, we delete 111 terms in a row: 1/889, then 1/890 through 1/899, and finally 1/900 through 1/999 Moreover, the vast majority of integers of, say, 100 digits contain at least one 9 somewhere within them Therefore, when we apply our thinning process to 100-digit denominators, we will delete most terms Only /( ) 0003% of terms with 100-digit denominators will survive our thinning process Schumer [13] argues that the Key words and phrases harmonic series, convergent subseries, directed graphs, nonnegative matrices, Perron-Frobenius Theorem, power iteration The first author is supported by a Rhodes Scholarship 1 1 s

2 2 THOMAS SCHMELZER AND ROBERT BAILLIE problem is that we tend to live among the set of puny integers and generally ignore the vast infinitude of larger ones How trite and limiting our view! To be more precise: The fractions p i of i-digit numbers not containing 9 or an alternative single digit are a geometric decaying sequence In addition the sum of reciprocals of all i-digit numbers is smaller than 9 (see also Equation (3)) The sum of reciprocals of the survivors amongst them is bounded by 9 p i Summing over all i results in a convergent sequence that serves as an upper bound for the sum of the harmonic series missing 9 The proof for harmonic series missing any given n-digit integer b 0 carries over Here it is enough to construct an upper bound for the fractions not containing b by dividing the i-digit integers into substrings of length n and use the same argument For example the fraction p 6 of 6-digit numbers not containing 15 is bounded by 89/90 (99/100) 2 as we have divided the 6-digit numbers in 3 substrings of length 2 Once a series is known to converge, the natural question is, What is its sum? Unfortunately, these series converge far too slowly to compute their sums directly [11, 12] The problem has attracted wide interest through the years in books such as [1, p 384], [4, pp 81 83], [8, pp ] and [9, pp 31 34] The computation of these sums is discussed in [2], [6] and [17] Fischer computed 100 decimals of the sum with 9 missing from the denominators, but his method does not readily generalize to other digits His remarkable result is that the sum is β 0 ln10 10 n β n 1 ζ(n) where β 0 = 10 and the remaining β n values are given recursively by ( ) n n (10 n k+1 10 k + 1)β n k = 10(11 n 10 n ) k k=1 n=2 Trott [16, pp ] has implemented Fischer s algorithm using MATHEMATICA In 1979, Baillie [2] published a method for computing the ten sums that arise when we delete terms containing each of the digits 0 through 9 The sum with 9 deleted is about But the sum of all terms with denominators up to still differs from the final sum by more than 1 In order to compute sums whose denominators omit strings of two or more digits, we must generalize the algorithm of [2] We do that here We will show how to compute sums of 1/s where s contains no odd digits, no even digits, or strings like 42 or or even combinations of those constraints Recently the problem has attracted some interest again The computation of the sum of 1/s where s does not contain 42 is a problem suggested by Bornemann et al [5, p 281]

3 SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES 3 Subsequently the problems related to those sums have been discussed in a Germanspeaking online mathematics forum 1 In 2005 Bornemann presented his solution for the 42 -problem to Trefethen s problem solving squad at Oxford His idea is very similar to the original approach of Baillie and is covered by our analysis Bold print indicates vectors, matrices or tensors Sets are in calligraphic print 3 Recurrence matrices Let X be a string of n 1 digits Let S be the set of positive integers that do not contain X in base 10 We denote the sum by Ψ, that is, (1) Ψ = s S If X is the single digit m, Baillie s method partitions S into subsets S i The i th subset consists of those elements of S that have exactly i digits The following recurrence connects S i to S i+1 : S i+1 = s S i {10s, 10s + 1, 10s + 2,, 10s + 9}\{10s + m} From this, a recurrence formula is derived that allows us to compute s S i+1 1/s k from the sums s S i 1/s k If n > 1, there is no simple recurrence relation between S i and S i+1 However, we can further partition S i into subsets for j = 1, 2,, n in a way that yields a recurrence between S j i+1 and the sets S1 i,, Sn i Once we have done this, we have Ψ = n j=1 1 s i=1 s S j i The subsets are chosen so that, when we append a digit d to an element of S j i, we get an (i+1)-digit integer in the d th j subset of S i+1, that is, S d j i+1 It will also be convenient to let S j be the union of S j i, over all i We will represent the partition and the corresponding recurrence with an n 10 matrix T The (j, d) entry of T tells us which set we end up in when we append the digit d to each element of S j If the digit d cannot be appended because the resulting number would not be in S, then we set T(j, d) to 0 Here is an example that shows how to compute the matrix T for a given string Let S be the set of integers containing no 314 We partition S into three subsets: S 1 consists of the elements of S not ending in 3 or 31 S 2 is the set of elements of S ending in 3 1 At a few participants discuss the computation of the sum of 1/n where n does not contain an even digit It seems their solution combines a direct summation and Richardson extrapolation and is of limited accuracy 1 s

4 4 THOMAS SCHMELZER AND ROBERT BAILLIE S 3 is the set of elements of S ending in 31 The following matrix T shows what happens when we append the digits 0 through 9 to S 1, S 2, and S T = When we append a 3 to an element of S 1, we get an element of S 2, so we set T(1, 3) = 2 Appending any other digit to an element of S 1 yields another element of S 1, so all other T(1, ) = 1 Consider elements of S 2 Appending a 1 yields an element of S 3 ; appending a 3 yields another element of S 2 Appending any other digit yields an element of S 1 The only special feature of S 3 is that if we append a 4, we get a number ending in 314, which is not in S, so we set T(3, 4) = 0 Let us emphasize that the matrix T does not have to be induced by a string X Indeed our approach is more general We can also solve a puzzle stated by Boas [3] asking 2 for an estimate of the sum of 1/s where s has no even digits Here it is enough to work with one set S but to forbid that an even integer can be attached Hence T is T = [ Many more interesting examples are discussed in Section 6 The recursive relations between the sets S 1,, S n may also be illustrated by means of a directed graph There is a directed edge from S i to S j if by appending an integer d to elements of S i we end up in S j, see Fig 1 For further analysis we assume only that the associated direct graph is strongly connected, that is, there are directed paths from S i to S j and S j to S i for any pair i j Graphs that are not strongly connected can be induced by more exotic constraints but are not discussed here In the next Section, we show how T is used to compute s S i+1 1/s k from the values of s S i 1/s k 4 A recurrence formula It may seem a bit odd to introduce sums of s k although only the case k = 1 is desired, but they enable us to exploit the recurrence relations between the aforementioned sets S 1,, S n The idea has been successfully applied in [2] Let (2) Ψ j i,k = s S j i 2 Actually Boas is pointing to problem 3555 published in School Science and Mathematics, April s k ]

5 SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES 5 S 2 S 2 S 1 S 1 S 3 S 3 Figure 1 Directed, strongly connected graphs Left: Graph for the partition induced by the string 314 Any other string with three distinct digits would have the same graph Right: Graph of the partition induced by the string 333 Note that the strings 332 and 323 would induce two alternative graphs not shown here The graph related to 233 would match the left graph Therefore the sum s k where s ranges over all i-digit integers is an upper bound for Ψ j i,k There are at most 10 i 10 i 1 of these integers Every such s is at least 10 i 1 Therefore, (3) Ψ j i,k ( 10 i 10 i 1) 1 10 (i 1)k = 9 10 (i 1)(k 1) Using the new notation the problem is to compute n Ψ = Ψ j i,1 j=1 The recursive nature of the sets S j i is now used to derive recurrence relations for the sums Ψ j i,k We introduce a tensor f of dimensions n n 10 with { 1 if T(l, m) = j (4) f jlm = 0 else This tells us in the sum below to either include a term (f jlm = 1) or not include it (f jlm = 0) Then (5) Ψ j i,k = 9 m=0 l=1 i=1 n f jlm s S l i 1 (10s + m) k By construction of f the sum runs over all index pairs (l, m) such that T(l, m) = j, which indicates that { 10s + m, s S l i 1 } S j i

6 6 THOMAS SCHMELZER AND ROBERT BAILLIE Although Equation (5) is the crucial link to the recurrence matrices it is of no computational use It is still a direct computation of Ψ j i,k We should avoid summing over a range of integers in subsets Si 1 l Using negative binomial series3 we observe ( ) (10s + m) k = (10s) k ( 1) w k + w 1 ( m ) w w 10s where 0 0 = 1 and define: w=0 c(k, w) = ( 1) w ( k + w 1 w We replace the term (10s + m) k in Equation (5) and get 9 n Ψ j i,k = ( m ) w f jlm (10s) k c(k, w) 10s = m=0 l=1 9 m=0 l=1 s S l i 1 w=0 ) n f jlm 10 k w c(k, w)m w w=0 s S l i 1 by reordering the sum To simplify the notation we introduce and write therefore (6) Ψ j i,k = 9 a(k, w, m) = 10 k w c(k, w)m w m=0 l=1 n f jlm a(k, w, m)ψ l i 1,k+w w=0 s k w Again it may seem odd that we have replaced the finite summation (5) in s by an infinite sum in w But the infinite sum decays so fast in w that truncation enables us to approximate (6) much faster than evaluating the sums of Equation (5) 5 Truncation and Extrapolation We step into the numerical analysis of the problem So far we have only reformulated the summation by introducing the partial sums Ψ j i,k The ultimate goal is the efficient computation of Ψ = i,j Ψj i,1 We use the following scheme: For i 2 the sums Ψ j i,k (k > 1 is needed in the next step) are computed directly as suggested in Equation (2) For i > 2 a recursive evaluation of (6) is used The indices i and w both run from 3 (resp 0) to infinity For w we use a simple truncation by neglecting all terms Ψ l i 1,k+w smaller than an a priori given bound ε, or to be precise: to neglect all terms Ψ l i 1,k+w 3

7 SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES 7 where the estimate (3) is smaller than ε, that is, k+w is sufficiently large In practice we decrease ε until the first d digits of the result stop changing where d is a desired number of correct digits For the same reason we can neglect for large i all contributions from terms Ψ l i 1,k+w with k + w > 1 Once the algorithm has achieved that stage it is possible to apply extrapolation Equation (6) with w = 0 and k = 1 reads in matrix form (7) Ψ 1 i,1 Ψ n i,1 f 9 11m f 1nm 10 1 m=0 } f n1m {{ f nnm } A n Ψ 1 i 1,1 Ψ n i 1,1 since a(1, 0, m) = 10 1 for all m At this point the skeptical reader may not believe that the nonnegative matrix A n is a contraction The associated digraph of A n with vertices 1,, n representing the sets S j, j = 1,, n and arc ij if and only if A n (i, j) 0 is exactly the graph illustrating the recurrence relations between the sets S j as introduced above, see Fig 1 We have assumed that this graph is strongly connected and hence A n is irreducible 4 and therefore the Perron-Frobenius Theorem[10, Theorem 844] applies: Theorem 1 (Perron-Frobenius) Let A be a nonnegative 5 and irreducible matrix Then there is an eigenvalue λ d that is real and positive, with positive left and right eigenvectors, any other eigenvalue λ satisfies λ < λ d, the eigenvalue λ d is simple The eigenvalue λ d is called the dominant eigenvalue of A It remains to show that the dominant eigenvalue λ d of A n is smaller than 1 Consider the l th column of the matrix f 11m f 1nm f n1m f nnm By definition of f (4) there is a 1 in row T(l, m) if T(l, m) > 0 All other entries in the column are zero Therefore a i 1 1 if we denote by a 1,,a n the columns of A n The existence of columns which have no nonzero entry implies that there are columns of A n with a i 1 < 1 Let x be the right eigenvector of A n corresponding to λ d Applying 4 A matrix is reducible if and only if its associated digraph is not strongly connected [7, p 163 ff] 5 A matrix is nonnegative if and only if every entry is nonnegative

8 8 THOMAS SCHMELZER AND ROBERT BAILLIE the triangle inequality λ d x 1 = A n x 1 n x i a i 1 < i=1 n x i = x 1 we conclude that λ d < 1 Note that we have used the fact that the elements x i of the positive vector x can not vanish for any index i If all columns of the nonnegative matrix A n satisfy a i 1 = 1, the matrix A n is called stochastic and (1,, 1) is a left eigenvector with eigenvalue 1 In this case A n is no longer a contraction This situation occurs once T contains no zero and hence no integers are deleted at all This may serve as an unusual explanation for the divergence of the harmonic series Having shown that the spectrum of A n lies within the unit disk, we can simplify (8) by a Neumann series i=1 Ψ 1 i+k,1 Ψ n i+k,1 i=1 A i n i=1 Ψ 1 K,1 Ψ n K,1 A k n = (I A n) 1 I =: B n k=1 where I is an identity matrix of appropriate dimension Hence n K Ψ 1 K,1 (9) Ψ Ψ j i,1 + B n j=1 i=1 Using the same idea we can also estimate the result of truncating the series after, say, M + K digits using (10) M k=1 A k n Ψ n K,1 1 = (I AM+1 n )(I A n ) 1 I =: B M n In practice, one would use an eigendecomposition of A n in order to determine A M+1 n 6 Examples We compute a few sums to a precision of 100 decimals, although if desired, more could easily be obtained First, let us compute the sum originally considered by Kempner [12], namely, where the digit 9 is missing from the denominators Here, there is only one set S = S 1, namely, the set of integers that do not contain a 9 When we append a 9 to an element of

9 SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES 9 S, we get a number not in S, so T(1, 9) = 0 When we append any other digit, we get another element of S, so all other T(1, ) = 1: [ ] T = To 100 decimals, the sum is In Section 3 we mentioned the sum of 1/s where s has no even digits The sum is Similarly, the sum over denominators with no odd digits can be found using the matrix [ ] T = In this case the sum is In Section 3, we gave the matrix T that corresponds to the sum of 1/s where s has no string 314 The sum is: We can also compute the sum of 1/s where s has no string Then the sum is: This sum demonstrates the power of the technique presented here Using (10) we calculate that the partial sum of all terms whose denominators have or fewer digits is about This is still only 1/10 th as large as the final sum, and illustrates the futility of direct summation Notice that this sum is close to 10 6 log 10 But there is nothing special about ; we observe similar results for other strings of six digits We say more about this in the next section

10 10 THOMAS SCHMELZER AND ROBERT BAILLIE Let S be the set of integers containing no 42 Compute Ψ in this case is the challenge recently posed by Bornemann et al [5] In this case T = and the sum is given by The next example combines various constraints and illustrates the flexibility of our approach Let S be the set of integers containing no even digits, no 55 and no Then we define the following partition of S S 2 is the subset of numbers ending in 5 (but not ending in 135), S 3 is the set of numbers ending in 1, S 4 is the set of numbers ending in 13, S 5 is the subset of numbers ending in 135 and the elements of S 6 end in 1357 All remaining elements of S are in S 1 Following those rules the matrix T is given by Here the sum is T = Our algorithm can be easily generalized for other bases than 10 The sum of 1/s where s has no 0 in base 100 is All sorts of other experiments are possible The interested reader might experiment by removing from the harmonic series their personal favorite number, such as their birthday (as a single string, or as a set of three strings), their phone number, etc

11 SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES 11 7 Asymptotic behavior We now discuss the asymptotic behavior of the sums that arise when we remove from the harmonic series terms whose denominators contain a string X n of length n digits Data for several random strings of n = 20 digits are given in Table 1 It is striking that, for each random string X n, the normalized sum, Ψ Xn /10 n, is very close to log 10 = n String X n Ψ Xn /10 n Table 1 Sums for several random 20-digit strings Table 2 shows what happens for strings that consist of repeated patterns of substrings If a string consists of shorter substrings repeated two or more times, we define the period of the string to be the length of that shortest substring So, has period 1, while has period 2 Here, the normalized sums appear to approach different limits The limits do not depend on which digits comprise the strings, but instead depend on the periods When all digits are identical (period 1), the limit of the normalized sum seems to be (10/9) log10 = When the period is 2, the limit seems to be (100/99) log10 = For period 5, it s (100000/99999) log 10 = We emphasize that we observe these same limits for other strings of digits In the limit, the particular digits in a string do not matter What matters is the structure of the strings Equation (9) is based on a truncation and is correct in the limit for K Nevertheless we fix K to n 1 and introduce an error term e n In particular n is the only free parameter left The error term implies Ψ Xn 10 = 1 n 10 n n n 1 Ψ j i,1 + i=1 j=1 B n Ψ 1 n 1,1 Ψ n n 1,1 1 + e n We observe that for increasing n the first term on the right-hand side converges to zero due to the slow growth of the double sum The error term scaled by 10 n representing the truncated sums Ψ l i,1+w with l = 1,, n, i n 1 and w > 0 meets the same fate

12 12 THOMAS SCHMELZER AND ROBERT BAILLIE n String X n Ψ Xn /10 n Table 2 Sums for strings of periods 1, 2, and 5 We need a more practical notation for the vector we take the 1-norm of and introduce ψ n n 1 = Ψ 1 n 1,1 Ψ n n 1,1 We observe that ψ n n 1 is exactly the sum over all positive integers with exactly n 1 1 digits Not a single integer has been deleted at this stage yet Hence ψ n n 1 1 converges to log 10 because The same is true ψ n n 1 1 n 10 n 10 n 1 1 t dt = log 10 ψ n k+n 1 log 10 n for any fixed k 0 Here we delete amongst integers of length k+n those which contain a certain string of length n Hence the number of integers we delete is bounded no matter

13 SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES 13 how large n is But the contribution from these deleted integers converges to zero for increasing n Equation (8) reveals what in numerical linear algebra is called a power iteration [15] Note that any vector with nonnegative entries and positive norm can never be orthogonal to the dominant eigenvector of A n Hence the vectors ψ n k+n quickly line up with the dominant eigenvector of A n for increasing k Contributions in other directions are damped more quickly The factor of amplification of the asymptotic eigenvector ψ is therefore given by the dominant eigenvalue of B n Hence 0 = lim lim k n = lim n ( Ψ Xn /10 n 1 ( Ψ Xn /10 n log 10 λ B n 10 n 10 n B n ψ 1 ) If λ An < 1 is the dominant eigenvalue of A n, then λ B n = 1/(1 λ An ) 1 is the largest eigenvalue of B n Both matrices share their eigenvectors and therefore ( 0 = lim Ψ Xn /10 n log 10 1/(1 λ ) A n ) 1 n 10 n ( = lim Ψ Xn /10 n log 10 1/(1 λ ) A n ) n 10 n Note that does not imply that Ψ Xn /10 n converges We have proved: Theorem 2 Let Ψ Xn be the sum of 1/s where s does not contain the substring X n Let A n be the matrix defined in (7) Then ( lim Ψ Xn /10 n 1/(1 λ ) A n ) = 0 n 10 n where λ An is the dominant eigenvalue of A n It all boils down to locating this dominant eigenvalue or getting some good estimates for it At least for special cases this is simple: ) Lemma 1 Let X n be any string of n digits that are all the same Let Ψ Xn sum of 1/s where s does not contain the substring X n Then be the lim Ψ X n /10 n = 10 log 10 n 9

14 14 THOMAS SCHMELZER AND ROBERT BAILLIE Proof If all digits in X n are the same then the n n matrix A n has the form A n = , 1 0 assuming that S 1 is the set of integers not ending in the integer d S 2 is ending in d, S 3 is ending in dd and so on An analysis of the characteristic polynomial of A n shows that any eigenvalue of λ is a solution of the equation (11) λ n (1 λ) = 9 10 n+1 The term on the right hand side might be interpreted as a perturbation of the homogeneous equation with a root at λ = 1 This root is moving on the real line towards the origin such that the factor (1 λ) is still larger than 9/10 n+1 balancing the fast decay of λ n Hence λ B (12) lim n n 10 = lim 1 n n (1 λ An )10 = 10 n 9 lim n λn A n by utilizing (11) It remains to show that although λ An < 1 we get lim n λ n A n = 1 If λ > n n+1 graph of λ n (1 λ) is monotonic decreasing But for λ = 10n 1, λ n (1 λ) is still larger 10 n than 9/10 n+1 and hence λ An > λ Yet lim n λ n = 1 and we get desired result Therefore lim n Ψ/10n = log 10 lim λ B n n /10 n = 10 9 log 10 We now consider the more general case of periodic strings of period p 1 Lemma 2 Let X n be any string of n digits having period p Let Ψ Xn be the sum of 1/s where s does not contain the substring X n Then lim n Ψ X n /10 n = 10p log p 1 Proof The matrix A n mildly depends on the structure of the digits in the periodic substring of length p but in all cases the characteristic polynomial is given by p n (λ) = g(λ) 1 (g(λ) 1) λ

15 where SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES 15 g(λ) = v m=0 10 mp λ mp = 1 10(v+1)p λ (v+1)p 1 10 p λ p A complete proof based on the block structure of A n (the pattern of A n can be solely described by the leading p p block) is omitted here Hence for any eigenvalue In the spirit of (12) 1/(1 λ) = g(λ) λ B lim n n 10 = lim g(λ An ) = 10p n n 10 n 10 p 1 lim n λn A n For λ = 10n 1 we have p 10 n n (λ) < 0, but p n (λ) for λ Hence there is a root larger than λ Therefore lim n λ n A n = 1 which finishes the proof Lemma 3 Let X n be any string of n digits with no periodic pattern Let Ψ Xn be the sum of 1/s where s does not contain the substring X n Then lim Ψ X n /10 n = log 10 n Proof This can be interpreted as the limit of the result of Lemma 2 for p 8 Conclusions We have derived an algorithm able to cope with various constraints on the set of integers deleted from the harmonic series The algorithm relies on truncation and extrapolation and avoids direct summation for large integers with more than 2 digits Embedding the problem in the language of linear algebra we draw on nothing beyond eigenvalues and eigenvectors to give an asymptotic analysis of the problem Our MATHEMATICA implementation can be downloaded from the webpage of the first author 6 It fits on one page and runs in less than 5 seconds to produce 10 digits This is a model for good scientific computing that has recently been put forward by Trefethen [14] This paper may provide some opportunities for further exploration It might be good fun to derive an algorithm for the inverse problems What set of simple constraints might one apply in order to make the sum as close as possible to a given number? The N th partial sum of the harmonic series is never an integer [9, p 24] What about partial sums of the series we consider here? And are these sums rational, irrational, algebraic, or transcendental? 6

16 16 THOMAS SCHMELZER AND ROBERT BAILLIE Acknowledgements This note was inspired by Folkmar Bornemann who challenged Nick Trefethen and his Problem Solving Squad at Oxford with his 42 problem The first author enjoyed discussions with Gustav Holzegel, Nicolas Jeannequin, Martin Stoll and Nick Trefethen References 1 Tom M Apostol, Mathematical analysis, Addison-Wesley, New York, Robert Baillie, Sums of reciprocals of integers missing a given digit, Amer Math Monthly 86 (1979), R P Boas, Some remarkable sequences of integers, Mathematical plums (Ross Honsberger, ed), MAA, Washington, Daniel Bonar and Michael Khoury, Real infinite series, MAA, Washington, Folkmar Bornemann, Dirk Laurie, Stan Wagon, and Jörg Waldvogel, The SIAM 100-digit challenge, SIAM, Philadelphia, H-J Fischer, Die Summe der Reziproken der natürlichen Zahlen ohne Ziffer 9, Elem Math 48 (1993), Chris Godsil and Gordon Royle, Algebraic graph theory, Springer, New York, G H Hardy and E M Wright, An introduction to the theory of numbers, 4th ed, Oxford University Press, London, Julian Havil, Gamma: Exploring Euler s constant, Princeton University Press, Princeton, Roger A Horn and Charles R Johnson, Matrix analysis, Cambridge University Press, Cambridge, Frank Irwin, A curious convergent series, Amer Math Monthly 23 (1916), A J Kempner, A curious convergent series, Amer Math Monthly 21 (1914), Peter D Schumer, Mathematical journeys, Wiley, Hoboken, Lloyd N Trefethen, Ten digit algorithms, Tech Report NA 05/13, Oxford University Computing Laboratory, Lloyd N Trefethen and David Bau, III, Numerical linear algebra, SIAM, Philadelphia, Michael Trott, The Mathematica guidebook for symbolics, Springer, New York, A D Wadhwa, An interesting subseries of the harmonic series, Amer Math Monthly 82 (1975), Computing Laboratory, Oxford University, Wolfson Building, Oxford OX1 3QD, UK address: Excelsior Software, Inc, th Avenue Court, Greeley, Colorado USA

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Introduction to Flocking {Stochastic Matrices}

Supelec EECI Graduate School in Control Introduction to Flocking {Stochastic Matrices} A. S. Morse Yale University Gif sur - Yvette May 21, 2012 CRAIG REYNOLDS - 1987 BOIDS The Lion King CRAIG REYNOLDS

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### Series. Chapter Convergence of series

Chapter 4 Series Divergent series are the devil, and it is a shame to base on them any demonstration whatsoever. Niels Henrik Abel, 826 This series is divergent, therefore we may be able to do something

### Continued Fractions. Darren C. Collins

Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

### Approximating the entropy of a 2-dimensional shift of finite type

Approximating the entropy of a -dimensional shift of finite type Tirasan Khandhawit c 4 July 006 Abstract. In this paper, we extend the method used to compute entropy of -dimensional subshift and the technique

### The Relation between Two Present Value Formulae

James Ciecka, Gary Skoog, and Gerald Martin. 009. The Relation between Two Present Value Formulae. Journal of Legal Economics 15(): pp. 61-74. The Relation between Two Present Value Formulae James E. Ciecka,

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

55 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 we saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c n n c n n...

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### 1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

### ANALYTICAL MATHEMATICS FOR APPLICATIONS 2016 LECTURE NOTES Series

ANALYTICAL MATHEMATICS FOR APPLICATIONS 206 LECTURE NOTES 8 ISSUED 24 APRIL 206 A series is a formal sum. Series a + a 2 + a 3 + + + where { } is a sequence of real numbers. Here formal means that we don

### Sequences and Series

Contents 6 Sequences and Series 6. Sequences and Series 6. Infinite Series 3 6.3 The Binomial Series 6 6.4 Power Series 3 6.5 Maclaurin and Taylor Series 40 Learning outcomes In this Workbook you will

### The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

### 15 Markov Chains: Limiting Probabilities

MARKOV CHAINS: LIMITING PROBABILITIES 67 Markov Chains: Limiting Probabilities Example Assume that the transition matrix is given by 7 2 P = 6 Recall that the n-step transition probabilities are given

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### RAMANUJAN S HARMONIC NUMBER EXPANSION INTO NEGATIVE POWERS OF A TRIANGULAR NUMBER

Volume 9 (008), Issue 3, Article 89, pp. RAMANUJAN S HARMONIC NUMBER EXPANSION INTO NEGATIVE POWERS OF A TRIANGULAR NUMBER MARK B. VILLARINO DEPTO. DE MATEMÁTICA, UNIVERSIDAD DE COSTA RICA, 060 SAN JOSÉ,

### Additional Topics in Linear Algebra Supplementary Material for Math 540. Joseph H. Silverman

Additional Topics in Linear Algebra Supplementary Material for Math 540 Joseph H Silverman E-mail address: jhs@mathbrownedu Mathematics Department, Box 1917 Brown University, Providence, RI 02912 USA Contents

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

### Objectives. Materials

Activity 5 Exploring Infinite Series Objectives Identify a geometric series Determine convergence and sum of geometric series Identify a series that satisfies the alternating series test Use a graphing

### Markov Chains, Stochastic Processes, and Advanced Matrix Decomposition

Markov Chains, Stochastic Processes, and Advanced Matrix Decomposition Jack Gilbert Copyright (c) 2014 Jack Gilbert. Permission is granted to copy, distribute and/or modify this document under the terms

### A characterization of trace zero symmetric nonnegative 5x5 matrices

A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

58 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 you saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c nn c nn...

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

### by the matrix A results in a vector which is a reflection of the given

Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

### 16.1. Sequences and Series. Introduction. Prerequisites. Learning Outcomes. Learning Style

Sequences and Series 16.1 Introduction In this block we develop the ground work for later blocks on infinite series and on power series. We begin with simple sequences of numbers and with finite series

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

### 61. REARRANGEMENTS 119

61. REARRANGEMENTS 119 61. Rearrangements Here the difference between conditionally and absolutely convergent series is further refined through the concept of rearrangement. Definition 15. (Rearrangement)

### 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

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### Continuity of the Perron Root

Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

### Iterative Techniques in Matrix Algebra. Jacobi & Gauss-Seidel Iterative Techniques II

Iterative Techniques in Matrix Algebra Jacobi & Gauss-Seidel Iterative Techniques II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Double Sequences and Double Series

Double Sequences and Double Series Eissa D. Habil Islamic University of Gaza P.O. Box 108, Gaza, Palestine E-mail: habil@iugaza.edu Abstract This research considers two traditional important questions,

### Arithmetic and Algebra of Matrices

Arithmetic and Algebra of Matrices Math 572: Algebra for Middle School Teachers The University of Montana 1 The Real Numbers 2 Classroom Connection: Systems of Linear Equations 3 Rational Numbers 4 Irrational

### Lecture 9. 1 Introduction. 2 Random Walks in Graphs. 1.1 How To Explore a Graph? CS-621 Theory Gems October 17, 2012

CS-62 Theory Gems October 7, 202 Lecture 9 Lecturer: Aleksander Mądry Scribes: Dorina Thanou, Xiaowen Dong Introduction Over the next couple of lectures, our focus will be on graphs. Graphs are one of

### 1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### Algebraic Complexity Theory and Matrix Multiplication

Algebraic Complexity Theory and Matrix Multiplication [Handout for the Tutorial] François Le Gall Department of Computer Science Graduate School of Information Science and Technology The University of

### Math 181 Handout 16. Rich Schwartz. March 9, 2010

Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =

### Math Department Student Learning Objectives Updated April, 2014

Math Department Student Learning Objectives Updated April, 2014 Institutional Level Outcomes: Victor Valley College has adopted the following institutional outcomes to define the learning that all students

### A Curious Case of a Continued Fraction

A Curious Case of a Continued Fraction Abigail Faron Advisor: Dr. David Garth May 30, 204 Introduction The primary purpose of this paper is to combine the studies of continued fractions, the Fibonacci

### Taylor Series and Asymptotic Expansions

Taylor Series and Asymptotic Epansions The importance of power series as a convenient representation, as an approimation tool, as a tool for solving differential equations and so on, is pretty obvious.

### SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS

(Section 0.6: Polynomial, Rational, and Algebraic Expressions) 0.6.1 SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS LEARNING OBJECTIVES Be able to identify polynomial, rational, and algebraic

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### Limit processes are the basis of calculus. For example, the derivative. f f (x + h) f (x)

SEC. 4.1 TAYLOR SERIES AND CALCULATION OF FUNCTIONS 187 Taylor Series 4.1 Taylor Series and Calculation of Functions Limit processes are the basis of calculus. For example, the derivative f f (x + h) f

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### Steven Skiena. skiena

Lecture 3: Recurrence Relations (1997) Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Argue the solution to T(n) =

### Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

### Lecture 1 Newton s method.

Lecture 1 Newton s method. 1 Square roots 2 Newton s method. The guts of the method. A vector version. Implementation. The existence theorem. Basins of attraction. The Babylonian algorithm for finding

### Good luck, veel succes!

Final exam Advanced Linear Programming, May 7, 13.00-16.00 Switch off your mobile phone, PDA and any other mobile device and put it far away. No books or other reading materials are allowed. This exam

### n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

### arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

### Math 317 HW #5 Solutions

Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show

### 4. Factor polynomials over complex numbers, describe geometrically, and apply to real-world situations. 5. Determine and apply relationships among syn

I The Real and Complex Number Systems 1. Identify subsets of complex numbers, and compare their structural characteristics. 2. Compare and contrast the properties of real numbers with the properties of

### College Algebra. Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. College Algebra, 8th edition, McGraw-Hill, 2008, ISBN: 978-0-07-286738-1

College Algebra Course Text Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. College Algebra, 8th edition, McGraw-Hill, 2008, ISBN: 978-0-07-286738-1 Course Description This course provides

### PÓLYA URN MODELS UNDER GENERAL REPLACEMENT SCHEMES

J. Japan Statist. Soc. Vol. 31 No. 2 2001 193 205 PÓLYA URN MODELS UNDER GENERAL REPLACEMENT SCHEMES Kiyoshi Inoue* and Sigeo Aki* In this paper, we consider a Pólya urn model containing balls of m different

### The Alternating Series Test

The Alternating Series Test So far we have considered mostly series all of whose terms are positive. If the signs of the terms alternate, then testing convergence is a much simpler matter. On the other

### Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem

### Notes 11: List Decoding Folded Reed-Solomon Codes

Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded Reed-Solomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,

### 4.3 Limit of a Sequence: Theorems

4.3. LIMIT OF A SEQUENCE: THEOREMS 5 4.3 Limit of a Sequence: Theorems These theorems fall in two categories. The first category deals with ways to combine sequences. Like numbers, sequences can be added,

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### 10.2 Series and Convergence

10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

### S = k=1 k. ( 1) k+1 N S N S N

Alternating Series Last time we talked about convergence of series. Our two most important tests, the integral test and the (limit) comparison test, both required that the terms of the series were (eventually)

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### A CHARACTERIZATION OF TREE TYPE

A CHARACTERIZATION OF TREE TYPE LON H MITCHELL Abstract Let L(G) be the Laplacian matrix of a simple graph G The characteristic valuation associated with the algebraic connectivity a(g) is used in classifying

### Advanced Higher Mathematics Course Assessment Specification (C747 77)

Advanced Higher Mathematics Course Assessment Specification (C747 77) Valid from August 2015 This edition: April 2016, version 2.4 This specification may be reproduced in whole or in part for educational

### UNCOUPLING THE PERRON EIGENVECTOR PROBLEM

UNCOUPLING THE PERRON EIGENVECTOR PROBLEM Carl D Meyer INTRODUCTION Foranonnegative irreducible matrix m m with spectral radius ρ,afundamental problem concerns the determination of the unique normalized

### arxiv: v1 [physics.gen-ph] 10 Jul 2015

Infinite circuits are easy. How about long ones? Mikhail Kagan, Xinzhe Wang Penn State Abington arxiv:507.08v [physics.gen-ph] 0 Jul 05 Abstract We consider a long but finite ladder) circuit with alternating

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

### Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Summary of week 8 (Lectures 22, 23 and 24)

WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry

### Chapter 6. Orthogonality

6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be