Sequences of Real Numbers
|
|
- Harriet Strickland
- 5 years ago
- Views:
Transcription
1 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 chapter, we will discuss how the real number system is constructed from the rationals. The reader who wishes to not use the real number system until it has been rigorously defined can essentially replace every occurrence of the word real in this chapter with rational. After all, we have already discussed the ordered field properties for Q, and thus all the properties of the real number system used in this chapter are also properties of the rational number system. 8. Limit of a Sequence You probably first studied sequences in second-semester calculus as a prelude to learning about series of numbers, power series of functions, and Taylor s Theorem. The intuitive idea is that the sequence a = {a n } has limit L if the terms of a are as close as we please to L for n sufficiently large. If a has a limit, we say it is convergent. Otherwise we say a is divergent. We want to turn this idea into a precise definition that makes explicit what condition must be satisfied by a convergent sequence. Before we give this precise definition, we pause to look at a few examples and to develop some tools for exploring sequences. 8.. Numerical and graphical exploration In this section, we explore two sequences, a and b, given by n-th term formulas a n = ( )n n 2n +, n 0 b n = 3n 2n +, n 0.
2 2 CHAPTER 8. SEQUENCES OF REAL NUMBERS One way to explore a sequence is to generate some of its term. At this point, it is a triviality for us to write some code to do this. For sequence a, we might write: MAX_ELEMENTS = 20 #This is the number of terms we ll generate a = [] #start with an empty list for n in range(0,max_elements): a.append(((-.0)**n)*n/(2.0*n+.0)) print(a) Run this code for yourself to generate all 20 terms. The last 4 (rounded) are a[6] = , a[8] = , a[7] = , a[9] = The terms with even index appear to be approaching 0.5 and those with odd index appear to be approaching 0.5. Because there does not appear to be a single number that the terms approach, it appears that this sequence does not have a limit. We can look at the same information graphically. To plot this sequence, we simply add two lines to our code: plot(a,".") #the "." tells the program to plot discrete points show() Here s the graph.
3
4 4 CHAPTER 8. SEQUENCES OF REAL NUMBERS On the other hand, the last four terms of b (rounded) are, b[6] = , b[7] = , b[8] = , b[9] = , with graph:
5
6 6 CHAPTER 8. SEQUENCES OF REAL NUMBERS For sequence b, the numerical and graphical evidence suggests that the terms will be as close to.5 as we like for n sufficiently large. Exercise 8... Write your own code to generate the first 20 terms of the sequence b and the graph. We move towards a more quantitative approach; let us figure out how large n must be in order for b[n] to be within 00 of 3 2. That is, we want 3n 2n < 00. Because we must find n so that Thus we require 3n 2n = = 3 4n + 2 < 00. 6n 3(2n + ) 2(2n + ) 3 4n + 2, n > = 72. To summarize, we have shown that the terms of b will be within 00 of the (suspected) limit 3 2 if n is at least 73. We could do this calculation for errors ε other than 00. If for any ε > 0 we can find an N so that, for all n N, b[n] 3 < ε, we will have shown that the sequence indeed has limit 3 2 Exercise For sequence b above, take ε = b[n] 3 2 < ε if n N. Exercise Consider the sequence with a n = 2 n and find an N such that. This sequence is decreasing. Write the one-line proof of this fact. 2. It is not hard to guess that this sequence has limit 0. For each of ε = 5, 50, 500, find a value of N such that if n N, 2 n 0 < ε The precise definition of a limit We have thus motivated the version of the definition of limit we will use. Definition 8... The sequence {a n } has limit L if, for every ε > 0, there exists N N such that for all n N, a n L < ε. Example 8... Let us finish the example from the previous section by using the definition to prove that lim n 3n 2n + = 3 2.
7 8.. LIMIT OF A SEQUENCE 7 Proof. Let ε > 0 be given. We must show that there exists N such that, if n N, 3n 2n < ε. Observe, 3n 2n = 4n + 2 < 3 4n. This will be less than ε if n > 3 4ε. We may thus take N to be the smallest natural number larger than 3 4ε. We make an important remark about this proof: The definition of a limit does not require us to find the smallest N that works for a given ε - it only requires us to show that some N exists. Thus although we may get a smaller N by solving the inequality 3 4n + 2 < ε exactly (as we did above in the special case of ε = 00 ), we chose instead to find the smallest n for which the larger expression 3 is less than ε. This idea is 4n used very often in analysis proofs and is thus worth understanding thoroughly. Exercise Consider a n = 2n 2 n Note that a n 0 for all ngeq. (a) Find a simple function b n such that 0 a n b n for all n. (b) Now take ε > 0. Find an N such that, if n N, 0 a n < ε. The idea, as discussed above, is to find an N so that, if n N, the larger function b n is less than ε. We consider another example. Example We claim lim n n n2 + =. Proof. Let ε > 0 be given. We must show that there exists N such that, if n N, n n2 + < ε.
8 8 CHAPTER 8. SEQUENCES OF REAL NUMBERS Suppose n. Observe, n n2 + = < = n n 2 + n2 + n n 2 + n + n 2 + n 2 n + n 2 + n(n + n 2 + ) < n 2, where the last inequality comes from replacing n 2 + in the denominator with the smaller quantity 0. The last expression is less than ε if n 2 > ε n > ε. We may thus take N to be any natural number larger than ε. Again, we summarize the logic of the argument: We find an N such that, if n N, the larger expression n is less than ε. Thus the smaller expression 2 n n 2 + is also less than ε. Exercise Use the definition of limit to prove 8.2 Properties 2 n lim n n + =. In a calculus course, you probably learned to do limit calculations algebraically. n 3n Example Let s find lim 2 n 2n The idea is to multiply by a convenient form of : n 3n 2 lim n 2n n 3n 2 = lim n 2n = lim n n n = = 3 2. This calculation uses several propositions that we have not yet proved. Most importantly, it uses the fact that the limit of the quotient is the quotient of the limits if both limits exist and the limit of the denominator is not zero. The goal of this section is to prove such results so that we can do limit calculations more easily. n 2 n 2
9 8.2. PROPERTIES 9 Exercise The example also used the fact that, if A is any constant, A lim n n = 0. Prove this. Note that A could be zero. See if you can write a proof that does not treat the case A = 0 separately. Our first proposition will be used in the proofs of some of the limit laws. It is also useful in its own right, for it gives a necessary condition for convergence of a sequence. Proposition Recall that a sequence {a n } is bounded if there exists M such that a n M for all n. If {a} is convergent, then {a} is bounded. Proof. The idea of the argument is simple; because any finite set is bounded, if we find a bound for the tail of the sequence, we can find a bound for the entire sequence. Thus suppose L is the limit of the sequence. Then for ε =, there exists N such that for all n N, a n L <. Thus by the reverse triangle inequality, for all n N, a n L +. Let M = max{ a 0,..., a N, L + }. For all n, a n M. Exercise Draw a figure illustrating the idea of this proof. Exercise Use this proposition to prove that the sequence a n = n 2 is divergent. Proposition Let {a n } and {b n } be convergent sequences with lim n a n = L and lim n b n = K. Let A be a real constant. Then (a) The sequence {Aa n } is convergent with lim Aa n = AL. n (b) The sequence {a n + b n } is convergent with lim (a n + b n ) = L + K. n (c) The sequence {a n b n } is convergent with (d) If K 0 the sequence lim a nb n = LK. n { } a n bn is convergent with a n lim = L n b n K.
10 0 CHAPTER 8. SEQUENCES OF REAL NUMBERS Proof. We leave parts (a) and (d) as exercises and prove (b) and (c). Proof of (b). Let ε > 0 be given. Because lim n a n = L, for the positive number ε 2, there exists N such that, if n N, a n L < ε 2. Similarly, there exists N 2 such that, if n N 2, b n K < ε 2. Thus if n N = max{n, N 2 }, by the triangle inequality (a n + b n ) (L + K) = (a n L) + (b n K) a n L + b n K < ε 2 + ε 2 = ε. Thus {a n + b n } converges, with limit L + K. Proof of (c). Let ε > 0 be given. We mush show that there exists N such that for all n N, a n b n LK < ε. (8.2.) We don t know how to relate a n b n directly to LK, but we do know something about the relationship between a n and L. This motivates our next step, i.e., adding and subtracting Lb n inside the absolute value sign. Observe, a n b n LK = a n b n + ( Lb n + Lb n ) LK = (a n L)b n + L(b n K) a n L b n + L b n K. As in the proof of (b), we d like to use the convergence of {a n } to L to argue that the first term is less than ε 2 for sufficiently large n, and similarly for the second term. Indeed, note first that because {b n } is convergent, by Proposition 8.2., there exists M > 0 such that b n M for all n. Now, for the positive number ε 2M there exists N such that, if n N, a n L < ε 2M. Similarly, for the ε positive number 2( L +) there exists N ε 2 such that, if n N 2, b n K < 2( L +). Thus if n N = max{n, N 2 }, a n L b n + L b n K < ε 2M M + L ε 2( L + ) < ε 2 + ε 2 = ε. Because, for n N, a n b n LK < ε, the sequence {a n b n } is convergent with limit LK. Arguments like the above are quite standard in analysis and thus worth understanding thoroughly. The next exercises are thus particularly important. Exercise Prove (a). See if you can write a proof that does not treat the case A = 0 separately. Exercise Prove (d).
11 8.3. CAUCHY SEQUENCES 8.3 Cauchy Sequences We now know what it means for a sequence {a n } to have limit L. Suppose now we are given a sequence that we suspect has no limit. What would we have to prove? We would need to show that for every possible limit L, there exists ε > 0 such that for all N N there exists n N such that a n L ε. Consider, for example, the sequence whose n-th term is a n = ( ) n. This sequence seems not to have a limit because all terms with odd index are equal to and all terms with even index are equal to. Writing a proof using the negation of the definition of a limit is, however, a bit of a pain. We must begin with an arbitrary L. Suppose first that L. Thus L > 0. Take ε = L /2, and N N. For n = 2N, a n =, and so a n L = L > L 2 = ε, proving that L is not the limit. Next consider L =. Take ε = and N N. Then if n = 2N +, a n = and a n L = = 2 > = ε. Thus L = is not the limit. We conclude that {a n } does not have a limit. Although the above is a rather simple example of a divergent sequence, the proof was somewhat awkward. We would like a strong necessary condition for convergence of sequences that gives cleaner proofs that a given sequence is divergent. The condition is the Cauchy condition. Definition The sequence {a n } is a Cauchy sequence if, given ε > 0, there exists N N such that for all m, n N, a m a n < ε. Thus a sequence is Cauchy if, given any error ε, if we go far enough out, any two terms are within ε of one another. The divergent sequence above certainly did not have this property and, indeed, we have found a necessary condition for convergence. Proposition If the sequence {a n } is convergent, then the sequence is Cauchy. Proof. Let ε > 0 be given. We must show that there exists N N such that for all m, n N, a n a m < ε. By hypothesis, {a n } has a limit. Call it L. Thus for the positive number ε 2, there exists M such that for all n M, a n L < ε. We claim we may take N = M. Indeed, for all m, n M, a n a m = (a n L) + (L a m ) Thus {a n } is Cauchy. a n L + L a m triangle inequality < ε 2 + ε 2 = ε.
12 2 CHAPTER 8. SEQUENCES OF REAL NUMBERS 8.3. Showing that a sequence is Cauchy At this point, you may wonder why we would want to show that a sequence is Cauchy; we know that it is a necessary condition for convergence, but we have not determined whether it is sufficient. Thus proving that a sequence is in fact Cauchy only tells us that it has cleared this first hurdle. In the next chapter we will see that, in fact, within the real number system, the Cauchy condition is in fact sufficient for convergence. It is of great theoretical importance because it gives a characterization of convergent sequences of real numbers. It is, however, also of practical significance, for it will allow us to determine whether a sequence has a limit even if we have no idea what that limit might be. This situation is much more common than one might guess from looking at exercises in calculus and elementary analysis texts. We therefore give an example and some exercises in which we prove directly that a given sequence is Cauchy. Example The sequence given by a n = n 2 is Cauchy. Proof. Let ε > 0 be given. We must show that there exists N N such that, if m, n N, a n a m < ε. Assume without loss of generality that m > n. Then a m a n = m 2 n 2 = n 2 m 2 < n 2. If we take N to be any natural number greater than ε, then for m > n N, a m a n < n 2 N 2 < ε. Exercise Prove directly from the definition that the sequence given by a n = 3( )n is Cauchy. n Showing that a sequence is divergent We have shown that if {a n } has a limit, then it is Cauchy. The contrapositive of this statement gives an important tool for showing that a sequence is divergent. Even though it is logically equivalent to Proposition 8.3., we state it here for emphasis. Proposition If {a n } is not Cauchy, then {a n } does not have a limit. In order to use this, we must begin by carefully negating the definition of a Cauchy sequence.
13 8.3. CAUCHY SEQUENCES 3 Definition The sequence {a n } is not Cauchy if there exists ε > 0 such that for all N N, there exist m, n N with a m a n ε. Let us revisit the divergent sequence {a n } considered above, with n-th term formula a n = ( ) n. We claim that this sequence is not Cauchy. Indeed, consider ε = and let N be arbitrary. Consider m = 2N + and n = 2N. Then m, n N and a m a n = ( ) 2N+ ( ) 2N = = 2 ε. The sequence is not Cauchy and thus has no limit. Exercise Prove directly from the definition that the sequence given by a n = n is not Cauchy. Exercise Prove that the sequence a n = ( )n n 2n+ chapter is divergent. considered earlier in the Properties of Cauchy sequences We collect here a number of propositions about Cauchy sequences of real numbers that are analogous to propositions about convergent sequences of real numbers. It is not surprising that such analogues exist because, in the real number system, a sequence is convergent if and only if it is Cauchy (see the next chapter). However, we can prove these results directly from the definition of a Cauchy sequence, and we wish to do so because we will use several of these results when we discuss the construction of the real number system from the rational number system. Proposition If {a n } is Cauchy, then {a n } is bounded. Proof. Because {a n } is Cauchy, for ε =, there exists N such that for all n, m N, a n a m <. In particular, for all n N, a n a N. By the reverse triangle inequality, for all n N, a n a N +. If we set M = max{ a 0,..., a N, a N + }, then for all n, a n M. Proposition Let {a n } and {b n } be Cauchy and let A be a constant. (a) {Aa n } is Cauchy. (b) {a n + b n } is Cauchy. (c) {a n b n } is Cauchy. (d) Suppose there exists δ > 0 such that a n δ for all n. Then Cauchy. { } a n is
14 4 CHAPTER 8. SEQUENCES OF REAL NUMBERS Proof. We prove only part (d), leaving the proofs of the other parts to the reader. Let ε > 0 be given. Because {a n } is Cauchy, for the positive number εδ 2, there exists N such that, for all m, n N, a m a n < εδ 2. Then for m, n N, a m a n = a n a m a m a n = a m a n a m a n { Thus } a n is Cauchy. < δ 2 εδ2 = ε. Exercise Prove parts (a)-(c) of Proposition Problems. Determine (with justification) whether each of the following sequences is convergent or divergent. If the sequence is convergent, find its limit. (a) a n = ( )n n 2n 2 + (b) a n = n2 n + 4n 2 (c) a n = n 2 + 2n + n (d) a n =. (Recall that x is the greatest integer less than or equal 3 to x.) 2. Let a be a sequence of real numbers. We say that a tends to and write lim n a n = if given M, there exists N N such that for all n N, a n > M. (a) Formulate an analogous definition of a sequence tending to. (b) Prove or give a counterexample: If {a n } is not bounded, then either lim n a n = or lim n a n =. (c) Let p be a non-constant polynomial. Define a sequence {p(n)} by evaluating the polynomial at each non-negative integer. What can you say about lim n p(n)? 3. Let r be a real number. Consider the geometric sequence g = {r n }. We wish to explore how the convergence or divergence of the sequence depends on the value of r.
15 8.4. PROBLEMS 5 (a) For which (if any) values of r is the sequence g bounded? (b) For which (if any) values of r is g convergent? For such r, what is the limit? (c) For which (if any) values of r is lim n r n =? For which (if any) values of r is lim n r n =? (See the previous problem for definitions of these notations.) 4. Let a and b be sequences of real numbers. Define a sequence c by setting c n = a n b n. We proved that if a and b are both convergent, then so it c. In this problem, you will explore the convergence or divergence of c under other hypotheses on the sequences a and b. (a) Suppose lim n a n = 0. Must c be convergent? (Either prove that it must be or give a counter example.) (b) Suppose lim n a n = 0. Could c be convergent even if b is unbounded? Could c be convergent with limit unequal to zero? (c) Could c be convergent even if both a and b are divergent? 5. Part (d) { of } Proposition implies that if lim n a n = L and L 0, then a n is convergent with limit L. Consider the converse. In other { words, if is convergent, must {a n } be? a n } Programming Project: Ratios of Fibonacci Numbers. Consider the Fibonacci sequence {F n } defined recursively by F 0 = 0, F =, and F n = F n + F n 2 for all n 2. (8.4.). Write code to generate the first 20 terms of the sequence. 2. Let r n = Fn F n for n. Write code to generate r,..., r 9. Plot this sequence {r n } of ratios. 3. Does the graph suggest that {r n } is monotone (non-increasing or nondecreasing)? Eventually monotone? Convergent? With what limit? 4. In the next chapter we will show that {r n } is convergent. Assume this, and find lim n r n. (Suggestion: Obtain an equation relating r n and r n.) 5. In Chapter 3 we discussed linear recurrence relations such as the above. In Exercise??, you were asked to solve the recurrence defining the Fibonacci sequence. The answer is known as Binet s formula and says F n = ( ) n + ( Use this explicit formula to find lim n r n. 5 2 ) n. (8.4.2)
Homework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 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 informationMath 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 informationSequences. 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 informationSeunghee Ye Ma 8: Week 2 Oct 6
Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationMATH 1A, Complete Lecture Notes. Fedor Duzhin
MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More information2.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 informationMATH 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 information8.5 Taylor Polynomials and Taylor Series
8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:
More informationINFINITE 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 informationUndergraduate 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 informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationCHAPTER 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 informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationMini-Course on Limits and Sequences. Peter Kwadwo Asante. B.S., Kwame Nkrumah University of Science and Technology, Ghana, 2014 A REPORT
Mini-Course on Limits and Sequences by Peter Kwadwo Asante B.S., Kwame Nkrumah University of Science and Technology, Ghana, 204 A REPORT submitted in partial fulfillment of the requirements for the degree
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationMath 192r, Problem Set #3: Solutions
Math 192r Problem Set #3: Solutions 1. Let F n be the nth Fibonacci number as Wilf indexes them (with F 0 F 1 1 F 2 2 etc.). Give a simple homogeneous linear recurrence relation satisfied by the sequence
More informationLecture 3 - Tuesday July 5th
Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities
More informationSolutions to Homework Assignment 2
Solutions to Homework Assignment Real Analysis I February, 03 Notes: (a) Be aware that there maybe some typos in the solutions. If you find any, please let me know. (b) As is usual in proofs, most problems
More informationSequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.
Sequences Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Usually, instead of using the notation s(n), we write s n for the value of this function calculated at n. We
More informationMATH 131A: REAL ANALYSIS
MATH 131A: REAL ANALYSIS NICKOLAS ANDERSEN The textbook for the course is Ross, Elementary Analysis [2], but in these notes I have also borrowed from Tao, Analysis I [3], and Abbott, Understanding Analysis
More information( ε > 0) ( N N) ( n N) : n > N a n A < ε.
CHAPTER 1. LIMITS OF SEQUENCES 1.1. An Ad-hoc Definition. In mathematical analysis, the concept of limits is of paramount importance, in view of the fact that many basic objects of study such as derivatives,
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationMathematical Induction
Mathematical Induction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Mathematical Induction Fall 2014 1 / 21 Outline 1 Mathematical Induction 2 Strong Mathematical
More information16. . Proceeding similarly, we get a 2 = 52 1 = , a 3 = 53 1 = and a 4 = 54 1 = 125
. Sequences When we first introduced a function as a special type of relation in Section.3, we did not put any restrictions on the domain of the function. All we said was that the set of x-coordinates
More informationWe begin by considering the following three sequences:
STUDENT S COMPANIONS IN BASIC MATH: THE TWELFTH The Concept of Limits for Sequences and Series In calculus, the concept of limits is of paramount importance, in view of the fact that many basic objects
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationFirst In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018
First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Mathematical Induction Simple POMI Examples
More informationCHAPTER 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 informationChapter 11: Sequences; Indeterminate Forms; Improper Integrals
Chapter 11: Sequences; Indeterminate Forms; Improper Integrals Section 11.1 The Least Upper Bound Axiom a. Least Upper Bound Axiom b. Examples c. Theorem 11.1.2 d. Example e. Greatest Lower Bound f. Theorem
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More informationINTRODUCTION 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(Infinite) Series Series a n = a 1 + a 2 + a a n +...
(Infinite) Series Series a n = a 1 + a 2 + a 3 +... + a n +... What does it mean to add infinitely many terms? The sequence of partial sums S 1, S 2, S 3, S 4,...,S n,...,where nx S n = a i = a 1 + a 2
More informationG12MAN Mathematical Analysis Fully-justified answers to Revision Quiz questions
G12MAN Mathematical Analysis Fully-justified answers to Revision Quiz questions Remember that, unless otherwise specified or not applicable for some reason), you MUST justify your answers to questions
More informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 2, 207 Outline Mathematical Induction 2 Simple POMI Examples
More informationCS1800: Mathematical Induction. Professor Kevin Gold
CS1800: Mathematical Induction Professor Kevin Gold Induction: Used to Prove Patterns Just Keep Going For an algorithm, we may want to prove that it just keeps working, no matter how big the input size
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More informationRead carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.
THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: January 2011 Analysis I Time Allowed: 1.5 hours Read carefully the instructions on the answer book and make sure that the particulars required are entered
More informationTHE DIVISION THEOREM IN Z AND R[T ]
THE DIVISION THEOREM IN Z AND R[T ] KEITH CONRAD 1. Introduction In both Z and R[T ], we can carry out a process of division with remainder. Theorem 1.1. For any integers a and b, with b nonzero, there
More information1 Proof by Contradiction
In these notes, which will serve as a record of what we covered in weeks 3-4, we discuss various indirect methods of proof. While direct proof is often preferred it is sometimes either not possible or
More informationLimits and Continuity
Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index
More informationMA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra
206/7 MA03 Introduction to Abstract Mathematics Second part, Analysis and Algebra Amol Sasane Revised by Jozef Skokan, Konrad Swanepoel, and Graham Brightwell Copyright c London School of Economics 206
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationReal Analysis Notes Suzanne Seager 2015
Real Analysis Notes Suzanne Seager 2015 Contents Introduction... 3 Chapter 1. Ordered Fields... 3 Section 1.1 Ordered Fields... 3 Field Properties... 3 Order Properties... 4 Standard Notation for Ordered
More informationLimits and Infinite Series Lecture Notes for Math 226. Department of Mathematics Western Washington University
Limits and Infinite Series Lecture Notes for Math 226 by Árpád Bényi Department of Mathematics Western Washington University To the student Math 226 is a first introduction to formal arguments in mathematical
More informationMAS221 Analysis, Semester 1,
MAS221 Analysis, Semester 1, 2018-19 Sarah Whitehouse Contents About these notes 2 1 Numbers, inequalities, bounds and completeness 2 1.1 What is analysis?.......................... 2 1.2 Irrational numbers.........................
More informationMath Real Analysis
1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch
More informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More information1 Examples of Weak Induction
More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of
More informationMIDTERM REVIEW FOR MATH The limit
MIDTERM REVIEW FOR MATH 500 SHUANGLIN SHAO. The limit Define lim n a n = A: For any ε > 0, there exists N N such that for any n N, a n A < ε. The key in this definition is to realize that the choice of
More informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More informationExercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 <
Math 316, Intro to Analysis Limits of functions We are experts at taking limits of sequences as the indexing parameter gets close to infinity. What about limits of functions as the independent variable
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.6 Indirect Argument: Contradiction and Contraposition Copyright Cengage Learning. All
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationADVANCED CALCULUS 401 RECITATION NOTES, FALL 2014
ADVANCED CALCULUS 401 RECITATION NOTES, FALL 014 8/0: Proposition: is irrational. Proof. Assume toward a contradiction that is not irrational, i.e. rational. Then = p q, with p, q Z, q 0, such that gcd(p,
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More informationMath 410 Homework 6 Due Monday, October 26
Math 40 Homework 6 Due Monday, October 26. Let c be any constant and assume that lim s n = s and lim t n = t. Prove that: a) lim c s n = c s We talked about these in class: We want to show that for all
More informationMAC-CPTM Situations Project
Prompt MAC-CPTM Situations Project Situation 51: Proof by Mathematical Induction Prepared at the University of Georgia Center for Proficiency in Teaching Mathematics 13 October 2006-Erik Tillema 22 February
More informationArkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan
Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan 8. Sequences We start this section by introducing the concept of a sequence and study its convergence. Convergence of Sequences. An infinite
More information2 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 informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationChapter 8. Infinite Series
8.4 Series of Nonnegative Terms Chapter 8. Infinite Series 8.4 Series of Nonnegative Terms Note. Given a series we have two questions:. Does the series converge? 2. If it converges, what is its sum? Corollary
More informationSolution of the 8 th Homework
Solution of the 8 th Homework Sangchul Lee December 8, 2014 1 Preinary 1.1 A simple remark on continuity The following is a very simple and trivial observation. But still this saves a lot of words in actual
More informationSequences and the Binomial Theorem
Chapter 9 Sequences and the Binomial Theorem 9. Sequences When we first introduced a function as a special type of relation in Section.3, we did not put any restrictions on the domain of the function.
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationMathematical Induction
Chapter 6 Mathematical Induction 6.1 The Process of Mathematical Induction 6.1.1 Motivating Mathematical Induction Consider the sum of the first several odd integers. produce the following: 1 = 1 1 + 3
More informationOnline Courses for High School Students
Online Courses for High School Students 1-888-972-6237 Algebra I Course Description: Students explore the tools of algebra and learn to identify the structure and properties of the real number system;
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationConvergence of Sequences
James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 2 Homework Definition Let (a n ) n k be a sequence of real numbers.
More informationCS1800: Strong Induction. Professor Kevin Gold
CS1800: Strong Induction Professor Kevin Gold Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too
More informationSection 11.1: Sequences
Section 11.1: Sequences In this section, we shall study something of which is conceptually simple mathematically, but has far reaching results in so many different areas of mathematics - sequences. 1.
More informationInfinite Series. Copyright Cengage Learning. All rights reserved.
Infinite Series Copyright Cengage Learning. All rights reserved. Sequences Copyright Cengage Learning. All rights reserved. Objectives List the terms of a sequence. Determine whether a sequence converges
More informationFinding Limits Analytically
Finding Limits Analytically Most of this material is take from APEX Calculus under terms of a Creative Commons License In this handout, we explore analytic techniques to compute its. Suppose that f(x)
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 16 Sequences and
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationE = {x 0 < x < 1}. Z f(x) dx <.
Chapter Devastating Eamples Students of calculus develop an intuition for the subject typically based on geometric considerations. This intuition works adequately for problems in physics and engineering.
More informationSolution Sheet 1.4 Questions 26-31
Solution Sheet 1.4 Questions 26-31 26. Using the Limit Rules evaluate i) ii) iii) 3 2 +4+1 0 2 +4+3, 3 2 +4+1 2 +4+3, 3 2 +4+1 1 2 +4+3. Note When using a Limit Rule you must write down which Rule you
More informationa n b n ) n N is convergent with b n is convergent.
32 Series Let s n be the n-th partial sum of n N and let t n be the n-th partial sum of n N. For k n we then have n n s n s k = a i a i = t n t k. i=k+1 i=k+1 Since t n n N is convergent by assumption,
More informationHomework 1 Solutions
MATH 171 Spring 2016 Problem 1 Homework 1 Solutions (If you find any errors, please send an e-mail to farana at stanford dot edu) Presenting your arguments in steps, using only axioms of an ordered field,
More informationLecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018
CS17 Integrated Introduction to Computer Science Klein Contents Lecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018 1 Tree definitions 1 2 Analysis of mergesort using a binary tree 1 3 Analysis of
More informationTHE DIVISION THEOREM IN Z AND F [T ]
THE DIVISION THEOREM IN Z AND F [T ] KEITH CONRAD 1. Introduction In the integers we can carry out a process of division with remainder, as follows. Theorem 1.1. For any integers a and b, with b 0 there
More informationWe have been going places in the car of calculus for years, but this analysis course is about how the car actually works.
Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost
More informationThe Completion of a Metric Space
The Completion of a Metric Space Let (X, d) be a metric space. The goal of these notes is to construct a complete metric space which contains X as a subspace and which is the smallest space with respect
More information5.3 Other Algebraic Functions
5.3 Other Algebraic Functions 397 5.3 Other Algebraic Functions This section serves as a watershed for functions which are combinations of polynomial, and more generally, rational functions, with the operations
More informationLIMITS AND DERIVATIVES
2 LIMITS AND DERIVATIVES LIMITS AND DERIVATIVES The intuitive definition of a limit given in Section 2.2 is inadequate for some purposes.! This is because such phrases as x is close to 2 and f(x) gets
More information