Asymptotic Growth of Functions


 Milo Clarke
 2 years ago
 Views:
Transcription
1 CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll see, the asymptotic ru time of a algorithm gives a simple, ad machie idepedet, characterizatio of it s complexity Defiitio Let g ( be a fuctio The set O ( is defied as O = { f ( c >, >, : f ( c ) } ( I other words, f ( O( if ad oly if there exist positive costats c, ad, such that for all, the iequality f ( c is satisfied We say that f ( is Big O of g (, or that g ( is a asymptotic upper boud for f ( We ofte abuse otatio slightly by writig f ( to mea f ( O( Actually f ( O( is also a abuse of otatio We should really write f O(g) sice what we have defied is a set of fuctios, ot a set of umbers The otatioal covetio O ( is useful sice it allows us to refer to the set O ( 3 ) say, without havig to itroduce a fuctio symbol for the 3 polyomial Observe that if f ( the f ( is asymptotically oegative, ie f ( is oegative for all sufficietly large, ad liewise for g ( We mae the blaet assumptio from ow o that all fuctios uder discussio are asymptotically oegative I practice we will be cocered with iteger valued fuctios of a (positive) iteger ( g : Z + Z + ) However, i what follows, it is useful to cosider to be a cotiuous real variable taig positive values ad g to be real valued fuctio ( g : R + R + ) Geometrically f ( says: cg ( f (
2 Example ) Observe that for all, as ca be easily verified Thus we may tae = ad c = i the defiitio Note that i this example, ay value of greater tha will also wor, ad liewise ay value of c greater tha wors I geeral if there exist positive costats ad c such that f ( c for all, the ifiitely may such costats also exist I order to prove that f ( it is ot ecessary to fid the smallest possible ad c maig the f ( c true It is oly ecessary to show that at least oe pair of such costats exist Geeralizig the last example, we will show that a + b c + d + e) for ay costats ae, ad i fact p ( q( wheever p ( ad q ( are polyomials with de p) de q) Defiitio Let g ( be a fuctio ad defie the set Ω ( to be Ω = { f ( c >, >, : c f ( )} ( We say f ( is big Omega of g (, ad that g ( is a asymptotic lower boud for f ( As before we write f ( to mea f ( Ω( The geometric iterpretatio is: f ( cg (
3 Lemma f ( if ad oly if f ( Proof: If f ( the there exist positive umbers c, such that f ( c for all Let c = / c ad = The c f ( for all, provig f ( The coverse is similar ad we leave it to the reader /// Defiitio Let g ( be a fuctio ad defie the set Θ ( Ω( Equivaletly Θ( = { f ( c >, c >, >, : c f ( c } We write f ( ad say the g ( is a asymptotically tight boud for f (, or that f ( ad g ( are asymptotically equivalet We iterpret this geometrically as: c f ( c Exercise Prove that if c is a positive costat, the cf ( f ( Exercise Prove that f ( if ad oly if f ( Example Prove that ) + Proof: Accordig to the defiitio, we must fid positive umbers c, c,, such that the iequality c + c holds for all Pic c =, c =, ad = The if we have: ad ( ) ad ( ) ( c ) ad ( c ) + c ad + c, c + c, + c, c as required /// 3
4 The reader may fid our choice of values for the costats c, c, i this example somewhat mysterious Adequate values for these costats ca usually be obtaied by worig bacwards algebraically from the iequality to be proved Notice that i this example there are may valid choices For istace oe checs easily that c /, c 3/, ad wor equally well = Exercise Let a, b be real umbers with b > Prove directly from the defiitio (as above) that b b ( + a) ) (I what follows we lear a much easier way to prove this) Lemma If f ( h( for all sufficietly large, ad if h (, the f ( Proof: The above hypotheses say that there exist positive umbers c ad such that h( c for all Also there exists such that f ( h( for all (Recall f ( is assumed to be asymptotically oegative) Defie = max(, ), so that if we have both ad Thus implies f ( c, ad therefore f ( /// Exercise Prove that if h ( f ( h ( for all sufficietly large, where h ( ad h ( )), the f ( + Example Let be a fixed iteger Prove that i ) + + Proof: Observe that i = = ), ad i i / / ( / ) = = / ( / ) ( / )( / ) = (/ ) ) + By the result of the precedig exercise, we coclude i ) /// Whe asymptotic otatio appears i a formula such as T ( = T ( / ) + Θ( we iterpret Θ ( to 3 3 stad for some aoymous fuctio i the class Θ ( For example = 3 + Θ( ) Here Θ ( ) stads for 4 +, which belogs to the class Θ ( ) The expressio = Θ( i) ca be puzzlig O the surface it stads for Θ( ) + Θ() + Θ(3) + + Θ(, i which is meaigless sice Θ (costat) cosists of all fuctios which are bouded above by some costat We iterpret Θ (i) i this expressio to stad for a sigle fuctio f (i) i the class Θ (i), evaluated at i =,, 3,, Exercise Prove that = Θ( i) ) The left had side stads for a sigle fuctio f (i) summed i = ( i for i =,, 3,, By the previous exercise it is sufficiet to show that h f ( i) h ( ) for all sufficietly large, where h ( ) ad h ( ) 4
5 Defiitio o ( = { f ( c >, >, : f ( < c } We say that g ( is a strict Asymptotic upper boud for f ( ad write f ( as before f ( Lemma f ( if ad oly if lim = f ( Proof: Observe that f ( if ad oly if c >, >, : < c, which is the f ( very defiitio of the limit statemet lim = /// l Example l ) sice lim = (Apply l Hopitals rule) Example b ) for ay > ad b > sice lim = b other words, ay expoetial grows strictly faster tha ay polyomial (Apply l Hopitals rule times) I By comparig defiitios of o ( ad O( oe sees immediately that o( O( Also o fuctio ca belog to both o ( ad Ω (, as is easily verified (exercise) Thus o ( Ω( =, ad therefore o( O( Defiitio ω ( g ( = { f ( c >, >, : c < f ( } Here we say that g ( is a strict asymptotic lower boud for f ( ad write f ( = ω( f ( Exercise Prove that f ( = ω( if ad oly if lim = g ( ) Exercise Prove ω ( O( =, whece ω ( Ω( The followig picture emerges: O ( Ω ( o ( Θ ( ω ( 5
6 Lemma If f ( lim = L, where L <, the f ( Proof: The defiitio of the above limit is ε =, there exists a positive umber such that for all : f ( L < f ( < L < f ( < L + f ( < ( L + ) f ( ε >, >, : L < ε Thus if we let Now tae c = L + i the defiitio of O, so that f ( as claimed /// f ( Lemma If lim = L, where < L, the f ( Proof: The limit statemet implies lim = L, where L =/ L ad hece L < By the f ( previous lemma g ( f (, ad therefore f ( /// Exercise Prove that if f ( lim = L, where < L <, the f ( Although o (, ω (, ad a certai subset of Θ ( are characterized by limits, the full sets O (, Ω (, ad Θ ( have o such characterizatio as the followig examples show Example A Let g ( = ad f ( = ( + si( g ( f ( f ( Clearly f (, but = + si(, whose limit does ot exist This example shows that the cotaimet o( O( is i geeral strict sice f ( Ω( (exercise) Therefore f ( Θ(, so that f ( O( But f ( o( sice the limit does ot exist 6
7 Example B Let g ( = ad f ( = ( + si( 3g ( f ( g ( Sice ( + si( 3 for all, we have f (, but f ( = + si( whose limit does ot exist Exercise Fid fuctios f ( ad g ( such that f ( Ω(, but exist (eve i the sese of beig ifiite), so that f ( ω( f ( lim g ( ) does ot The precedig limit theorems ad couterexamples ca be summarized i the followig diagram f ( Here L deotes the limit L = lim, if it exists g ( ) O ( Ω ( Θ ( o ( ω ( L = < L < L = Ex A Ex B I spite of the above couterexamples, the precedig limit theorems are a very useful tool for establishig asymptotic comparisos betwee fuctios For istace recall the earlier exercise to b b show ( + a) ) for real umbers a, ad b with b > The result follows immediately from sice << b ( + a) lim = lim = = + a b, b 7 b
8 Exercise Use limits to prove the followig: a l ) (here l ) deotes the base logarithm of ) 5 b = ω( ) c If P ( is a polyomial of degree, the P( ) d f ( + o( f ( f ( (Oe ca always disregard lower order terms) ε e (log ) for ay > ad ε > (Polyomials grow faster tha logs) ε f b ) for ay ε > ad b > (Expoetials grow faster tha polyomials) There is a aalogy betwee the asymptotic compariso of fuctios f ( ad g (, ad the compariso of real umbers x ad y f ( ~ x y f ( ~ x = y f ( ~ x y f ( ~ x < y f ( = ω( ~ x > y Note however that this aalogy is ot exact sice there exist pairs of fuctios which are ot comparable, while ay two real umbers are comparable (See problem 3c, p58) 8
ORDERS OF GROWTH KEITH CONRAD
ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationModule 4: Mathematical Induction
Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationA Gentle Introduction to Algorithms: Part II
A Getle Itroductio to Algorithms: Part II Cotets of Part I:. Merge: (to merge two sorted lists ito a sigle sorted list.) 2. Bubble Sort 3. Merge Sort: 4. The BigO, BigΘ, BigΩ otatios: asymptotic bouds
More informationSection 9.2 Series and Convergence
Sectio 9. Series ad Covergece Goals of Chapter 9 Approximate Pi Prove ifiite series are aother importat applicatio of limits, derivatives, approximatio, slope, ad cocavity of fuctios. Fid challegig atiderivatives
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationSection IV.5: Recurrence Relations from Algorithms
Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis
Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a stepbystep procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationMeasurable Functions
Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these
More informationPage 2 of 14 = T(2) + 2 = [ T(3)+1 ] + 2 Substitute T(3)+1 for T(2) = T(3) + 3 = [ T(4)+1 ] + 3 Substitute T(4)+1 for T(3) = T(4) + 4 After i
Page 1 of 14 Search C455 Chapter 4  Recursio Tree Documet last modified: 02/09/2012 18:42:34 Uses: Use recursio tree to determie a good asymptotic boud o the recurrece T() = Sum the costs withi each level
More informationLearning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.
Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the
More informationif A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,
Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σalgebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio
More information1 The Binomial Theorem: Another Approach
The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationwhen n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.
Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationThe Field of Complex Numbers
The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that
More information2.7 Sequences, Sequences of Sets
2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For
More informationChapter 6: Variance, the law of large numbers and the MonteCarlo method
Chapter 6: Variace, the law of large umbers ad the MoteCarlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES  CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationFactors of sums of powers of binomial coefficients
ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the
More informationSequences II. Chapter 3. 3.1 Convergent Sequences
Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, oegative fuctio o the closed iterval [a, b] Fid
More informationOur aim is to show that under reasonable assumptions a given 2πperiodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More information4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then
SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or pseries (the Compariso Test), but of
More information0,1 is an accumulation
Sectio 5.4 1 Accumulatio Poits Sectio 5.4 BolzaoWeierstrass ad HeieBorel Theorems Purpose of Sectio: To itroduce the cocept of a accumulatio poit of a set, ad state ad prove two major theorems of real
More informationπ d i (b i z) (n 1)π )... sin(θ + )
SOME TRIGONOMETRIC IDENTITIES RELATED TO EXACT COVERS Joh Beebee Uiversity of Alaska, Achorage Jauary 18, 1990 Sherma K Stei proves that if si π = k si π b where i the b i are itegers, the are positive
More informationDivide and Conquer, Solving Recurrences, Integer Multiplication Scribe: Juliana Cook (2015), V. Williams Date: April 6, 2016
CS 6, Lecture 3 Divide ad Coquer, Solvig Recurreces, Iteger Multiplicatio Scribe: Juliaa Cook (05, V Williams Date: April 6, 06 Itroductio Today we will cotiue to talk about divide ad coquer, ad go ito
More informationIrreducible polynomials with consecutive zero coefficients
Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem
More information3 Basic Definitions of Probability Theory
3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More information8.5 Alternating infinite series
65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More informationARITHMETIC AND GEOMETRIC PROGRESSIONS
Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives
More information3.2 Introduction to Infinite Series
3.2 Itroductio to Ifiite Series May of our ifiite sequeces, for the remaider of the course, will be defied by sums. For example, the sequece S m := 2. () is defied by a sum. Its terms (partial sums) are
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationData Structures. Outline
Data Structures Solvig Recurreces Tzachi (Isaac) Rose 1 Outlie Recurrece The Substitutio Method The Iteratio Method The Master Method Tzachi (Isaac) Rose 2 1 Recurrece A recurrece is a fuctio defied i
More informationThe Field Q of Rational Numbers
Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees
More informationLesson 12. Sequences and Series
Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or
More informationLecture 7: Borel Sets and Lebesgue Measure
EE50: Probability Foudatios for Electrical Egieers JulyNovember 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationSolving DivideandConquer Recurrences
Solvig DivideadCoquer Recurreces Victor Adamchik A divideadcoquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook  Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More information8.3 POLAR FORM AND DEMOIVRE S THEOREM
SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationDefinition. Definition. 72 Estimating a Population Proportion. Definition. Definition
7 stimatig a Populatio Proportio I this sectio we preset methods for usig a sample proportio to estimate the value of a populatio proportio. The sample proportio is the best poit estimate of the populatio
More informationINFINITE SERIES KEITH CONRAD
INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationTHE COMPLETENESS OF CONVERGENT SEQUENCES SPACE OF FUZZY NUMBERS. Hee Chan Choi
KagweoKyugki Math. Jour. 4 (1996), No. 2, pp. 117 124 THE COMPLETENESS OF CONVERGENT SEQUENCES SPACE OF FUZZY NUMBERS Hee Cha Choi Abstract. I this paper we defie a ew fuzzy metric θ of fuzzy umber sequeces,
More informationThe Limit of a Sequence
3 The Limit of a Sequece 3. Defiitio of limit. I Chapter we discussed the limit of sequeces that were mootoe; this restrictio allowed some shortcuts ad gave a quick itroductio to the cocept. But may importat
More informationAlgorithms and Data Structures DV3. Arne Andersson
Algorithms ad Data Structures DV3 Are Adersso Today s lectures Textbook chapters 14, 5 Iformatiostekologi Itroductio Overview of Algorithmic Mathematics Recurreces Itroductio to Recurreces The Substitutio
More informationMATH 361 Homework 9. Royden Royden Royden
MATH 61 Homework 9 Royde..9 First, we show that for ay subset E of the real umbers, E c + y = E + y) c traslatig the complemet is equivalet to the complemet of the traslated set). Without loss of geerality,
More informationAnnuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.
Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio  Israel Istitute of Techology, 3000, Haifa, Israel I memory
More informationThe Euler Totient, the Möbius and the Divisor Functions
The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship
More informationx(x 1)(x 2)... (x k + 1) = [x] k n+m 1
1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,
More informationThe geometric series and the ratio test
The geometric series ad the ratio test Today we are goig to develop aother test for covergece based o the iterplay betwee the it compariso test we developed last time ad the geometric series. A ote about
More information4.3. The Integral and Comparison Tests
4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece
More informationAn example of nonquenched convergence in the conditional central limit theorem for partial sums of a linear process
A example of oqueched covergece i the coditioal cetral limit theorem for partial sums of a liear process Dalibor Volý ad Michael Woodroofe Abstract A causal liear processes X,X 0,X is costructed for which
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRECALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More information5. SEQUENCES AND SERIES
5. SEQUENCES AND SERIES 5.. Limits of Sequeces Let N = {0,,,... } be the set of atural umbers ad let R be the set of real umbers. A ifiite real sequece u 0, u, u, is a fuctio from N to R, where we write
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More informationMA2108S Tutorial 5 Solution
MA08S Tutorial 5 Solutio Prepared by: LuJigyi LuoYusheg March 0 Sectio 3. Questio 7. Let x := / l( + ) for N. (a). Use the difiitio of limit to show that lim(x ) = 0. Proof. Give ay ɛ > 0, sice ɛ > 0,
More informationChapter 14 Nonparametric Statistics
Chapter 14 Noparametric Statistics A.K.A. distributiofree statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationA Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measuretheoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationReview for College Algebra Final Exam
Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 14. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i
More informationThe second difference is the sequence of differences of the first difference sequence, 2
Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for
More informationTAYLOR SERIES, POWER SERIES
TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the
More information13 Fast Fourier Transform (FFT)
13 Fast Fourier Trasform FFT) The fast Fourier trasform FFT) is a algorithm for the efficiet implemetatio of the discrete Fourier trasform. We begi our discussio oce more with the cotiuous Fourier trasform.
More informationA CHARACTERIZATION OF MINIMAL ZEROSEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(1) (2005), #A27 A CHARACTERIZATION OF MINIMAL ZEROSEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS Scott T. Chapma 1 Triity Uiversity, Departmet
More informationNPTEL STRUCTURAL RELIABILITY
NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics
More informationChapter 7  Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:
Chapter 7  Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries
More informationNATIONAL SENIOR CERTIFICATE GRADE 12
NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS
More information1 n. n > dt. t < n 1 + n=1
Math 05 otes C. Pomerace The harmoic sum The harmoic sum is the sum of recirocals of the ositive itegers. We kow from calculus that it diverges, this is usually doe by the itegral test. There s a more
More informationChapter One BASIC MATHEMATICAL TOOLS
Chapter Oe BAIC MATHEMATICAL TOOL As the reader will see, the study of the time value of moey ivolves substatial use of variables ad umbers that are raised to a power. The power to which a variable is
More informationSearching Algorithm Efficiencies
Efficiecy of Liear Search Searchig Algorithm Efficiecies Havig implemeted the liear search algorithm, how would you measure its efficiecy? A useful measure (or metric) should be geeral, applicable to ay
More information3. Greatest Common Divisor  Least Common Multiple
3 Greatest Commo Divisor  Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More information{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers
. Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,
More informationThe following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles
The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio
More informationA Note on Sums of Greatest (Least) Prime Factors
It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423432 HIKARI Ltd, www.mhikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos
More informationApproximating the Sum of a Convergent Series
Approximatig the Sum of a Coverget Series Larry Riddle Ages Scott College Decatur, GA 30030 lriddle@agesscott.edu The BC Calculus Course Descriptio metios how techology ca be used to explore covergece
More informationEconomics 140A Confidence Intervals and Hypothesis Testing
Ecoomics 140A Cofidece Itervals ad Hypothesis Testig Obtaiig a estimate of a parameter is ot the al purpose of statistical iferece because it is highly ulikely that the populatio value of a parameter is
More informationMatrix Transforms of Astatistically Convergent Sequences with Speed
Filomat 27:8 2013, 1385 1392 DOI 10.2298/FIL1308385 Published by Faculty of Scieces ad Mathematics, Uiversity of Niš, Serbia vailable at: http://www.pmf.i.ac.rs/filomat Matrix Trasforms of statistically
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationAdvanced Probability Theory
Advaced Probability Theory Math5411 HKUST Kai Che (Istructor) Chapter 1. Law of Large Numbers 1.1. σalgebra, measure, probability space ad radom variables. This sectio lays the ecessary rigorous foudatio
More informationSEQUENCES AND SERIES
Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say
More informationJoint Probability Distributions and Random Samples
STAT5 Sprig 204 Lecture Notes Chapter 5 February, 204 Joit Probability Distributios ad Radom Samples 5. Joitly Distributed Radom Variables Chapter Overview Joitly distributed rv Joit mass fuctio, margial
More information