Mathematical Induction
|
|
- Jerome Reynard Warren
- 5 years ago
- Views:
Transcription
1 Mathematical Iductio
2 Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a proof by iductio, we show that P(1) is true, ad that wheever P() is true for some, P + 1 must also be true. I other words, we show that the coditioal P P( + 1) is true for all. This creates a logical chai reactio the truth of P(1) implies the truth of P(), which implies the truth of P(3), which implies the truth of P 4, ad so o. O the ext slide, we will restate this so-called priciple of iductio, prove it, ad itroduce some termiology.
3 The Priciple of Iductio Theorem (Priciple of Iductio): Suppose P() is a statemet for every atural umber. Further suppose that 1. The first statemet, P(1) is true.. For every, the coditioal P P( + 1) is true. The P() is true for all. Proof: Suppose P() is ot true for all. The there must be at least oe for which it is false. Let 0 be the smallest of all these. Sice we kow that P(1) is true, 0. Sice 0 is the smallest for which P() is false, ad 0 1 is a atural umber, P( 0 1) is true. By assumptio, the coditioal P 0 1 P( 0 ) is true as well, hece P( 0 ) is true. That is a cotradictio because P( 0 ) is false. This proves that P() is true for all. I a iductive proof, verifyig coditio 1 is called the base case or basis step. Verifyig coditio is called the iductio step or iductive step. We verify coditio by assumig that P is true (called the iductive hypothesis) for some arbitrary, ad showig that the P + 1 is true as well.
4 The Reamig Ritual May textbooks, icludig Rose, highlight the fact that the iductive hypothesis is made about some arbitrary value by givig this a ew ame such as k. I the iductive hypothesis, rather tha assumig P for some arbitrary, they assume P for some arbitrary = k" ad the demostrate that P k + 1 must be true as well. This reamig ritual is ot ecessary, ad has the disadvatage that it may cause serious cofusio whe the statemet about already ivolves some variable amed k. The slide titled Commo Mistakes (4) illustrates this.
5 Example Ia Let us prove by iductio that for all atural umbers, k = ( + 1) (This equatio is the statemet P. ) 1. Base case: we verify P 1. σ1 k = 1 is true.. Iductive step: let us assume P for some arbitrary, i.e. k = + 1 We ow add the ext term of the summatio, which i this case happes to be + 1, to both sides. O the left side, that upgrades the sum to the ext higher upper limit. O the right, we hope that the right side of P( + 1) emerges. (Note that geerally, whe you write a iductive proof, the statemet P( + 1) will NOT be produced by addig + 1 to both sides of P(). That algebraic maipulatio is SPECIFIC to this example.) This statemet, +1 k = ( + 1) = +1 k = = ( + 1)( + ) ( + 1)( + ) is the statemet P + 1. We just completed the iductive step: we showed that if P is true, the P + 1 is true as well. That completes the proof by iductio.,
6 P( + 1) is ot geerally obtaied by addig + 1 to both sides of P(). It bears repeatig: the algebraic maipulatio we used to obtai P( + 1) from P() i the first example is specific to that example ad oly works because the quatity uder examiatio grows by + 1 as we step from the case to the case + 1. Each iductive proof requires its ow, idividual algebraic steps to coclude that P( + 1) must be true if P() is true. The ext page demostrates a slightly differet algebraic perspective for provig summatio formulas. Istead of addig to the summatio formula we are assumig is already true, we ca split the ext summatio ito what we already kow about, plus the ext term.
7 Example Ia, doe a little differetly Let us prove by iductio that for all atural umbers, k = ( + 1) 1. Base case: we verify the summatio for =1: 1 = 1. This is true.. Iductive step: let us assume that we already kow σ k = for some arbitrary. The we split the ext sum ito the sum we already kow, plus the ext term: +1 k = k We ow use the iductive hypothesis o the sum we already kow: k = ( + 1) = = ( + 1)( + ). This statemet +1 k = ( + 1)( + ), is the case +1 of our summatio formula. That completes the proof by iductio.
8 Commo Mistakes (1) Studets ofte cofuse the statemet P() with the algebraic expressio about which a statemet is beig made. They abuse the otatio P(). I the previous example, we proved the statemet P : = k = ( + 1) for all. Notice the paretheses - P is ot the sigma sum, ad it s ot the expressio (+1). It is the statemet that these two quatities are equal. Therefore, you must ot write equatios like P = (+1) i your iductive proofs, if P() has bee agreed upo to be the statemet you are provig. If you must have a otatio for a expressio that is frequetly referred to, you are free to defie your ow otatio for it, for example, ( + 1) a = but you must ot use P. You must also ot write equatios like this: ( + 1) P = k = Without the critical paretheses, P is o loger the statemet that the middle ad right quatity are equal. It is the commo value of that quatity. So o top of usig wrog otatio, you are assumig the coclusio of the proof with this.
9 It s best to avoid the abstractio of P() i actual iductive proofs To describe the method of iductio i theory, it was useful to have a otatio P() to refer to the sequece of statemets we are provig. I practice though, usig this otatio is ofte worse tha useless. It s just as easy, ad better writig style, to refer verbally to the statemet we are provig. This way, you avoid ay risk of makig the mistake described o the previous page, of abusig P() to refer to both a quatity ivolved i the statemet we are provig ad the statemet itself. Observe how the followig example proofs all do without the otatio P() ad are better for it.
10 Let us prove by iductio that for all atural umbers, Example Ib k = ( + 1)( + 1) Base case: we verify the summatio formula for =1: 1 = 1 3. This is true. 6. Iductive step: let us assume that we have already proved the summatio for some arbitrary, i.e. k = ( + 1)( + 1). 6 We ow add the ext term of the summatio, which i this case is + 1, to both sides. O the left side, that upgrades the sum to the ext higher upper limit. O the right, we expect that the expressio (+1)(+)(+3) 6 emerge. (Observe that the ext term of the summatio is NOT + 1 here. ) will +1 k = ( + 1)( + 1) = ( + 1) = ( + 1) This statemet, = = +1 k =, ( + )( + 3) 6 ( + 1)( + )(( + 1) + 1) + 1 = 6 ( + 1)( + )(( + 1) + 1) 6 Observe that prudet, early factorig, rather tha bruteforce distributig, is the algebraic key to a efficiet, readable solutio here. is the summatio formula for the case +1. We just completed the iductive step: we showed that if the formula holds for oe, the it also holds for the ext. That completes the proof by iductio.
11 Commo Mistakes () A secod, somewhat commo mistake is to cofuse statig P + 1 does ot prove it. with provig it. Merely statig it The followig variatio of the iductive step of Example 1 illustrates that mistake: Let us assume that P is true for some, i.e. The P + 1 is the statemet This completes the proof by iductio. +1 k = k = ( + 1) ( + 1)( + ) The psychology of this mistake seems to be that merely writig P + 1 required some algebra work. You had to replace each by +1 ad simplify, so it may feel like you did somethig. You did, you just did t prove P + 1. Agai the otatio P() is best avoided completely whe you write iductive proofs. It is used here oly because it is coveiet to describe the mistake i questio.
12 Commo Mistakes (3) Whe P is a summatio formula, people may cofuse the with the ruig variable i the summatio. We earlier proved that k = ( + 1) is true for all. Notice that both sides are fuctios of aloe: is the ONLY free variable i this formula. You may thik that you are seeig aother free variable, k, o the left, but this halluciatio is easily dispelled by rememberig the meaig of the sigma otatio: it meas simply Our formula is = + 1 There is o k there. If you replace k by k + 1, you simply break the sigma sum ad tur it ito somethig urelated. People who are uclear about the distictio betwee k ad may thik that they eed to icremet k whe they form σ +1 k, either istead of icremetig, or i additio to it:. Neither is equal to σ +1 k. +1 (k + 1 ) or (k + 1). From a programmig perspective, you ca thik of the k iside the sigma otatio as a local variable iside a fuctio that is ivisible from the outside. fuctio sum(it ) it sum = 0; for (it ;k<=;k++) sum +=k;
13 Commo Mistakes (4) If you practice the reamig ritual of assumig i the iductive step that P is true for some = k rather tha just for some, ad if your P ivolves a sigma sum that uses k as a ruig variable, you re i dager of writig wholly osesical expressios like this: k k If you do t see what s wrog with that, cosider the followig equivalet code: fuctio sum(it k) it sum = 0; for (it ;k<=k;k++) sum +=k; The best way to avoid this is to ot reame the iductio variable ad to assume that P is true for some i the iductive step.
14 Commo Mistakes (4a) Practicig the reamig ritual ca make you feel like you assumed somethig i the iductive step whe you assumed othig. Some studets write the followig icorrect iductive hypothesis: Suppose = k. This is meaigless, because it is assumig that a udefied variable is equal to a udefied variable k; or that the udefied variable ow has the ew ame k. It s ot eve a propositio. It s omittig the etire poit of the iductive hypothesis, which is the assumptio that what we are tryig to prove has already bee proved for some arbitrary value. If you isist, you may give this arbitrary value the special ame k (uless k is already beig used as a ruig variable i a sigma sum.) However, you must ot thik that Suppose = k meas the same as Suppose we already kow that P() is true for some arbitrary = k.
15 Commo Mistakes (5) What s wrog with the followig iductive step? Iductive Step. Let us assume P() is true for all.. I the iductive step, we prove that the coditioal P P( + 1) is true for all, i.e. we prove P P + 1. We do this by assumig that P() is true for some (arbitrary), which sets up uiversal geeralizatio. The we show that P + 1 must be true as well. By uiversal geeralizatio, sice our was arbitrary, that shows P P + 1. I the proof fragmet above, it is assumed that P() is true for all. That is assumig the coclusio. If we already kow that P() is true for all, we do t eed a proof.
16 Commo Mistakes (6) Some studets who practice the reamig ritual cofuse the act of givig the specific for which we assume P() is already proved i the iductive step a ew ame with the act of assumig that P() has already bee proved. Istead of writig Iductive Step. Let us assume P() for some = k, they write Iductive Step. Assume = k. This is meaigless sice i that assumptio, ad k are just two udefied variables. Eve if was defied, givig a ew ame is ot the same as assumig that P() is true. The geeral theme of this misuderstadig is to ot distiguish properly betwee umbers ad the statemets they refer to. Do t write we proved =1. Write we proved the case =1. Do t write =1 is true whe you mea the first statemet is true. Numbers do t have truth values. Likewise, i the iductive step, do t write assume. is a iteger ad therefore ca t be assumed. Assume is a arbitrary iteger is still wrog as the iductive hypothesis, because it leaves out what we re actually assumig about that iteger. Correct: assume P() for some arbitrary iteger.
17 Commo Mistakes (7) Do ot cofuse the coclusio of the base case with the reaso you reach this coclusio. For example, i example 1a, the summatio formula P(1) reduces to the idetity 1=1. That 1=1 is a kow fact, a premise, ad ot i eed of proof. P(1) is the coclusio that follows from that. The followig, wrog base case reverses this relatioship: Base case: for =1, the summatio formula reduces to 1 = 1. This is true. Therefore, 1=1. We already kow that 1=1, ad we are ot provig that a umber is equal to itself. If you are goig to write a formal coclusio to the base case, it must be that the statemet you are provig is true i that case. Correct versio: Base case: for =1, the summatio formula reduces to 1 = 1. This is true. Therefore, P(1) is true.
18 Example IIa Theorem: For ay positive iteger, 4 1 is divisible by 3. Proof by iductio: Base Case: for = 1, 4 1 = 4 1 = 3, which is divisible by 3. Iductive Step: suppose we have already proved that 4 1 is divisible by 3 for some positive iteger. Our goal is to show that = must the be divisible by 3 as well. There are differet ways to proceed from here. Variatio 1: We ca split four times 4 ito three times that quatity, plus oe times that quatity: = (4 1). Accordig to the iductive hypothesis, 4 1 is a multiple of 3. Sice 3 4 is a multiple of 3 as well, so is the sum of the two terms, which is Variatio : Accordig to the iductive hypothesis, 4 1 is a multiple of 3, i.e. 4 1 = 3k for some iteger k, or 4 = 3k + 1. Substitutig that ito , we get Thus is a multiple of = 4 3k = 1k + 3 = 3(4k + 1).
19 Example IIb Theorem: 1 divides for all atural umbers. Proof by iductio: we first verify the statemet for = 1: 1 divides = 1. Now suppose that 1 divides for some atural umber. This meas = 1k for some iteger k. Let us cosider (+1) 1 = By usig laws of expoetiatio, we ca rewrite this as It would be ice here if we could just factor out a commo factor i order to substitute the iductive hypothesis, but that is ot possible. So we split the secod term to make at least a partial factorizatio possible: Therefore, = (+1) 1 = = 1 4k We have demostrated that (+1) 1 is divisible by 1. This completes the proof.
20 Example III Theorem: if S is a fiite set with S =, the P S =, for = 0,1,,3, Proof by iductio: 1. Base Case (=0): if S is a set with S = 0, the P S = 1. This statemet is true, because S = 0 implies S =, hece P S =, so P S = 1.. Iductive Step: suppose we already kow for some arbitrary that if a set has elemets, its power set must have elemets. We must the verify that if S is a set with S = + 1, the P S = +1. To verify this coditioal, we will assume its premise ad show that the coclusio must be true. Let S be a set with S = + 1. Let us sigle out a arbitrary elemet of S ad call it x. Defie R = S {x}. The R =. Now let us cout how may subsets S has. The umber of subsets of S equals A + B, where A = the umber of subsets of S that do t cotai x, B = the umber of subsets that do cotai x. A subset of S that does t cotai x is a subset of R, hece A = P R iductive hypothesis. = by the A subset of S that cotais x is the uio of a subset of R with {x}, hece B = P R =. Therefore, P S = A + B = + = +1. That completes our proof.
21 Example IV Theorem: < for all itegers 5. Proof by iductio: we first verify the statemet for = 5: 5 < 5 because 5 < 3. This was the base case. Iductive step: Now suppose that < for some atural umber 5. We will show ( + 1) < +1. Sice( + 1) = + + 1, we oly eed to show that + 1 < for 5. The, < + = +1 by the iductive hypothesis ad thus ( + 1) < +1. It remais to show that + 1 < for all 5. We do this oce agai by iductio. Base case: + 1 < is true for = 5 because 11 < 3. Iductive step: suppose + 1 < for some 5. Our goal is to show ( + 1) + 1 < +1. Let us add two to the iequality of the iductive hypothesis: + 3 < +. Sice < for, ad certaily for 5, + 3 < + < + = +1. Therefore, ( + 1) + 1 < +1.
22 A Example of a Icorrect Proof by Iductio False Theorem: for all oegative itegers, =. This statemet is of course absurd. = is true for oly oe umber: = 0. Now let us cosider the followig (icorrect) proof by iductio. Defie P for all oegative itegers to be the statemet =. Base case: for = 0, the statemet = is correct. Iductive Step: suppose = for some arbitrary oegative iteger has already bee show. Multiply both sides of this equatio by +1 to get + 1 = + 1. That completes the proof. It is clear that this proof is icorrect, because ay alleged proof of a false statemet must be icorrect. Let us try to pipoit the mistake. The base case was correctly verified. 0 = 0 is a true statemet. The argumet of the iductive step is correct for all except the first. Whe = 0, the the argumet asks us to multiply by the udefied quatity 1 0. Ideed, ay argumet that claims to prove P P( + 1) for all must at least be ivalid for = 0, because P 0 is a true statemet ad P(1) is a false statemet, so the coditioal P 0 P 1 is false. (The followig coditioals, P 1 P, etc, are actually true, ad our proof above showed that. )
1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
More information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationHomework 9. (n + 1)! = 1 1
. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More information4 Mathematical Induction
4 Mathematical Iductio Examie the propositios for all, 1 + + ( + 1) + = for all, + 1 ( + 1) for all How do we prove them? They are statemets ivolvig a variable ruig through the ifiite set Strictly speakig,
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationOnce we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1
. Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely
More informationRegent College Maths Department. Further Pure 1. Proof by Induction
Reget College Maths Departmet Further Pure Proof by Iductio Further Pure Proof by Mathematical Iductio Page Further Pure Proof by iductio The Edexcel syllabus says that cadidates should be able to: (a)
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationSection 4.3. Boolean functions
Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationInduction: Solutions
Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For
More information(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 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationMath 4400/6400 Homework #7 solutions
MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationMath 25 Solutions to practice problems
Math 5: Advaced Calculus UC Davis, Sprig 0 Math 5 Solutios to practice problems Questio For = 0,,, 3,... ad 0 k defie umbers C k C k =! k!( k)! (for k = 0 ad k = we defie C 0 = C = ). by = ( )... ( k +
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationMath 61CM - Solutions to homework 1
Math 61CM - Solutios to homework 1 Cédric De Groote October 1 st, 2018 Problem 1: Use mathematical iductio to check the validity of the formula j 3 = 2 ( + 1) 2 for = 1, 2,.... Note: The priciple of mathematical
More informationModern Algebra 1 Section 1 Assignment 1. Solution: We have to show that if you knock down any one domino, then it knocks down the one behind it.
Moder Algebra 1 Sectio 1 Assigmet 1 JOHN PERRY Eercise 1 (pg 11 Warm-up c) Suppose we have a ifiite row of domioes, set up o ed What sort of iductio argumet would covice us that ocig dow the first domio
More informationMath 234 Test 1, Tuesday 27 September 2005, 4 pages, 30 points, 75 minutes.
Math 34 Test 1, Tuesday 7 September 5, 4 pages, 3 poits, 75 miutes. The high score was 9 poits out of 3, achieved by two studets. The class average is 3.5 poits out of 3, or 77.5%, which ordiarily would
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More information2 Geometric interpretation of complex numbers
2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that
More informationProofs. Indirect Proofs
Math 2326 Fall 2008 Proofs. Idirect Proofs 9fte, it is very difficult to give a direct approach to! x (P(x) " C(x))D the coectio betwee P!x) ad C!x) might ot be suitable to this approach. For example,
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationPROPERTIES OF THE POSITIVE INTEGERS
PROPERTIES OF THE POSITIVE ITEGERS The first itroductio to mathematics occurs at the pre-school level ad cosists of essetially coutig out the first te itegers with oe s figers. This allows the idividuals
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationIntro to Learning Theory
Lecture 1, October 18, 2016 Itro to Learig Theory Ruth Urer 1 Machie Learig ad Learig Theory Comig soo 2 Formal Framework 21 Basic otios I our formal model for machie learig, the istaces to be classified
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationThe Binomial Theorem
The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationStudents will calculate quantities that involve positive and negative rational exponents.
: Ratioal Expoets What are ad? Studet Outcomes Studets will calculate quatities that ivolve positive ad egative ratioal expoets. Lesso Notes Studets exted their uderstadig of iteger expoets to ratioal
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationTopic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or
Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad
More informationIntroductory Analysis I Fall 2014 Homework #7 Solutions
Itroductory Aalysis I Fall 214 Homework #7 Solutios Note: There were a couple of typos/omissios i the formulatio of this homework. Some of them were, I believe, quite obvious. The fact that the statemet
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More informationSome examples of vector spaces
Roberto s Notes o Liear Algebra Chapter 11: Vector spaces Sectio 2 Some examples of vector spaces What you eed to kow already: The te axioms eeded to idetify a vector space. What you ca lear here: Some
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationInfinite Series. Definition. An infinite series is an expression of the form. Where the numbers u k are called the terms of the series.
Ifiite Series Defiitio. A ifiite series is a expressio of the form uk = u + u + u + + u + () 2 3 k Where the umbers u k are called the terms of the series. Such a expressio is meat to be the result of
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationTest One (Answer Key)
CS395/Ma395 (Sprig 2005) Test Oe Name: Page 1 Test Oe (Aswer Key) CS395/Ma395: Aalysis of Algorithms This is a closed book, closed otes, 70 miute examiatio. It is worth 100 poits. There are twelve (12)
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: Jauary 2009 Aalysis I Time Allowed:.5 hours Read carefully the istructios o the aswer book ad make sure that the particulars required are etered o each
More informationMATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1
MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The
More informationUniversity of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!
Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationInduction proofs - practice! SOLUTIONS
Iductio proofs - practice! SOLUTIONS 1. Prove that f ) = 6 + + 15 is odd for all Z +. Base case: For = 1, f 1) = 41) + 1) + 13 = 19. Sice 19 is odd, f 1) is odd - base case prove. Iductive hypothesis:
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationA B = φ No conclusion. 2. (5) List the values of the sets below. Let A = {n 2 : n P n 5} = {1,4,9,16,25} and B = {n 4 : n P n 5} = {1,16,81,256,625}
CPSC 070 Aswer Keys Test # October 1, 014 1. (a) (5) Defie (A B) to be those elemets i set A but ot i set B. Use set membership tables to determie what elemets are cotaied i (A (B A)). Use set membership
More informationMATH1035: Workbook Four M. Daws, 2009
MATH1035: Workbook Four M. Daws, 2009 Roots of uity A importat result which ca be proved by iductio is: De Moivre s theorem atural umber case: Let θ R ad N. The cosθ + i siθ = cosθ + i siθ. Proof: The
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More information