Chapter 9 Sequences, Series, and Probability Section 9.4 Mathematical Induction

Similar documents
Set Notation Review. N the set of positive integers (aka set of natural numbers) {1, 2, 3, }

6.3 Testing Series With Positive Terms

Math 2412 Review 3(answers) kt

Unit 6: Sequences and Series

Recurrence Relations

Section 6.4: Series. Section 6.4 Series 413

is also known as the general term of the sequence

Section 7 Fundamentals of Sequences and Series

Infinite Sequences and Series

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

1 Generating functions for balls in boxes

11.1 Arithmetic Sequences and Series

XT - MATHS Grade 12. Date: 2010/06/29. Subject: Series and Sequences 1: Arithmetic Total Marks: 84 = 2 = 2 1. FALSE 10.

E. Incorrect! Plug n = 1, 2, 3, & 4 into the general term formula. n =, then the first four terms are found by

INFINITE SEQUENCES AND SERIES

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

Part I: Covers Sequence through Series Comparison Tests

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

VERY SHORT ANSWER TYPE QUESTIONS (1 MARK)

10.6 ALTERNATING SERIES

Sect 5.3 Proportions

Topic 5: Basics of Probability

Math 113 Exam 4 Practice

Math 113 Exam 3 Practice

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Bertrand s Postulate

Series: Infinite Sums

SEQUENCES AND SERIES

MAT 271 Project: Partial Fractions for certain rational functions

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

, 4 is the second term U 2

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

1. n! = n. tion. For example, (n+1)! working with factorials. = (n+1) n (n 1) 2 1

5 Sequences and Series

MATH 304: MIDTERM EXAM SOLUTIONS

Math 220A Fall 2007 Homework #2. Will Garner A

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Regent College Maths Department. Further Pure 1. Proof by Induction

Signals & Systems Chapter3

Properties and Tests of Zeros of Polynomial Functions

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

Summer High School 2009 Aaron Bertram

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

INFINITE SEQUENCES AND SERIES

CHAPTER 2 SEQUENCES AND SERIES OUTLINE Geometric Series Infinite Geometric Series and Sigma Notation 4 Review

MAT1026 Calculus II Basic Convergence Tests for Series

Sequences and Series 4

SOME TRIBONACCI IDENTITIES

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

INTEGRATION BY PARTS (TABLE METHOD)

Curve Sketching Handout #5 Topic Interpretation Rational Functions

Essential Question How can you use properties of exponents to simplify products and quotients of radicals?

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

Chapter 10: Power Series

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION

P.3 Polynomials and Special products

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

SOME NEW OBSERVATIONS ON MERSENNE NUMBERS AND PRIMES

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

Intermediate Math Circles November 4, 2009 Counting II

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

Review for Test 3 Math 1552, Integral Calculus Sections 8.8,

4 Mathematical Induction

CS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2

+ au n+1 + bu n = 0.)

DEPARTMENT OF ACTUARIAL STUDIES RESEARCH PAPER SERIES

1. Hilbert s Grand Hotel. The Hilbert s Grand Hotel has infinite many rooms numbered 1, 2, 3, 4

An alternating series is a series where the signs alternate. Generally (but not always) there is a factor of the form ( 1) n + 1

Math 105 TOPICS IN MATHEMATICS REVIEW OF LECTURES VII. 7. Binomial formula. Three lectures ago ( in Review of Lectuires IV ), we have covered

Series Review. a i converges if lim. i=1. a i. lim S n = lim i=1. 2 k(k + 2) converges. k=1. k=1

} is said to be a Cauchy sequence provided the following condition is true.

EECE 301 Signals & Systems

Long-term Memory Review CRT PRACTICE 8 th Grade: MONDAY REVIEW STATE STANDARDS AND 2.8.2

Midterm Exam #2. Please staple this cover and honor pledge atop your solutions.

Sequences, Sums, and Products

Part A, for both Section 200 and Section 501

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Math 113 Exam 3 Practice

PROPERTIES OF THE POSITIVE INTEGERS

Induction: Solutions

If we want to add up the area of four rectangles, we could find the area of each rectangle and then write this sum symbolically as:

Metric Space Properties

Essential Question How can you recognize an arithmetic sequence from its graph?

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis

Generating Functions II

Mathematical Induction

Order doesn t matter. There exists a number (zero) whose sum with any number is the number.

MISCELLANEOUS SEQUENCES & SERIES QUESTIONS

The Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1

1. By using truth tables prove that, for all statements P and Q, the statement

Testing for Convergence

Polynomial Functions and Their Graphs

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

These Two Weeks. Mathematical Induction Chapter 4 Lecture 10 & Lecture 13. CPRE 310 Discrete Mathematics. Mathematical Induction Problems

9.3 The INTEGRAL TEST; p-series

Created by T. Madas SERIES. Created by T. Madas

Transcription:

Chapter 9 equeces, eries, ad Probability ectio 9. Mathematical Iductio ectio Objectives: tudets will lear how to use mathematical iductio to prove statemets ivolvig a positive iteger, recogize patters ad write the th term of a sequece. tudets will fid sums of powers of itegers ad fid fiite differeces of sequeces. Math Aalysis.0: tudets ca give proofs of various formulas by usig the techique of mathematical iductio. Example Fid P + for each give P. a b c P + P + + + + + + ( 6 P ( + 6 6 6 P + + + + + ( + (( + + ( ( + P 6 ( + + + + P + 6 6 + + 6 ( + 6( + + d P ( + + + ( ( + P ( + + + + + ( + [What you practiced above is ecessary for what we will lear today, which is a way to prove formulas are true.] I. Itroductio The Priciple of Mathematical Iductio: o Let P be a statemet ivolvig the positive itegers. If. P is true, ad. Aytime P is true P + is also true for every positive iteger, the P must be true for all positive itegers.

Example Use mathematical iductio to prove the followig formula: ( + + + + +. ( +. is true. Therefore, the formula is valid for.. Assume that the formula is valid for is true, ad show that + is also true. ( + + + + + + ( + ( + + + + + + ( + + ( + Now show that the right side is "true" too. ( + ( + + + + + + + ( + ( + + is the ext term, which is what you get whe you add ( +. The ext term,, ca be gotte by addig ( + to both sides. Fid the commo deomiator so that you ca add the fractios together. Factor ad show that the ed result is the same as the give: ice + ( + ( + (( + + ( + ( + Example Use mathematical iductio to prove 7 9 ( ( + + + + + +.. how that the statemet is true for. ( +.. Assume that 7 9 ( ( + 7+ 9+ + ( + ( + + 7+ 9+ + ( + + ( + ( + ( + + ( + ( + ( + + ( + + They are the same, so the proof is doe! + + + + + + is true. The show that + is also true. + + + + 6 + + + ( ( Add the ext term i to both sides of the equatio. Remember lie what we practiced i Ex? ( ( (( ( ( If + The s + + + + + +

Example Use mathematical iductio to prove the followig formula: ( + + + + +. ( +.. Therefore the formula is valid for.. Assume that the formula is valid for, ad the show that it is valid for +. + + + + ( + ( ( + ( + ( ( + ( + ( + + + + + + + ( + + ( + + + + + ( ( + + + + ( + + + Therefore, the formula is valid for all positive itegers. The ext term,, ca be gotte by addig ( + to both sides. Fid the LCD so we ca add the two fractios together. Let s try somethig more elegat. ee how both fractios have( +? Factor out ( + from both. This ed result is the same as the give: ( + ( + ( + + + + ( ( (

Example Use mathematical iductio to prove the followig formula: ( ( ( (. how the statemet is true for. (. Assume that ( ( ( ( ( ( + + + + +. We do t ever really show that it s ( ( +. true for,,, but we could. For istace, whe : ( ( + + + + + ( + ( 0+ We have to show that it s also true for +. ( ( + ( ( ( ( + ( + ( + ( + + ( ( ( + ( + ( + ( + + ( + ( + (( + + ( + (( + ( ( + ( + ( + Let's try doig the more "elegat" way agai. What do the two fractios have i commo? ( + + Agai, compare the ed result with the give: + ( + ( ( + ( + ( + ( + (( + (( + + ( + ( ( + They are the same. Woo hoo!

DAY TWO II. Patter Recogitio ometimes we do ot have a formula that applies. o we the have to produce (come up with a formula through patter recogitio ad the prove it by mathematical iductio. Why? How do you ow the formula will always wor? You eed to prove it. The way to do so is by Iductio. Example Fid the formula for the fiite sum ad prove it by mathematical iductio., 7,,,,. Let s first list come partial sums to see if we ca determie the patter: + 7 0 + 7+ 7 + 7 + + 6 9 ( icreasig odd umbers ( + Now this is just a guess. ice we came up with this patter o our ow, we eed to prove that it will wor for ALL itegers.. how that it is true for. s ( ( + (. + 7+ + + + ( ( + + 7+ + + + ( + ( ( + ( + + ( ( + ( + + ( ( + + + ( +. Assume that + + + + + ( ( + + This may ot loo lie ( ( ( ( + + + + + + from above, but it is...try looig at it thisway Compare the results to the give: ( ( + ( + ( [ ] ( ( + + + + + + + We foud ad proved a ew formula!

Example Fid a formula for the th partial sum of a ( + ( + We eed to first fid some partial sums to ote the patter:, ad the prove by mathematical iductio. ( + 8 + + ( + + + + + + 6 6 0 0 0 0 6 8 + 7 8 + + + + + 6 67 67 6 7 67 + It appears that ( + ( (. o we eed to prove this formula wors by mathematical iductio.. We already ow is valid (from above.. We assume the formula is valid for, ad the show it is valid for +. + + + + 6 + + + + + ( + + ( + ( + ( + + ( + ( + ( ( ( + + + + + + 6 ( + ( + ( + + ( + + ( + ( + + ( + + + ( + ( + + ( + + + ( + ( + ( + + + + + + + ( ( ( + ( + + ( + ( This result is the same as the give: ( + + + ( + ( + + + ( + + Therefore, the formula is valid for all positive itegers. ( Add the ext term to both sides to get.

III. ums of Powers of Itegers The followig formulas are called the ums of Powers of Itegers ( + + + + + + + + + ( + ( + 6 ( + + + + + + + + + 0 + + + + ( + ( + ( + ( + ( + Example Fid the followig sums. a. 0 ( + ( + 0 0 0 0 0,8 b. 8 i ( + ( + ( + 89 ( ( 7( 6 + 8 i i i i i 877 0 0 c. ( i i i i i i i ( ( ( i i+ i+ i i+ 6 ( 6 ( 6 ( 6 6 7 90 0 0 0 d. ( 7 7 ( ( ( + + + 7 6 ( ( ( 0 0 7 6 0 70 880