Monotone Sequences & Cauchy Sequences Philippe B. Laval

Similar documents
The Cauchy Criterion

Proofs of a Trigonometric Inequality

1.6 Congruence Modulo m

SOLUTIONS TO PROBLEM SET 5. Section 9.1

TOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

Non-overlapping permutation patterns

Permutation Groups. Definition and Notation

ON SPLITTING UP PILES OF STONES

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00

1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =

ON THE EQUATION a x x (mod b) Jam Germain

SOLUTIONS FOR PROBLEM SET 4

PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania

Recursive Sequences. EQ: How do I write a sequence to relate each term to the previous one?

Permutations with short monotone subsequences

THE GAME CREATION OPERATOR

Gauss and AGM. Burton Rosenberg. January 30, 2004

Notes for Recitation 3

Power = 36² mod 99 Power = 9 5 a 5 = 0 x = 81 Power = 9² mod 99 Power = 81 6 a 6 = 1 x = 81 x 81 mod 99 x = 27 7 a 7 = 1 x = 27 x 27 mod 99 x = 36

Assignment 2. Due: Monday Oct. 15, :59pm

Dealing with some maths

18 Completeness and Compactness of First-Order Tableaux

Arithmetic Sequences Read 8.2 Examples 1-4

CLASS NOTES. A mathematical proof is an argument which convinces other people that something is true.

arxiv: v3 [math.co] 4 Dec 2018 MICHAEL CORY

JMG. Review Module 1 Lessons 1-20 for Mid-Module. Prepare for Endof-Unit Assessment. Assessment. Module 1. End-of-Unit Assessment.

The Four Numbers Game

NUMBER THEORY AMIN WITNO

It is important that you show your work. The total value of this test is 220 points.

Applications of Fermat s Little Theorem and Congruences

Modular arithmetic Math 2320

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.

Carmen s Core Concepts (Math 135)

AN INEQUALITY ON TERNARY QUADRATIC FORMS IN TRIANGLES

Foundations of Cryptography

arxiv: v1 [math.co] 17 May 2016

Honors Precalculus Chapter 9 Summary Basic Combinatorics

Modular Arithmetic. Kieran Cooney - February 18, 2016

A variation on the game SET

arxiv: v1 [math.co] 30 Nov 2017

CSE 20 DISCRETE MATH. Fall

arxiv: v1 [math.co] 8 Oct 2012

Olympiad Combinatorics. Pranav A. Sriram

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1

arxiv: v1 [math.co] 31 Dec 2018

TILLING A DEFICIENT RECTANGLE WITH T-TETROMINOES. 1. Introduction

Unit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION

An elementary study of Goldbach Conjecture

arxiv: v1 [math.co] 7 Jan 2010

BAND SURGERY ON KNOTS AND LINKS, III

SMT 2014 Advanced Topics Test Solutions February 15, 2014

Greedy Flipping of Pancakes and Burnt Pancakes

NIM Games: Handout 1

How to Become a Mathemagician: Mental Calculations and Math Magic

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

MAT Modular arithmetic and number theory. Modular arithmetic

Georgia Tech HSMC 2010

arxiv: v3 [cs.cr] 5 Jul 2010

Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

Fermat s little theorem. RSA.

Section 2.3 Task List

Reading 14 : Counting

The Real Number System and Pythagorean Theorem Unit 9 Part B

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12

Modular Arithmetic. claserken. July 2016

CSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: 3-cent and 5-cent coins. 1. Mathematical Induction Proof

2.1 inductive reasoning and conjecture ink.notebook. September 07, Page 55. Ch 2. Reasoning. Page 56. and Proofs. 2.1 Inductive.

Unique Sequences Containing No k-term Arithmetic Progressions

Closed Almost Knight s Tours on 2D and 3D Chessboards

Number Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory

Lossy Compression of Permutations

To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2

Consecutive Numbers. Madhav Kaushish. November 23, Learning Outcomes: 1. Coming up with conjectures. 2. Coming up with proofs

Three Pile Nim with Move Blocking. Arthur Holshouser. Harold Reiter.

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)

Algebra. Recap: Elements of Set Theory.

Launchpad Maths. Arithmetic II

PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES

On Variants of Nim and Chomp

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

Dyck paths, standard Young tableaux, and pattern avoiding permutations

Arithmetic Properties of Combinatorial Quantities

Wilson s Theorem and Fermat s Theorem

College Pre-Calc Lesson Plans

Discrete Math Class 4 ( )

A Fractal which violates the Axiom of Determinacy

Norman Do. Department of Mathematics and Statistics, The University of Melbourne, VIC

The Arithmetic of Receiver Scheduling for Electronic Support

Solutions to Exercises Chapter 6: Latin squares and SDRs

MA10103: Foundation Mathematics I. Lecture Notes Week 3

ON OPTIMAL PLAY IN THE GAME OF HEX. Garikai Campbell 1 Department of Mathematics and Statistics, Swarthmore College, Swarthmore, PA 19081, USA

Section V.1.Appendix. Ruler and Compass Constructions

THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m

Sequence and Series Lesson 6. March 14, th Year HL Maths. March 2013

Research Article n-digit Benford Converges to Benford

Solutions for the Practice Questions

Computability of Tilings

Combinatorics in the group of parity alternating permutations

Transcription:

Monotone Sequences & Cauchy Sequences Philippe B. Laval

Monotone Sequences & Cauchy Sequences 2 1 Monotone Sequences and Cauchy Sequences 1.1 Monotone Sequences The techniques we have studied so far require we know the limit of a sequence in order to prove the sequence converges. However, it is not always possible to find the limit of a sequence by using the definition, or the limit rules. This happens when the formula defining the sequence is too complex to work with. It also happens with sequences defined recursively. Furthermore, it is often the case that it is more important to know if a sequence converges than what it converges to. In this section, we look at two ways to prove a sequence converges without knowing its limit. We begin by looking at sequences which are monotone and bounded. These terms were defined at the beginning of this chapter. You will recall that in order to show that a sequence is increasing, several methods can be used. (1) Direct approach,simply show that a n+1 a n for every n. (2) Equivalently, show that a n+1 a n 0 for every n. (3) Equivalently, show that a n+1 1 for every n if both a n and a n+1 are positive. a n

Monotone Sequences & Cauchy Sequences 3 (4) If a n = f (n), one can show a sequence (a n ) is increasing by showing that f is increasing that is by showing that f (x) 0. (5) By induction. We now state and prove an important theorem about the convergence of increasing sequences. Theorem 1 An increasing sequence (a n ) which is bounded above converges. Furthermore, lim n a n =sup{a n }. Corollary 2 A decreasing sequence (a n ) which is bounded below converges. Furthermore, lim n a n =inf{a n }. Theorem 3 A monotone sequence converges if and only if it is bounded. Example 1 Provethatthesequencewhosegeneraltermisa n = n 1 k! converges. k=0

Monotone Sequences & Cauchy Sequences 4 Example 2 Find lim n a n where (a n ) is defined by: a 1 =2 a n+1 = 1 2 (a n +6) Example 3 Let a n = ( 1+ 1 n) n. Show lim a n exists. This limit is in fact the number e, but we won t show that. Again, to show that (a n ) converges, we show that it is increasing and bounded above. 1.2 Cauchy Sequences Definition 1 (Cauchy Sequence) Asequence(x n ) is said to be a Cauchy sequence if for each ɛ>0 there exists a positive integer N such that m, n > N = x m x n <ɛ. We begin with some remarks. Remark 1 These series are named after the French mathematician Augustin Louis Cauchy (1789-1857). Remark 2 It is important to note that the inequality x m x n < ɛ must be valid for all integers m, n that satisfy m, n > N. In particular, am sequence (x n ) satisfying x n+1 x n <ɛfor all n>nmay not be a Cauchy sequence.

Monotone Sequences & Cauchy Sequences 5 Remark 3 A Cauchy sequence is a sequence for which the terms are eventually close to each other. Remark 4 In theorem??, we proved that if a sequence converged then it had to be a Cauchy sequence. In fact, as the next theorem will show, there is a stronger result for sequences of real numbers. We now look at some examples. Example 4 Consider (x n ) where x n = 1. Prove that this is a n Cauchy sequence. Example 5 Consider (x n ) where x n = n k=1 1 k 2 We now look at important properties of Cauchy sequences. Theorem 4 Every Cauchy sequence is bounded. Theorem 5 A sequence of real numbers converges if and only if it is a Cauchy sequence. Remark 5 The key to this theorem is that we are dealing with a sequence of real numbers. The fact that a Cauchy sequence of

Monotone Sequences & Cauchy Sequences 6 real number converges is linked to the fact that R is complete. In fact, this is sometimes used as a definition of completeness. Some texts say that a set is complete if every Cauchy sequence converges in that set. It is possible to find a Cauchy sequence of rational numbers which does not converge in Q. We finish this section with an important theorem. Definition 2 A nested sequence of intervals is a sequence {I n } of intervals with the property that I n+1 I n for all n. Theorem 6 (Nested Intervals) If {[a n,b n ]} is a nested sequence of closed intervals then there exists a point z that belongs to all the intervals. Furthermore, if lim a n =limb n then the point z is unique. 1.3 Exercises (1) Prove that n! 2 n 1 for every n 1 (2) Prove that if k is an integer such that 1 <k n,then ( n (n 1) (n 2)... (n k +1) = 1 1 )( 1 2 )... n k n n (3) Prove that the sequence given by a 1 =2 a n+1 = 1 2 (a n +6) ( 1 k n

Monotone Sequences & Cauchy Sequences 7 is increasing and bounded above by 6. (hint: use induction for both). (4) Show that the sequence defined by a 1 =1 a n+1 =3 1 a n is increasing and satisfies a n < 3 for all n. Then, find its limit. (5) Let a and b be two positive numbers such that a>b.leta 1 be their arithmetic mean, that is a 1 = a + b 2.Letb 1 be their geometric mean, that is b 1 = ab. Define a n+1 = a n + b n 2 and b n+1 = a n b n. (a) Use mathematical induction to show that a n >a n+1 > b n+1 >b n. (b) Deduce that both (a n ) and (b n ) converge. (c) Show that lim a n = lim b n. Gauss called the common value of these limits the arithmetic-geometric mean. (6) Prove theorem 4. (7) Answer the why? parts in the proof of theorem 5. (8) Finish proving theorem 6.