Recursion and Recurrences

Size: px
Start display at page:

Download "Recursion and Recurrences"

Transcription

1 Chapter 5 Recursio ad Recurreces 5.1 Growth Rates of Solutios to Recurreces Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer. Cosider, for example, the biary search algorithm, which we will describe i the cotext of guessig a umber betwee 1 ad 100. Suppose someoe picks a umber betwee 1 ad 100, ad allows you to ask questios of the form Is the umber greater tha k? where k is a iteger you choose. Your goal is to ask as few questios as possible to figure out the umber. Your first questio should be Is the umber greater tha 50? Why is this? Well, after askig if the umber is bigger tha 50, you have leared either that the umber is betwee oe ad 50, or that the umber is betwee 51 ad 100. I either case have reduced your problem to oe i which the rage is oly half as big. Thus you have divided the problem up ito a problem that is oly half as big, ad you ca ow (recursively) coquer this remaiig problem. (If you ask ay other questio, oe of the possible rages of values you could ed up with would more tha half the size of the origial problem.) If you cotiue i this fashio, always cuttig the problem size i half, you will be able to get the problem dow to size oe fairly quickly, ad the you will kow what the umber is. Of course it would be easier to cut the problem exactly i half each time if we started with aumber i the rage from oe to 128, but the questio does t soud quite so plausible the. Thus to aalyze the problem we will assume someoe asks you to figure out a umber betwee 0 ad, where is a power of 2. Exercise Let T () be umber of questios i biary search o the rage of umbers betwee 1 ad. Assumig that is a power of 2, get a recurrece of for T (). For Exercise we get: T () = T (/2)+1 if 2 1 if =1 (5.1) That is, the umber of guesses to carry out biary search o items is equal to 1 step (the guess) plus the time to solve biary search o the remaiig /2 items. 159

2 160 CHAPTER 5. RECURSION AND RECURRENCES What we are really iterested i is how much time it takes to use biary search i a computer program that looks for a item i a ordered list. While the umber of questios gives us a feel for the amout of time, processig each questio may take several steps i our computer program. The exact amout of time these steps take might deped o some factors we have little cotrol over, such as where portios of the list are stored. Also, we may have to deal with lists whose legth is ot a power of two. Thus a more realistic descriptio of the time eeded would be T () T ( /2 )+C1 if 2 C 2 if =1, (5.2) where C 1 ad C 2 are costats. It turs out that the solutio to (5.1) ad (5.2) are roughly the same, i a sese that will hopefully become clear later. This is almost always the case; we will come back to this issue. For ow, let us ot worry about floors ad ceiligs ad the distictio betwee thigs that take 1 uit of time ad thigs that take o more tha some costat amout of time. Let s tur to aother example of a divide ad coquer algorithm, mergesort. Ithis algorithm, you wish to sort a list of items. Let us assume that the data is stored i a array A i positios 1 through. Mergesort ca be described as follows: MergeSort(A,low,high) if (low == high) retur else mid = (low + high) /2 MergeSort(A,low,mid) MergeSort(A,mid+1,high) Merge the sorted lists from the previous two steps More details o mergesort ca be foud i almost ay algorithms textbook. Suffice to say that the base case (low = high) takes oe step, while the other case executes 1 step, makes two recursive calls o problems of size /2, ad the executes the Merge istructio, which ca be doe i steps. Thus we obtai the followig recurrece for the ruig time of mergesort: T () = 2T (/2) + if >1 1 if =1 (5.3) Recurreces such as this oe ca be uderstood via the idea of a recursio tree, which we itroduce i the followig. This cocept will allow us to aalyze recurreces that arise i dividead-coquer algorithms, ad those that arise i other recursive situatios, such as the Towers of Haoi, as well. A recursio tree for a recurrece is a visual ad coceptual represetatio of the process of iteratig the recurrece.

3 5.1. GROWTH RATES OF SOLUTIONS TO RECURRENCES 161 Figure 5.1: The iitial stage of drawig a recursio tree /2 Recursio Trees We will itroduce the idea of a recursio tree via several examples. It is helpful to have a algorithmic iterpretatio of a recurrece. For example, (igorig for a momet the base case) we ca iterpret the recurrece T () =2T (/2) + (5.4) as i order to solve a problem of size we must solve 2 problems of size /2 ad do uits of additioal work. Similarly we ca iterpret T () =T (/4) + 2 as i order to solve a problem of size we must solve 1 problems of size /4 ad do 2 uits of additioal work. We ca also iterpret the recurrece T () =3T ( 1) + as i order to solve a problem of size, wemust solve 3 subproblems of size 1 ad do additioal uits of work. I Figure 5.1 we draw the begiig of the recursio diagram for (5.4). For ow, assume is apower of2.arecursio tree diagram has three parts. O the left, we keep track of the problem size, i the middle we draw the tree, ad o right we keep track of the work doe. We draw the diagram i levels, each level of the diagram represetig a level of recursio. Equivaletly, each level of the diagram represets a level of iteratio of the recurrece. So to begi the recursio tree for (5.4), we show i level 0 o the left that we have problem of size. The by drawig aroot vertex with two edges leavig it, we show i the middle that we are splittig it ito 2 problems. We ote o the right that we do uits of work i additio to whatever is doe o the two ew problems we created. So that the diagram cotais the relevat iformatio, we fill i part of level oe. We draw two vertices i the middle represetig the two problems ito which we split our mai problem ad show o the left that each of these problems has size /2. You ca see how the recurrece is reflected i levels 0 ad 1 of the recursio tree. The top vertex of the tree represets T (), a the ext level we have two problems of size /2, givig us the recursive term 2T (/2) of our recurrece. The after we solve these two problems we retur to level 0 of the tree ad do additioal uits of work for the orecursive term of the recurrece.

4 162 CHAPTER 5. RECURSION AND RECURRENCES Figure 5.2: Four levels of a recursio tree. /2 /2 + /2 = /4 /4 + /4 + /4 + /4 = /8 8(/8) = Now we cotiue to draw the tree i the same maer. Fillig i the rest of level oe ad addig a few more a few more levels, we have Figure 5.2. Let us summarize what the diagram tells us so far. At level zero (the top level), uits of work are doe. We see that at each succeedig level, we halve the problem size ad double the umber of subproblems. We also see that at level 1, each of the two subproblems requires /2 uits of additioal work, ad so a total of uits of additioal work are doe. Similarly level 2 has 4 subproblems of size /4 ad so 4(/4) uits of additioal work are doe. To see how iteratio of the recurrece is reflected i the diagram, we iterate the recurrece oce, gettig T () = 2T (/2) + T () = 2(2T (/4) + /2) + T () = 4T (/4) + + =4T (/4) + 2 If we examie levels 0, 1, ad 2 of the diagram, we see that at level 2 we have four vertices represetig four problems each of size /4. This gives us the recursive term that we got after iteratig the recurrece. However after we solve these problems we retur to level 1 where we twice do /2 additioal uits of work ad to level 0 where we do aother additioal uits of work. I this way each time we add a level to the tree we are showig the result of oe more iteratio of the recurrece. We ow have eough iformatio to be able to describe the recursio tree diagram i geeral. To do this, we eed to determie, for each level, three thigs umber of subproblems, size of each subproblem, total work doe. We also eed to figure out how may levels there are i the recursio tree.

5 5.1. GROWTH RATES OF SOLUTIONS TO RECURRENCES 163 We see that for this problem, at level i, wehave 2 i subproblems of size /2 i. Further, sice a problem of size 2 i requires 2 i uits of additioal work, there are (2 i )[/(2 i )] = uits of work doe per level. To figure out how may levels there are i the tree, we just otice that at each level the problem size is cut i half, ad the tree stops whe the problem size is 1. Therefore there are log 2 +1levels of the tree, sice we start with the top level ad cut the problem size i half log 2 times. 1 We ca thus visualize the whole tree i Figure 5.3. Figure 5.3: A fiished recursio tree diagram. log +1 levels /2 /4 /2 + /2 = /4 + /4 + /4 + /4 = /8 8(/8) = 1 (1) = The bottom level is differet from the other levels. I the other levels, the work is described by the recursive part of the recurrece, which i this case is T () =2T (/2) +. Atthe bottom level, the work comes from the base case. Thus we must compute the umber of problems of size 1 (assumig that oe is the base case), ad the multiply this value by T (1). For this particular recurrece, ad for may others we will see, it turs out that if you compute the amout of work o the bottom level as if you were computig the amout of additioal work required after you split a problem of size oe ito 2 problems (which, of course, makes o sese) it will be the same value as if you compute it via the base case. Had we chose to say that T (1) some costat other tha 1, this would ot have bee the case. We emphasize that the correct value always comes from the base case: it is just a coicidece that it sometimes also comes from the recursive part of the recurrece. The bottom level of the tree represets the fial stage of iteratig the recurrece; at this level we have problems each requirig work T (1) = 1, ad after we solve them we have to do all the additioal work from all the earlier levels. Thus iteratio of the recurrece tells us that the solutio to the recurrece is the sum of all the work doe at all the levels of the recursio tree. This is exactly how we use the recursio tree to write dow a solutio to a recurrece. The importat thig is that we ow kow exactly how may levels there are, ad how much work is doe at each level. Oce we kow this, we ca sum the total amout of work doe over all the levels, givig us the solutio to our recurrece. I this case, there are log 2 +1 levels, ad at each level the amout of work we do is uits. Thus we coclude that the total amout 1 To simplify otatio, for the remaider of the book, if we omit the base of a logarithm, it should be assumed to be base 2.

6 164 CHAPTER 5. RECURSION AND RECURRENCES Figure 5.4: A recursio tree diagram for Recurrece 5.5. log + 1 levels /2 /4 /2 /4 /8 /8 1 1 of work doe to solve the problem described by recurrece (5.4) is (log 2 + 1). The total work doe throughout the tree is the solutio to our recurrece, because the tree simply models the process of iteratig the recurrece. Thus the solutio to recurrece (5.3) is T () =(log + 1). More geerally, we ca cosider a recurrece that it idetical to (5.3), except that T (1) = a, for some costat a. Ithis case, T () =a + log, because a uits of work are doe at level 1 ad additioal uits of work are doe at each of the remaiig log levels. It is still true that, T () =Θ( log ), because the differet base case did ot chage the solutio to the recurrece by more tha a costat factor. Sice oe uit of time will vary from computer to computer, ad sice some kids of work might take loger tha other kids, it is the big-θ behavior of T () that is really relevat. Thus although recursio trees ca give us the exact solutios (such as T () =a+ log above) to recurreces, we will ofte just aalyze a recursio tree to determie the big-θ or eve, i complicated cases, just the big-o behavior of the actual solutio to the recurrece. I Problem?? we explore whether the value of T (1) actually iflueces the big-θ behavior of the solutio to a recurrece. Let s look at oe more recurrece. T () = T (/2) + if >1 1 if =1 (5.5) Agai, assume is a power of two. We ca iterpret this as follows: to solve a problem of size, wemust solve oe problem of size /2 ad do uits of additioal work. We draw the tree for this problem i Figure 5.4. We see i this figure that the problem sizes are the same as i the previous tree. The rest, however, is differet. The umber of subproblems does ot double, rather it remais at oe o each level. Cosequetly the amout of work halves at each level. Note that there are still log +1levels, as the umber of levels is determied by how the problem size is chagig, ot by how may subproblems there are. So o level i, wehave 1problem of size /2 i, for total work of /2 i uits.

7 5.1. GROWTH RATES OF SOLUTIONS TO RECURRENCES 165 We ow wish to compute how much work is doe i solvig a problem that gives this recurrece. Note that the additioal work doe is differet o each level, so we have that the total amout of work is ( + /2+/ = ( 1 log2 4 2) ) + +, which is times a geometric series. By Theorem 4.4, the value of a geometric series i which the largest term is oe is Θ(1). This implies that the work doe is described by T () =Θ(). We emphasize that there is exactly oe solutio to recurrece (5.5); it is the oe we get by usig the recurrece to compute T (2) from T (1), the to compute T (4) from T (2), ad so o. What we have doe here is show that T () =Θ(). We have ot actually foud a solutio. I fact, for the kids of recurreces we have bee examiig, oce we kow T (1) we ca compute T () for ay relevat by repeatedly usig the recurrece, so there is o questio that solutios do exist. What is ofte importat to us i applicatios is ot the exact form of the solutio, but a big-o upper boud, or, better, a Big-Θ boud o the solutio. Exercise Fid a big-θ boud for the solutio to the recurrece 3T (/3) + if 3 T () = 1 if <3 usig a recursio tree. Assume that is a power of 3. Exercise Solve the recurrece T () = 4T (/2) + if 2 1 if =1 usig a recursio tree. Assume that is a power of 2. Covert your solutio to a big-θ statemet about the behavior of the solutio. Exercise Ca you give a geeral big-θ boud for solutios to recurreces of the form T () =at (/2) + whe is a power of 2? You may have differet aswers for differet values of a. The recurrece i Exercise is similar to the mergesort recurrece. Oe differece is that at each step we divide ito 3 problems of size /3. Thus we get the picture i Figure 5.5. Aother differece is that the umber of levels, istead of beig log 2 +1isow log 3 +1,so the total work is still Θ( log ) uits. Note that log b = Θ(log 2 ) for ay b>1. Now let s look at the recursio tree for Exercise Now, we have 4 childre of size /2, ad we get the Figure 5.6 Let s look carefully at this tree. Just as i the mergesort tree there are log 2 +1levels. However, i this tree, each ode has 4 childre. Thus level 0 has 1 ode, level 1 has 4 odes, level 2 has 16 odes, ad i geeral level i has 4 i odes. O level i each ode correspods to a problem of size /2 i ad hece requires /2 i uits of additioal work. Thus the total work o level i is 4 i (/2 i )=2 i uits. Summig over the levels, we get log 2 i=0 log 2 2 i = i=0 2 i.

8 166 CHAPTER 5. RECURSION AND RECURRENCES Figure 5.5: The recursio tree diagram for the recurrece i Exercise /3 /3 + /3 + /3 = log + 1 levels /9 9(/9) = 1 (1) = There are may ways to simplify that expressio, for example from our formula for the sum of a geometric series we get. log 2 T () = i=0 2 i = 1 2(log 2 ) = = 2 2 = Θ( 2 ). Figure 5.6: The Recursio tree for Exercise /2 /2 + /2 + /2 + /2 = 2 log + 1 levels /4 16(/4) = 4 1 ^2(1) = ^2

9 5.1. GROWTH RATES OF SOLUTIONS TO RECURRENCES 167 More simply, by Theorem 4.4 we have that T () =Θ2 log =Θ( 2 ). Three Differet Behaviors Now let s compare the trees for the recurreces T () =2T (/2) +, T () =T (/2) + ad T () =4T (/2) +. Note that all three trees have depth 1 + log 2,asthis is determied by the size of the subproblems relative to the paret problem, ad i each case, the size of each subproblem is 1/2 the size of of the paret problem. To see the differeces, i the first case, o every level, there is the same amout of work. I the secod case, the amout of work decreases, with the most work beig at level 0. I fact, it decreases geometrically, so by Theorem 4.4 the total work doe is bouded above ad below by a costat times the work doe at the root ode. I the third case, the umber of odes per level is growig at a faster rate tha the problem size is decreasig, ad the level with the largest amout of work is the bottom oe. Agai we have a geometric series, ad so by Theorem 4.4 the total work is bouded above ad below by a costat times the amout of work doe at the last level. If you uderstad these three cases ad the differeces amog them, you ow uderstad the great majority of the recursio trees that arise i algorithms. So to aswer Exercise 5.1-4, which asks for a geeral Big-Θ boud for the solutios to recurreces of the form T () =at (/2) +, weca coclude the followig : 1. if a<2 the T () =Θ(). 2. if a =2the T () =Θ( log ) 3. if a>2 the T () =Θ( log 2 a ) Cases 1 ad 2 follow immediately from our observatios above. We ca verify case 3 as follows. At each level i we have a i odes, each correspodig to a problem of size /2 i.thusat level i the total amout of work is a i (/2 i )=(a/2) i uits. Summig over the log 2 levels, we get (a/2) i. log 2 i=0 The sum is a geometric series, so the sum will be big-θ of the largest term (see Theorem 4.4). Sice a>2, the largest term i this case is clearly the last oe, amely (a/2) log 2, ad applyig rules of expoets ad logarithms, we get that times the largest term is ( ) a log2 = alog log 2 = 2log2 a log2 2 log 2 = log2 a = log 2 a Thus the total work doe is Θ( log 2 a ). Importat Cocepts, Formulas, ad Theorems 1. Divide ad Coquer Algorithm. A divide ad coquer algorithm is oe that solves a problem by dividig it ito problems that are smaller but otherwise of the same type as the origial oe, recursively solves these problems, ad the assembles the solutio of these so-called subproblems ito a solutio of the origial oe. Not all problems ca be solved by such a strategy, but a great may problems of iterest i computer sciece ca.

10 168 CHAPTER 5. RECURSION AND RECURRENCES 2. Mergesort. I mergesort we sort a list of items that have some uderlyig order by dividig the list i half, sortig the first half (by recursively usig mergesort), sortig the secod half (by recursively usig mergesort), ad the mergig the two sorted list. For a list of legth oe mergesort returs the same list. 3. Recursio Tree. A recursio tree diagram for a recurrece of the form T () =at (/b)+g() has three parts. O the left, we keep track of the problem size, i the middle we draw the tree, ad o right we keep track of the work doe. We draw the diagram i levels, each level of the diagram represetig a level of recursio. The tree has a vertex represetig the iitial problem ad oe represetig each subproblem we have to solve. Each o-leaf vertex has a childre. The vertices are divided ito levels correspodig to (sub-)problems of the same size; to the left of a level of vertices we write the size of the problems the vertices correspod to; to the right of the vertices o a give level we write the total amout of work doe at that level by a algorithm whose work is described by the recurrece, ot icludig the work doe by ay recursive calls. 4. The Base Level of a Recursio Tree. The amout of work doe o the lowest level i a recursio tree is the umber of odes times the value give by the iitial coditio; it is ot determied by attemptig to make a computatio of additioal work doe at the lowest level. 5. Bases for Logarithms. We use log as a alterate otatio for log 2.Afudametal fact about logarithms is that log b = Θ(log 2 ) for ay real umber b>1. 6. Three behaviors of solutios. The solutio to a recurrece of the form T () =at (/2) + behaves i oe of the followig ways: (a) if a<2 the T () =Θ(). (b) if a =2the T () =Θ( log ) (c) if a>2 the T () =Θ( log 2 a ) Problems 1. Draw recursio trees ad fid big-θ bouds o the solutios to the followig recurreces. For all of these, assume that T (1) = 1 ad is a power of the appropriate iteger. (a) T () =8T (/2) + (b) T () =8T (/2) + 3 (c) T () =3T (/2) + (d) T () =T (/4) + 1 (e) T () =3T (/3) Draw recursio trees ad fid fid exact solutios to the followig recurreces. For all of these, assume that T (1) = 1 ad is a power of the appropriate iteger. (a) T () =8T (/2) + (b) T () =8T (/2) + 3 (c) T () =3T (/2) +

11 5.1. GROWTH RATES OF SOLUTIONS TO RECURRENCES 169 (d) T () =T (/4) + 1 (e) T () =3T (/3) Fid the exact solutio to recurrece Show that log b = Θ(log 2 ). 5. Recursio trees will still work, eve if the problems do ot break up geometrically, or eve if the work per level is ot c uits. Draw recursio trees ad ad fid the best big-o bouds you ca for solutios to the followig recurreces. For all of these, assume that T (1) =1. (a) T () =T ( 1) + (b) T () =2T ( 1) + (c) T () =T ( )+1(You may assume has the form =2 2i.) (d) T () =2T (/2) + log (You may assume is a power of 2.) 6. I each case i the previous problem, is the big-o boud you foud a big-θ boud? 7. If S() =as( 1) + g() ad g() <c with 0 c<a,how fast does S() grow (i big-θ terms)? S() =a i S( 1) + i 1 j=0 aj g( j) =a S(0) + 1 j=0 aj g( j) < a S(0) + 1 j=0 aj c j = a S(0) + c 1 ( a ) j j=0 c = a S(0)+Θ( ( ) a c )=Θ(a ) 8. If S() =as( 1) + g() ad g() >c with 0 <a c, how fast does S() grow i big-θ terms? 9. give a recurrece of the form T () =at (/b)+g() with T (1) = c>0 ad g() > 0 for all ad a recurrece of the form S() =as(/b) +g() with S(1) = 0 (ad the same g()), is there ay differece i the big-θ behavior of the solutios to the two recurreces? What does this say about the ifluece of the iitial coditio o the big-θ behavior of such recurreces?

Soving Recurrence Relations

Soving 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 information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 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 information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In 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 information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Example 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).

Example 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 information

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,

More information

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern. 5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers

More information

3. Greatest Common Divisor - Least Common Multiple

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

Sequences and Series

Sequences 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 information

A probabilistic proof of a binomial identity

A 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 information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, 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 information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties 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 information

Determining the sample size

Determining the sample size Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

More information

Lesson 17 Pearson s Correlation Coefficient

Lesson 17 Pearson s Correlation Coefficient Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) -types of data -scatter plots -measure of directio -measure of stregth Computatio -covariatio of X ad Y -uique variatio i X ad Y -measurig

More information

5 Boolean Decision Trees (February 11)

5 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 information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized? 5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso

More information

Present Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value

Present Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value Cocept 9: Preset Value Is the value of a dollar received today the same as received a year from today? A dollar today is worth more tha a dollar tomorrow because of iflatio, opportuity cost, ad risk Brigig

More information

1. C. The formula for the confidence interval for a population mean is: x t, which was

1. C. The formula for the confidence interval for a population mean is: x t, which was s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

More information

Lesson 15 ANOVA (analysis of variance)

Lesson 15 ANOVA (analysis of variance) Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

Basic Elements of Arithmetic Sequences and Series

Basic Elements of Arithmetic Sequences and Series MA40S PRE-CALCULUS 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 information

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required.

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required. S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Running 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 step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

How To Solve The Homewor Problem Beautifully

How To Solve The Homewor Problem Beautifully Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log

More information

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The

More information

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean 1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

More information

Mathematical goals. Starting points. Materials required. Time needed

Mathematical goals. Starting points. Materials required. Time needed Level A1 of challege: C A1 Mathematical goals Startig poits Materials required Time eeded Iterpretig algebraic expressios To help learers to: traslate betwee words, symbols, tables, ad area represetatios

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions 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

More information

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means) CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:

More information

Section 11.3: The Integral Test

Section 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 information

A Recursive Formula for Moments of a Binomial Distribution

A 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 information

Infinite Sequences and Series

Infinite 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 information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo 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 information

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k. 18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The

More information

Trigonometric 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

Trigonometric 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 information

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the. Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).

More information

CHAPTER 11 Financial mathematics

CHAPTER 11 Financial mathematics CHAPTER 11 Fiacial mathematics I this chapter you will: Calculate iterest usig the simple iterest formula ( ) Use the simple iterest formula to calculate the pricipal (P) Use the simple iterest formula

More information

Lecture 4: Cheeger s Inequality

Lecture 4: Cheeger s Inequality Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients

BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients 652 (12-26) Chapter 12 Sequeces ad Series 12.5 BINOMIAL EXPANSIONS I this sectio Some Examples Otaiig the Coefficiets The Biomial Theorem I Chapter 5 you leared how to square a iomial. I this sectio you

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

Lecture 2: Karger s Min Cut Algorithm

Lecture 2: Karger s Min Cut Algorithm priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.

More information

2-3 The Remainder and Factor Theorems

2-3 The Remainder and Factor Theorems - The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x

More information

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature. Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.

More information

Incremental calculation of weighted mean and variance

Incremental 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 information

SEQUENCES AND SERIES

SEQUENCES 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 information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions

Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions Chapter 5 Uit Aual Amout ad Gradiet Fuctios IET 350 Egieerig Ecoomics Learig Objectives Chapter 5 Upo completio of this chapter you should uderstad: Calculatig future values from aual amouts. Calculatig

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI 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 information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 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 Bru-Mikowski iequality for boxes. Today we ll go over the

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

5.3. Generalized Permutations and Combinations

5.3. Generalized Permutations and Combinations 53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

SAMPLE 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. (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 information

4.3. The Integral and Comparison Tests

4.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 information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu> (March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1

More information

Convexity, Inequalities, and Norms

Convexity, 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 information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PERFORMANCE COUNCIL (IPC) INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

More information

The 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 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 information

INFINITE SERIES KEITH CONRAD

INFINITE 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 information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

FM4 CREDIT AND BORROWING

FM4 CREDIT AND BORROWING FM4 CREDIT AND BORROWING Whe you purchase big ticket items such as cars, boats, televisios ad the like, retailers ad fiacial istitutios have various terms ad coditios that are implemeted for the cosumer

More information

EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND 1 OBTAINED WITH ENGEL SERIES

EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND 1 OBTAINED WITH ENGEL SERIES EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND OBTAINED WITH ENGEL SERIES ELVIA NIDIA GONZÁLEZ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS Abstract. The aciet Egyptias epressed ratioal

More information

Simple Annuities Present Value.

Simple Annuities Present Value. Simple Auities Preset Value. OBJECTIVES (i) To uderstad the uderlyig priciple of a preset value auity. (ii) To use a CASIO CFX-9850GB PLUS to efficietly compute values associated with preset value auities.

More information

Chapter 5: Inner Product Spaces

Chapter 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 information

Solving Logarithms and Exponential Equations

Solving Logarithms and Exponential Equations Solvig Logarithms ad Epoetial Equatios Logarithmic Equatios There are two major ideas required whe solvig Logarithmic Equatios. The first is the Defiitio of a Logarithm. You may recall from a earlier topic:

More information

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2 74 (4 ) Chapter 4 Sequeces ad Series 4. SEQUENCES I this sectio Defiitio Fidig a Formula for the th Term The word sequece is a familiar word. We may speak of a sequece of evets or say that somethig is

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

A Guide to the Pricing Conventions of SFE Interest Rate Products

A Guide to the Pricing Conventions of SFE Interest Rate Products A Guide to the Pricig Covetios of SFE Iterest Rate Products SFE 30 Day Iterbak Cash Rate Futures Physical 90 Day Bak Bills SFE 90 Day Bak Bill Futures SFE 90 Day Bak Bill Futures Tick Value Calculatios

More information

Concept: Types of algorithms

Concept: Types of algorithms Discrete Math for Bioiformatics WS 10/11:, by A. Bockmayr/K. Reiert, 18. Oktober 2010, 21:22 1001 Cocept: Types of algorithms The expositio is based o the followig sources, which are all required readig:

More information

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.

More information

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number. GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea - add up all

More information

How to read A Mutual Fund shareholder report

How to read A Mutual Fund shareholder report Ivestor BulletI How to read A Mutual Fud shareholder report The SEC s Office of Ivestor Educatio ad Advocacy is issuig this Ivestor Bulleti to educate idividual ivestors about mutual fud shareholder reports.

More information

G r a d e. 2 M a t h e M a t i c s. statistics and Probability

G r a d e. 2 M a t h e M a t i c s. statistics and Probability G r a d e 2 M a t h e M a t i c s statistics ad Probability Grade 2: Statistics (Data Aalysis) (2.SP.1, 2.SP.2) edurig uderstadigs: data ca be collected ad orgaized i a variety of ways. data ca be used

More information

Hypergeometric Distributions

Hypergeometric Distributions 7.4 Hypergeometric Distributios Whe choosig the startig lie-up for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you

More information

How Euler Did It. In a more modern treatment, Hardy and Wright [H+W] state this same theorem as. n n+ is perfect.

How Euler Did It. In a more modern treatment, Hardy and Wright [H+W] state this same theorem as. n n+ is perfect. Amicable umbers November 005 How Euler Did It by Ed Sadifer Six is a special umber. It is divisible by, ad 3, ad, i what at first looks like a strage coicidece, 6 = + + 3. The umber 8 shares this remarkable

More information

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Solutions to Exercises Chapter 4: Recurrence relations and generating functions Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL 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 information

Overview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals

Overview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals Overview Estimatig the Value of a Parameter Usig Cofidece Itervals We apply the results about the sample mea the problem of estimatio Estimatio is the process of usig sample data estimate the value of

More information

7.1 Finding Rational Solutions of Polynomial Equations

7.1 Finding Rational Solutions of Polynomial Equations 4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?

More information

Question 2: How is a loan amortized?

Question 2: How is a loan amortized? Questio 2: How is a loa amortized? Decreasig auities may be used i auto or home loas. I these types of loas, some amout of moey is borrowed. Fixed paymets are made to pay off the loa as well as ay accrued

More information

Building Blocks Problem Related to Harmonic Series

Building Blocks Problem Related to Harmonic Series TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite

More information

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This

More information

Fast Fourier Transform

Fast Fourier Transform 18.310 lecture otes November 18, 2013 Fast Fourier Trasform Lecturer: Michel Goemas I these otes we defie the Discrete Fourier Trasform, ad give a method for computig it fast: the Fast Fourier Trasform.

More information

Maximum Likelihood Estimators.

Maximum Likelihood Estimators. Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

More information

Learning objectives. Duc K. Nguyen - Corporate Finance 21/10/2014

Learning objectives. Duc K. Nguyen - Corporate Finance 21/10/2014 1 Lecture 3 Time Value of Moey ad Project Valuatio The timelie Three rules of time travels NPV of a stream of cash flows Perpetuities, auities ad other special cases Learig objectives 2 Uderstad the time-value

More information