# Section 3 Sequences and Limits, Continued.

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular this result ensures that if the it is non-zero then, for all sufficiently large n, the a n are not too close to 0. Proof Take ε = α / > 0 in the definition that {a n } n N has it α. The definition tells us that there exists N N such that for all n N. Thus a n α < α a n = α (α a n α + α a n 3 α by the triangle inequality, while a n = α (α a n α α a n α by Corollary.. If {a n } n N and {b n } n N are sequences we can form a new sequence {a n + b n } n N whose n-th term is a n + b n for all n N. Similarly we can form other, new, sequences {a n b n } n N and {a n b n} n N etc. Theorem 3.7 Let {a n } n N and {b n } n N be convergent sequences with n a n = α and n b n = β. Then (i {a n + b n } n N is convergent and n (a n + b n = α + β, (ii {a n b n } n N is convergent and n (a n b n = αβ, { (iii If a n 0 for all n N and α 0 then ( n a n =. α Proof Rough work a n }n N is convergent and (i Here we will examine (a n + b n (α + β = (a n α + (b n β a n α + b n β by the triangle inequality. So if we make both terms on

2 the right hand side less than ε/ then the left hand side will be less that ε as required. (ii Here we will examine a n b n αβ = a n b n αb n + αb n αβ = (a n αb n + α(b n β b n a n α + α b n β. Again we will make both terms on the RHS less than ε/. For this we will have to take account of b n (bounded since the sequence is convergent and α. (iii Here we will examine a n α = α a n a n α. We can make the numerator, α a n, small but we have to make sure that the denominator, in particular a n, does not also get too small. This, though, will follow from Lemma 3.6. End of rough work. Let ε > 0 be given. (i By definition, n a n = α implies that there exists N N such that a n α < ε/ for all n N. Similarly, n b n = β implies that there exists N N such that b n β < ε/ for all n N. Choose N = max(n, N. Then for n N we have, from the rough work above, (a n + b n (α + β a n α + b n β < ε + ε = ε. So we have verified the conditions of the definition that allow us to conclude n (a n + b n = α + β. (ii Since {b n } n N is convergent it is bounded (Theorem 3. so there exists M > 0 such that b n M for all n. Further, by taking M larger if necessary we can assume that M > α also. It is important that M is not 0.

3 Then, since n a n = α we have that there exists N 3 N such that a n α < ε M for all n N 3. Also, n b n = β implies that there exists N 4 N such that b n β < ε M for all n N 4. Choose N = max(n 3, N 4. Then, for n N, we have, from the rough work above, Hence n (a n b n = αβ. a n b n αβ b n a n α + α b n β M a n α + α b n β < M ε M + α ε M = ε + ε, since α < M, < ε, (iii Since α 0 we can apply Lemma 3.6 to {a n } n N to find N 5 such that α < a n for all n N 5. In which case a n α = α a n a n α < α a n α holds for all such n. Now, since n a n = α we can find N 6 N such that a n α < ε α for all n N 6. Choose N = max (N 5, N 6. Then for all n N we have a n α < α a n < α α ε α = ε. Hence n ( a n = α. 3

4 Corollary 3.8 Let {a n } n N and {b n } n N be convergent sequences with n a n = α and n b n = β. Then (i For any λ R, {λa n } n N is convergent and n (λa n = λα. (ii {a n b n } n N is convergent and n (a n b n = α β. (iii If b n 0 for all n N and β 0, then n ( an b n = α β. { an b n }n N is convergent with Proof (i λ, λ, λ,... is a convergent sequence with it λ. Use Theorem 3.7(ii with b n = λ for all n. (ii By part (i with λ =, if {b n } n N is convergent then { b n } n N is convergent. Now use Theorem 3.7(i with {a n } n N and { b n } n N. ( (iii By Theorem 3.7(iii n b n =. Now use Theorem 3.7(ii β { with b n }n N Example Find and {a n } n N. 4n 3 + 3n n 5n. 3 Solution Rough work. For very large n the numerator looks like 4n 3 (imagine evaluating 4n 3 + 3n with n = 0 on your calculator, to the significant figures shown on the calculator you would get the same result evaluating 4n 3 with n = 0 on your calculator. Similarly, for very large n the denominator looks like 5n 3. Hence for very large n the quotient looks like 4n 3 /( 5n 3 = 4/5. So we might guess that the it is 4/5. Next, we might try to use Corollary 3.8(iii to prove this. attempt might be to say 4n 3 + 3n (4n 3 + 3n n 5n = n 3 ( n 5n3. But we would be wrong. This is because Corollary 3.8(iii says that if the two sequences in the quotient converge individually Our first then the it of the quotient is the same as the quotient of the its. In our case the two sequences are {4n 3 + 3n} n N and { 5n 3 } n N, neither 4

5 of which converge. So, before an application of Corollary 3.8 we have to change these two sequences into ones that converge. The usual way is to divide the top and bottom of the quotient by the largest power of n in the bottom term (denominator. In the case, this means dividing top and bottom by n 3 to get sequences {4 + 3/n } n N and {/n 3 5} n N, both of which converge. End of rough work. From an earlier example we know that n = 0. We will use this n fact as follows. 4n 3 + 3n n = n 5n 3 n 5 n( = = = n n n n n ( The idea is to get terms on top and bottom that have finite its, ( 5 n 3 (Corollary 3.8(iii ( 3 n n n ( n n 5 3 n ( (Theorem 3.7 and Corollary n n ( 3 5 (Corollary 3.8(iii = 4 5 = 4 5. See also Question 8 Sheet 3 Example Let {a n } n N be the sequence defined recursively by a = 0, and a n+ = 4 (a n + for all n N. Show that this sequence is convergent and find its it. Solution Rough work. The first few terms are 0,, 5, 4 6 at these we might guess that the sequence is increasing since, ,.... Looking 0 < 4 = 4 6 < 5 6 = 0 64 < 64 = < We might also guess that the sequence is bounded above by, simply because the numerator of each term is smaller than the denominator. Hence we should be thinking of using Theorem

6 End of Rough work (i We will show by induction that a n a n+ holds for all n. If n = then a = 0 and a = in which case a 4 a holds as required. Assume true for n = k, so we are assuming that a k a k+ holds. (We hope to show that a k+ a k+ holds. Then a k a k+, a k + a k+ + + by assumption, adding to each term, (a 4 k + (a 4 k+ + dividing each term by 4, 4 a k+ a k+ < by the inductive definition of the sequence. So, a k+ a k+, i.e. the result is true for n = k +. Thus, by induction, a n a n+ for all n. So, {a n } n N is increasing (since a n a n+ for all n and bounded above by (since a n for all n. Hence, by Theorem 3.4, {a n } n N converges, with it α, say. (ii To find α we note that the sequences 0,, 5,,... and, the same it, i.e. both {a n } n and {a n+ } n N = { (a 4 n + } n N same it. Hence, 6 64,... have have the α = a n = a n+ = n n n 4 (a n + = ( 4 a n + by Theorem 3.7 and Corollary 3.8, n 4 = α From this we see that α = /3 as given in the theorem. Note In this problem we had to choose a number λ and then check that a n λ for all n. Here we chose λ =. How do we find λ? We should do some rough work first, assume that the it exists and run through the argument in part (ii above to find α = /3. We choose any λ /3, usually a simply value such, as in this case,. See also Questions 9 and 0 Sheet 3 6

7 In the proof of theorem 3.0 we will make use of the following result. Lemma 3.9 (Bernoulli s inequality. For all δ and all n we have ( + δ n + nδ. Proof by induction on n. If n = then we get equality. Assume true for n = k, so ( + δ k + kδ. (We now try to show that ( + δ k+ + (k + δ holds. Consider ( + δ k+ = ( + δ( + δ k ( + δ( + kδ by inductive assumption and + δ 0, = + δ + kδ + kδ > + (k + δ, dropping the kδ 0 term. Thus the result holds for n = k +. Hence, by induction, ( + δ n + nδ for all n. See also Question 8 Sheet 4 Theorem 3.0 (i For a fixed integer k, if k < 0, then {n k } n N is convergent and n n k = 0, if k = 0, then {n k } n N is convergent and n n k =, if k > 0, then {n k } n N is divergent. (ii For a fixed real number x, if x <, then {x n } n N is convergent and n x n = 0, if x =, then {x n } n N is convergent and n x n =, if x = or x >, then {x n } n N is divergent. Proof (i (Left to student. (ii Suppose x <. Let ε > 0 be given. If x = 0 then the result is clear. So suppose 0 < x <. In this case we use a TRICK and look at which satisfies >. Write x x x = + δ with δ > 0. By the Archimedean property we can find N N with < δε. Then, N for all n N, 7

8 x n 0 = x n = ( + δ, n + nδ by Lemma 3.9, < nδ Nδ < δε δ = ε. Therefore n x n = 0. Suppose x = then x n = for all n and n x n = is immediate. Suppose x = then the sequence is,,,,,,... which alternates and does not converge, i.e. it diverges. Suppose x >. Write x = + δ with δ > 0. Let λ > 0 be given. By the Alternative Archimedean property, Theorem., we can find N N with N > λ/δ. Then x N = ( + δ N + Nδ by Lemma 3.9, Nδ > λ δ δ = λ. Thus λ is not an upper bound for the sequence {x n } n N. But λ was arbitrary so there is no upper bound for {x n } n N, i.e. the sequence is unbounded. Therefore, by Corollary 3.3, the sequence is divergent. Theorem 3. (Sandwich Rule Let {b n } n N, {c n } n N be convergent sequences with the same it l and b n c n for all n N. Suppose {a n } n N satisfies b n a n c n for all n N. Then {a n } n N is convergent with it l. Proof Let ε > 0 be given. Since{b n } n N is convergent with it l there exists N N such that b n l ε for all n N. This means l ε < b n < l + ε. In particular, l ε < b n ( for all n N. Since{c n } n N is convergent with it l there exists N N such that c n l ε for all n N. In particular, c n < l + ε ( 8

9 for all n N. Let N = max (N, N. Then for all n N both ( and ( hold and so l ε < b n a n c n < l + ε. Thus a n l < ε for all n N as required.. Example Show that cos ( π n 4 = 0. n n Solution For all n we have ( π cos 4 n and so n cos ( π 4 n n. Thus the terms of our sequence are sandwiched by the sequences n and both of which have it 0. Hence, Theorem 3. gives the result. n Note We might try to use Theorem 3.7(ii and say ( cos n ( ( π = cos n n n n n 4 n ( π = 0 cos 4 n = 0. n ( See also Question Sheet 4 But we would be wrong! This is because Theorem 3.7(ii says that if the two sequences in the product converge individually then the it of the product is the product of the its. In our case the two sequences are {/n } n N and { cos ( π n}, the second 4 n N of which does not converge. Thus we cannot apply Theorem 3.7. Example Show that n + ( n n n ( n =. 9

10 Solution For all n we have n n + n + ( n n ( n n + n. So the terms of our sequence are sandwiched by the sequences /n +/n and +/n both of which have it. Hence, Theorem 3. gives the result. /n Appendix Theorem 3.0 (i For a fixed integer k, if k < 0, then {n k } is convergent and n n k = 0, if k = 0, then {n k } is convergent and n n k =, if k > 0, then {n k } is divergent. Proof (Not for examination. (i Suppose k < 0. Let ε > 0 be given. By the Archimedean property we can find N N with N < ε. Since k < 0 and k Z we must, in fact, have k and thus n k n for all n. Hence, for any n N we have n k 0 = n k n N < ε. Therefore n n k = 0. If k = 0 then n k = n 0 = for all n and so n n k =. Suppose k > 0. Let λ > 0 be given. By the Alternative Archimedean property, Theorem., we can find N N with N > λ. Since k > 0 and k Z we must, in fact, have k in which case N k N > λ. Thus λ is not an upper bound for {n k }. But λ was arbitrary so there is no upper bound for {n k }, i.e. the sequence is unbounded. Therefore, by Corollary 3.3, the sequence is divergent. Sufficiently large. We say that a property, p (n, that depends on a natural number n, holds for all sufficiently large n, if there exists N N such that p (n holds for all n N. There are sufficiently large variants of most of our results. For instance I leave it to the student to give a proof of the following: Let {b n } n N, {c n } n N be convergent sequences with the same it l. Suppose {a n } n N satisfies b n a n c n for all sufficiently large n then {a n } n N is convergent with it l. 0

### Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

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

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

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

### Practice Problems Solutions

Practice Problems Solutions The problems below have been carefully selected to illustrate common situations and the techniques and tricks to deal with these. Try to master them all; it is well worth it!

### ANALYSIS I. How do we get hold of a real number? Answer, we look at successive approximations. E.g.: 1000, , 1414

ANALYSIS I 5 Real and complex sequences 5. Real numbers in practice How do we get hold of a real number? Answer, we look at successive approximations. E.g.: Our task is to make all this precise... 5. Sequences,

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

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Notes: Chapter 2 Section 2.2: Proof by Induction

Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case - S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### 3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R.

CHAPTER 3 Sequences and Series 3.. Sequences and Their Limits Definition (3..). A sequence of real numbers (or a sequence in R) is a function from N into R. Notation. () The values of X : N! R are denoted

### Chapter 6 SEQUENCES. sn 1+1,s 1 =1 is again an abbreviation for the sequence { 1, 1 2, 1 } n N ε,d (s n,s) <ε.

Chapter 6 SEQUENCES 6.1 Sequences A sequence is a function whose domain is the set of natural numbers N. If s is a sequence, we usually denote its value at n by s n instead of s (n). We may refer to the

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

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

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

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

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### A sequence of real numbers or a sequence in R is a mapping f : N R.

A sequence of real numbers or a sequence in R is a mapping f : N R. A sequence of real numbers or a sequence in R is a mapping f : N R. Notation: We write x n for f(n), n N and so the notation for a sequence

### INTRODUCTION TO THE CONVERGENCE OF SEQUENCES

INTRODUCTION TO THE CONVERGENCE OF SEQUENCES BECKY LYTLE Abstract. In this paper, we discuss the basic ideas involved in sequences and convergence. We start by defining sequences and follow by explaining

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

### CHAPTER 3. Sequences. 1. Basic Properties

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

### 1 Norms and Vector Spaces

008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)

### 1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

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

### 1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution.

Name : Instructor: Marius Ionescu Instructions: 1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution. 3. If you need extra pages

### {f 1 (U), U F} is an open cover of A. Since A is compact there is a finite subcover of A, {f 1 (U 1 ),...,f 1 (U n )}, {U 1,...

44 CHAPTER 4. CONTINUOUS FUNCTIONS In Calculus we often use arithmetic operations to generate new continuous functions from old ones. In a general metric space we don t have arithmetic, but much of it

### Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

### FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

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

### Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

### Math 317 HW #7 Solutions

Math 17 HW #7 Solutions 1. Exercise..5. Decide which of the following sets are compact. For those that are not compact, show how Definition..1 breaks down. In other words, give an example of a sequence

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### 0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup

456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),

### Homework 2 Solutions

Homework Solutions 1. (a) Find the area of a regular heagon inscribed in a circle of radius 1. Then, find the area of a regular heagon circumscribed about a circle of radius 1. Use these calculations to

### Algebraic and Transcendental Numbers

Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)

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

### Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### COMP 250 Fall Mathematical induction Sept. 26, (n 1) + n = n + (n 1)

COMP 50 Fall 016 9 - Mathematical induction Sept 6, 016 You will see many examples in this course and upcoming courses of algorithms for solving various problems It many cases, it will be obvious that

### On continued fractions of the square root of prime numbers

On continued fractions of the square root of prime numbers Alexandra Ioana Gliga March 17, 2006 Nota Bene: Conjecture 5.2 of the numerical results at the end of this paper was not correctly derived from

### Our goal first will be to define a product measure on A 1 A 2.

1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ -algebra A 1 A 2 with the unit element is the σ -algebra generated by the

### BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

### Series Convergence Tests Math 122 Calculus III D Joyce, Fall 2012

Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it

### Lecture 12: Sequences. 4. If E X and x is a limit point of E then there is a sequence (x n ) in E converging to x.

Lecture 12: Sequences We now recall some basic properties of limits. Theorem 0.1 (Rudin, Theorem 3.2). Let (x n ) be a sequence in a metric space X. 1. (x n ) converges to x X if and only if every neighborhood

### LIMITS AND CONTINUITY

LIMITS AND CONTINUITY 1 The concept of it Eample 11 Let f() = 2 4 Eamine the behavior of f() as approaches 2 2 Solution Let us compute some values of f() for close to 2, as in the tables below We see from

### sin(x) < x sin(x) x < tan(x) sin(x) x cos(x) 1 < sin(x) sin(x) 1 < 1 cos(x) 1 cos(x) = 1 cos2 (x) 1 + cos(x) = sin2 (x) 1 < x 2

. Problem Show that using an ɛ δ proof. sin() lim = 0 Solution: One can see that the following inequalities are true for values close to zero, both positive and negative. This in turn implies that On the

### Notes on metric spaces

Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

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

### Chapter 2 Sequences and Series

Chapter 2 Sequences and Series 2. Sequences A sequence is a function from the positive integers (possibly including 0) to the reals. A typical example is a n = /n defined for all integers n. The notation

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

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

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### I. Pointwise convergence

MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.

### 1. Let X and Y be normed spaces and let T B(X, Y ).

Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

### Week 1: Introduction to Online Learning

Week 1: Introduction to Online Learning 1 Introduction This is written based on Prediction, Learning, and Games (ISBN: 2184189 / -21-8418-9 Cesa-Bianchi, Nicolo; Lugosi, Gabor 1.1 A Gentle Start Consider

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

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### Introduction to Topology

Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

### SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

### Tiers, Preference Similarity, and the Limits on Stable Partners

Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider

### The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

### t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction

### Separation Properties for Locally Convex Cones

Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

### MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### The Epsilon-Delta Limit Definition:

The Epsilon-Delta Limit Definition: A Few Examples Nick Rauh 1. Prove that lim x a x 2 = a 2. (Since we leave a arbitrary, this is the same as showing x 2 is continuous.) Proof: Let > 0. We wish to find

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

### Mathematical Induction

Mathematical Induction William Cherry February 2011 These notes provide some additional examples to supplement the section of the text on mathematical induction. Inequalities. It happens that often in

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

### v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.

3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

### Mathematical Induction. Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition)

Mathematical Induction Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition) Mathmatical Induction Mathmatical induction can be used to prove statements that assert that P(n) is true for all positive

### Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Kim S. Larsen Odense University Abstract For many years, regular expressions with back referencing have been used in a variety

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Copyright Cengage Learning. All rights reserved.

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### This section demonstrates some different techniques of proving some general statements.

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

### Some Problems of Second-Order Rational Difference Equations with Quadratic Terms

International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### Chapter 1. Metric Spaces. Metric Spaces. Examples. Normed linear spaces

Chapter 1. Metric Spaces Metric Spaces MA222 David Preiss d.preiss@warwick.ac.uk Warwick University, Spring 2008/2009 Definitions. A metric on a set M is a function d : M M R such that for all x, y, z

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and