Section 3.1: Sequences and Series
|
|
- Alvin Everett Carroll
- 5 years ago
- Views:
Transcription
1 Sectio 3.: Sequeces d Series Sequeces Let s strt out with the defiitio of sequece: sequece: ordered list of umbers, ofte with defiite ptter Recll tht i set, order does t mtter so this is oe wy tht sequece differs from set. Also, repetitio does t mtter i set but does i sequece: if umber is repeted i sequece, it is t cosidered duplicte d cot be removed without chgig the sequece. Sequeces, like sets, c be fiite or ifiite. If sequece is fiite, the either the lst term or the umber of terms must be specified so tht it s cler where the sequece stops. Which of the followig sequeces re ifiite? Which re fiite? ) 7,, 5, 9, b), 4, 9, 6, 5, 36, 00 c) 4,,,,,,, b) d c) re fiite, becuse their lst terms re give. ), however, goes o forever so is ifiite. To begi with, let s exmie some sequeces i detil. We will begi by lookig for ptters i ech sequece. Wht is the ptter for the followig sequeces? Wht is the ext term for ech sequece? ) 7,, 5, 9, b), 4, 9, 6, 5, 36, 00 c) 4,,,,,,,
2 d) 3, 6,, 4, e) 3, 6, 5, 4, ) The ptter is tht you dd 4 to the previous term to get the ext term. The ext term is the 3. b) The ptter is tht if you sy tht is the first term d 4 is the secod term, the will be the th term. So the ext term fter 36 is 49. c) The ptter is to divide ech term by two (or multiply by hlf) to get the ext term. So the term fter /6 will be /3. d) The ptter is to multiply ech term by to get the ext term. The ext term is the 48. e) The ptter is to subtrct 9 from the previous term, so the ext oe is 33. Note tht i this previous exmple, the lst two sequeces looked very similr for three of their first four terms. However, the third term is differet so the ptter for the two sequeces is ot the sme d subsequet terms could look very differet. Nottio We will use the ottio for the th term i sequece, where is the idex. For exmple, the first term would the be, the secod term, d so o. The idex, the, is positive iteger (or turl umber, if you like). Other ottios my strt their coutig with o beig the first term. For the purposes of this course, we ll stick to strtig t =. Defiig Sequece There re three wys to defie sequece: ) List ll of the terms, or eough terms to set up the ptter. If the sequece is fiite, the either the lst term or the umber of terms must be give. ) Give geerl formul for the th term. 3) Give recursive formul for the th term. Let s look t exmples of ech type. For istce, the sequeces 7,, 5, 9, d, 4, 9, 6, 5, 36, 00 re exmples of sequeces defied by listig the terms.
3 Geerl Formul A geerl formul is formul tht gives s fuctio of oly. Let s look t the followig exmples to exmie some sequeces defied i this wy. Give the first four terms of the sequece give by the geerl formul 4 3. = 4 + 3, so = = 7 = = 3 = = 5 4 = = 9 The first four terms re the 7,, 5, d 9. This is the sme sequece tht ws give s prt ) i the first two exmples of this sectio. Give ll terms of the sequece give by the formul for 5. 3 This is fiite sequece, sice restrictios hve bee plced o the vlues of. The terms re the:
4 You c see from the previous exmples tht the geerl formul llows you to clculte for y vlue of. The very useful thig bout the geerl formul is tht you do t eed to kow the previous term to clculte prticulr term. For istce, if you wt to kow the 50 th term of the sequece 7,, 5, 9,, you c determie tht the ptter is to dd 4 to the previous term to get the ext term. However, to get the 50 th term, you d hve to clculte the 49 th first, but the 49 th requires the 48 th, d so o. But if you isted use the expressio 4 3, which gives the sme sequece, the the 50 th term is just d there s o eed to clculte precedig terms. Hdy! Recursive Defiitio A recursive formul gives formul for the ext term i terms of the previous oe. For exmple, i our old fried 7,, 5, 9,, the ext term is foud by ddig 4 to the previous term: 4. However, tht s ot eough iformtio to uiquely defie the series becuse you do t kow where to strt. A complete defiitio must iclude the first term lso. Therefore, the recursive defiitio for our old fried 7,, 5, 9, would be 7 Recursive defiitios, the, must specify the first term or terms d lso the rule which llows you to clculte the ext term from the previous term or terms. 4 Clculte the first four terms of the sequece give by 3 0 The first term is lredy give, 3. The
5 Give recursive formul for the sequece, 6, 8, 54, The ptter is tht the ext term equls the previous term times three. Therefore, 3 Recursive defiitios hve the sme drwbck tht we ve see before: if we wt to kow the 00 th term, we eed to clculte the 99 th first, d so o. Oly the geerl formul llows us to clculte ech term directly without kowig the previous oe. Fibocci sequece The Fibocci sequece is the most fmous exmple of recursive sequece:,,, 3, 5, 8, 3, The ptter c be quite difficult to spot you get the ext term from the sum of the two previous terms. The recursive formul for this sequece is therefore Here, the first two terms must be give to strt off with so tht you re the ble to clculte the third term from the previous two. Series A series is the sum of sequece, which c be fiite or ifiite. Here re two exmples: ) b) Nottio The sum of the first terms of sequece is deoted by S (lso sometimes clled the th prtil sum). If the series is fiite, it could be the sum of ll of the terms. S is how we write the sum of ifiite series, like the secod exmple bove.
6 For the series , clculte S 3 d S 4. S 3 = = 60 S 4 = = 88 However, it s esy to see tht this method becomes very cumbersome for lrge vlues of. We ll develop some more efficiet methods i the ext two sectios. Sigm ottio It s esy to tke sequece i list form d trsform it ito series by chgig ll of the comms to + sigs. However, wht if you re give the geerl formul isted? For exmple, let s tke 7,, 5, 9, which we kow to be 4 3. Sice the geerl form is so useful for fidig whe is lrge, it would be ice if we could reti tht iformtio while writig our sum. To do so, we ll itroduce ew ottio clled sigm ottio. It uses the Greek letter sigm (the uppercse oe): Σ, which is commoly used to me sum of. Let s look t exmple of sigm ottio d discuss wht ll of the prts me. Cosider the followig 5 i (4i 3) The letter i is idex here, d it rus from the vlue give t the bottom of the sigm to the umber t the top of the sigm i steps of. Here, i rus from to 5. We re summig, the, the vlue of 4i + 3 for ech vlue of i s it rus from to 5: 5 i Let s look t more exmples. i i i3 i4 i5 (4i 3)
7 Clculte 3 i (i 5) 3 i i i i 3 (i 5) Clculte 8 j 9 j6 9 j6 j 6 j 7 j 8 j 9 8 j Clculte 6 k 3 6 j k k 3 k 4 k 5 k The tricky thig bout the lst oe is decidig how my terms there re. You my, s is show bove, write out ll of the possible vlues of the idex. Or you my use the followig ifty rule:
8 # terms = lst first + For istce, the lst exmple hd the idex ruig from to 6. The umber of terms, the, for tht series is 6 + = 5. Write the followig series i sigm ottio: Let s pick our idex first. If we wt to be lzy, isted of strtig our idex t, we could strt t d our series would be 0 k Other cceptble swers would ivolve chgig our strtig poit for the idex 9 to give j or i or eve l 55 j fvourite umber. 8 i0 k 65 l57 if 57 hppes to be your Write the followig sequece i sigm ottio: j3 To write ifiite series i sigm ottio, you just replce the fil vlue of the idex with. j
9 Sectio 3.: Sequeces d Series Exercises Predict the ext three terms of the followig sequeces.. 8, 6, 4,., 4, 9, 6, 3., 4, 48, 96, 4. 44, 36, 9, 5.,, 3,, 5, 6, , 0, 0, 7. 3, 5, 37, 49, 8.,,,, Predict the geerl term (or th term ) of the followig sequeces. 9., 4, 9, 6, 0.,, 3,, 5, 6,...., 4, 6, 8,.,,,, Fid the first four terms of the followig recursively defied sequeces
10 6. I ech of the followig, the geerl formul for the th term of sequece is give. Fid the first four terms ! 0. I ech of the followig, the geerl formul for the th term of sequece is give. Clculte the specified terms.. 5 ; ; ; ; 0 Clculte S 3 d S 6 for the followig series Write out ech sum i full d the evlute
11 0 30. j j i0 i k 0 k 0 Write ech series i sigm ottio Evil lert! 37. (sty) Write the sequece, 4, 9, 6, usig recursive defiitio. 38. (tricksy) Write the sequece,, 6, 4, usig geerl formul. 39. (chllegig) Wht s the ext term i the sequece 4, 5, 0, 00, 000? Wht s the recursive formul for this sequece?
12 Sectio 3.: Sequeces d Series Solutios., 0, 8 (ptter is to subtrct ). 5, 36, 49 (th term is equl to 3. 9, 384, 768 (multiply by ) ,, (divide by 4) 5. 7,,3 (th term is ) 6. 40, 80, 60 (multiply by ) 7. 6, 73, 85 (dd ) 8.,, , 7,, , 30, 90, 70 5., 3, 6, ,,, ,, 4, 7 8.,,3,9 3 9.,, 6, 4
13 0.,,, = = = S 3 = 8, S 6 = S 3 = 4, S 6 = 9 7. S 3 = 5, S 6 = S 3 = 9, S 6 = j 30. j i0 5 k 0 0 i j k i k i 3 j k k k
14 37. You could either do or other possibility is 38.! 39. The ext term is 00,
15 Sectio 3.: Arithmetic Sequeces d Series Arithmetic Sequeces Let s strt out with defiitio: rithmetic sequece: sequece i which the ext term is foud by ddig costt (the commo differece d) to the previous term Here re some exmples of rithmetic sequeces: ) 7,, 5, 9, b), 4, 3, 0, 59 c),.3,.6,.9, The first oe hs commo differece of 4, the secod 7, d the third 0.3. Note tht i ech of them, we c fid the commo differece d by tkig y term d subtrctig the previous term from it. For the followig sequeces, stte whether ech of them is rithmetic. ) 3, 0, 7, 4, b) 4, 5, 7, 0, c), 4, 8, 6, d),,,, ) Yes, becuse the commo differece d is 7. b) No, becuse you re ot ddig the sme umber ech time. c) No, becuse you re multiplyig by to get the ext term, ot ddig. d) No, becuse the differece betwee ech pir of terms is differet. Agi, you c defie rithmetic sequece i oe of three wys: by listig the terms, by givig recursive defiitio, or by givig geerl defiitio.
16 Recursive Defiitios for Arithmetic Sequeces Let s look first t exmple. Give recursive defiitio for the sequece, 0, 8, 6, Recll tht recursive defiitio hs two prts: listig the first term d givig the ptter. I this cse, the ptter is ddig d = 8 to the previous term to get the ext term. The recursive defiitio is therefore 8 More geerlly, the recursive formul for y rithmetic sequece is Geerl Formule for Arithmetic Sequeces isert vlue here> d Let s exmie the previous exmple i more detil to see if we c recogize y ptters d come up with geerl formul. Rewritig ech term, we get, 0, 8, 6,...,6,6,63,... So the 3 rd term equls the first plus 6 times, the 4 th term equls the first plus 6 times 3, d the th term will equl the first plus 6 times ( ). More geerlly, the th term will equl the first plus d times ( ). I other words, for y rithmetic sequece. d Write geerl formul for the sequece, 0, 8, 6, This sequece is rithmetic with the first term d commo differece 8.
17 d The geerl formul is the tht = 8 6. Wht is the 50 th term i the sequece i the sequece, 0, 8, 6,? This is the sme sequece from the previous exmple. We my the use the formul we derived, = 8 6, with = The 50 th term is 394. Wht is the commo differece i the rithmetic sequece i which the first term is 8 d the twelfth term is 59? d 59 8 d 77 d d 7 The commo differece is 7. Which term hs vlue of 404 i the sequece 37, 8, 9,?
18 So is 37 d d is +9. The we wt to fid the vlue of for which equls 404. d The fiftieth term is 404. Fid the first four terms of the rithmetic sequece i which the thirteeth term is 97 d the fiftieth term is 393. So 3 = 97 d 50 = 393. The we fid tht d 97 3 d 97 d However, this hs two ukows, d d. Let s look t 50 : d d d We ow hve two ukows, but two equtios, givig us the system 97 d d Solvig this system, we first multiply the top equtio by egtive :
19 97 d d Ad the dd the two equtios together, so tht the terms ccel out d d 8 Now we substitute ito oe of the origil equtios: 97 d Sice = d d = 8, our sequece is the, 9, 7, 5, Arithmetic Series Recll tht S is the sum of the first terms of series. Let s look t couple of exmples of rithmetic series to see if we c idetify y ptters. Suppose we wish to tke some prtil sums of the series Let s first clculte S 6. We could just fid the first six terms d dd them up, but otice the followig: S 6 = The sum of the first d lst umbers is 44. The sum of the secod d secod-to-lst is lso 44. So is the sum of the third d third-lst. So whe you tke the terms i pirs, ech pir hs the sme sum,, d there re / pirs i totl. The S. Wht if, however, there re odd umber of terms? Let s lso clculte S 7 : S 7 =
20 The sum of the first d lst is 5, s is the sum of the ech ier pir. Notice tht the middle, upired vlue, is ½ of 5. So i sese, the middle term is ½ of pir, for totl of 3½ pirs. But tht s just 7/, which is our / i the origil formul! So we re still good. The reltioship still works, for both odd d eve vlues of. S Fid the sum of the first forty terms of the series This is just the sme sequece s before, with = d d = 8. I order to use our previous formul, however, we eed to clculte 40 before we c clculte S d So, S 40 S The sum of the first forty terms is 630. (Much esier th writig out the first forty terms d ddig them up!) I the previous exmple, we used the formul for to clculte the lst term d put its vlue ito the formul for S. We could do tht i more geerl wy: S d d d the lst expressio, which gives S s fuctio of the first term, the umber of terms, d the commo differece, c lso be used to evlute series.
21 Fid the sum of the first oe hudred terms of the sequece 5, 6, 7, 6,. This sum will just be , with = 5 d d =. S d 00 S Clculte j3 The first term will be for j=3 d will equl 5(3)+0=5. Next is j=4 d will equl 5(4)+0=30, j=5 equlig 5(5)=35, d so o. The lst term will be for j=8 d will equl 5(8)+0=00. I other words, our series is Is it rithmetic? Yes, with commo differece d = 5. Wht else do we eed for our clcultio? The umber of terms equls (lst first +), so is (8-3+)=6. The S 6 S Pt the mth istructor sks her studets to do five word problems the first week, six the secod week, seve the third week, d so o, icresig the umber of word problems ech week by oe. ) How my word problems will diliget studets be doig i the lst week of clsses (the th week)?
22 b) How my word problems will diliget studets hve completed durig the course of the term ( weeks)? ) The umber of word problems is sequece: 5, 6, 7,. I fct, it s rithmetic sequece with = 5 d d =. I the eleveth week, the, d 505 Diliget studets will solve 5 word problems i the lst week of clsses. b) The totl umber of word problems solved is S S Diliget studets will hve solved 0 word problems i totl. Summry For rithmetic sequece, the th term is give by d or For rithmetic series, the sum of the first terms (th prtil sum) is S S d
23 Sectio 3.: Arithmetic Sequeces d Series Exercises Stte whether the followig sequeces re rithmetic or ot. If they re, stte the first term d commo differece.. 8, 9,, 3, 6,. 3, 0, 7, 4, 3. 3, 6,, 4, 4.,, 6, 4, 5. 8, 7, 63, 54, ,,,,,, Give both the geerl formul (or th term ) d the recursive formul for the followig rithmetic sequeces. For the geerl formul, be sure to simplify your swer. 7., 3, 5, 7, 8. 5, 6, 7, 8, 9. 40, 37, 34, 3, 0. 4, 8, 3, 36, For the followig rithmetic sequeces, clculte 50 d 6.. 8, 6, 4,,.,.3,.6,.9, Stte whether the followig recursively defied sequeces re rithmetic or ot. (Is there esy wy to tell?)
24 For the followig sequece, clculte the 0 st term: 5, 5, 5, 35, 0. For the followig sequece, which term equls 37?, 9, 7, 5,. Wht is the commo differece for the rithmetic sequece with = 00 d 40?. Clculte the first term for the rithmetic sequece with commo differece 7 whose sixteeth term is Clculte the first four terms of the rithmetic sequece i which the sixth term is 7 d the sixtieth term is Clculte the first four terms of the rithmetic sequece i which the oe hudredth term is 403 d the sixty-fourth term is Give geerl formul for the rithmetic sequece i which the twetieth term is 07 d the thirty-fifth term is Give recursive formul for the rithmetic sequece i which the eleveth term is 44 d the fifty-secod term is Clculte S 0 for the series Evlute the series Evlute the series Clculte S 00 for the series Clculte the sum of the odd umbers betwee 00 d Fid the sum of the turl umbers from 50 to 5, iclusive.
25 Clculte the followig sums k 0 9 j0 40 i30 50 k 3 5k 6 j i 7 7 3k 37. I supermrket disply, there re 37 cs i the bottom lyer, 35 i the ext lyer up, 33 i the ext, d so o. How my lyers re there if there re 7 cs i the top row? 38. I the previous problem, how my cs re there ltogether? 39. I old-fshioed thetre, there re 5 sets i the first row, 6 i the ext, 7 i the oe fter, d so o. If there re 0 rows i totl, how my sets re there ltogether?
26 Sectio 3.: Arithmetic Sequeces d Series Solutios. ot rithmetic. yes, d = 7 3. o 4. o 5. yes, d = 9 6. yes, d = ¼ 7. d 8. 6 d d d , so 50 = 80 d 6 = , so 50 = 6.7 d 6 = first four terms re 5, 9, 3, 7, so rithmetic with d = 4 4. first four terms re, 4, 48, 96, so ot rithmetic 5. first four terms re 75, 55, 35, 5, so rithmetic with d = 0 6. first four terms re 6, 7, 8, 9, so rithmetic with d = 7. first four terms re 7, 5, 7, 5, so ot rithmetic 8. first four terms re 3, 9, 8, 656, so ot rithmetic
27 9. 0 5, so 0 = , so = 8. d = 40. = 3 3. = d d = 3, so the first four terms re, 5, 8, 4. = 7 d d = 4, so the first four terms re 7,, 5, S 0 = S 5 = S = S 00 = S 00 = S 76 = S 53 = S 83 = S = S 500 = 370, = S 6 = S 0 = 690
28 Sectio 3.3: Geometric Sequeces d Series Geometric Sequeces Let s strt out with defiitio: geometric sequece: sequece i which the ext term is foud by multiplyig the previous term by costt (the commo rtio r) Here re some exmples of geometric sequeces: ) 9, 8, 36, 7, b), 8, 7, 8, c) 0, 30, 90, 70, d) 3,, 48, 9, e) 48, 36, 7, The commo rtios of ech of these sequeces, i order from ) to e), is, 3, 3, 4, 3, 4 respectively. Note tht i ech of them, we c fid the commo rtio r by tkig y term d dividig it by the previous term. Like y other sequeces, geometric sequeces c be fiite or ifiite. c) bove is fiite, s the lst term is specified. The others re ifiite sequeces. For ech of the followig sequeces, stte whether it is rithmetic, geometric, or either. ) 45, 5, 5, b) 5, 3,,, c), 8, 7, 64,, 000 d),,,,,, ) Geometric, becuse the commo rtio r is 3.
29 b) Arithmetic, becuse the commo differece d is. c) Neither, becuse there is t either commo differece or rtio betwee terms. 3 (I fct, the ptter is tht.) d) Geometric, becuse the commo rtio r is. Agi, you c defie geometric sequece i oe of three wys: by listig the terms, by givig recursive defiitio, or by givig geerl defiitio. Recursive Defiitios for Geometric Sequeces Let s look t exmple. Give recursive defiitio for the sequece, 0, 50, 50, Recll tht recursive defiitio hs two prts: listig the first term d givig the ptter. I this cse, the ptter is multiplyig the previous term by r = 5 to get the ext term. The recursive defiitio is therefore 5 More geerlly, the recursive defiitio for y geometric sequece is Geerl Formule for Geometric Sequeces <isert vlue here> r Let s exmie the previous exmple i more detil to see if we c recogize y ptters d come up with geerl formul. Rewritig ech term, we get, 0, 50, 50,... 3, 5, 5, 5,... So the 3 rd term equls the first times 5 squred, the 4 th term equls the first times 5 cubed, d the th term will equl the first times 5 rised to the ( ) power. More geerlly, the th term equls the first term times r rised to the ( ) power, mely r
30 for ll geometric sequeces. Write geerl formul for the sequece 3, 6,, This sequece is geometric with the first term 3 d commo rtio. r 3 The geerl formul is the tht = 3 -. Wht is the 0 th term i the sequece i the sequece 3, 6,,? This is the sme sequece from the previous exmple. We my the use the formul we derived bove with = r ,57,864 The 0 th term is,57,864, which provides ice exmple for how fst geometric sequeces c grow, eve for smll vlues of r. Write geerl formul for the sequece 8,, 8, 7,? Wht is the fifteeth term i this sequece? The fiftieth?
31 5 50 r So the geerl formul is d , respectively. d the fifteeth d fiftieth terms re Geometric Series Recll tht S is the sum of the first terms of series. Let s look t how formul for S is derived. S... S r r r r r r Let s tke tht lst expressio for S d multiply it by r to get rs rr r r... r r r The if we dd the rows for S d rs, we get S r r r... r r r 3 4 rs r r r r... r r r S rs r sice ll of the terms i betwee these two ( d r ) will ccel. The S r r d S r r The lst formul bove is the formul for the sum of the first terms for y geometric series.
32 Fid the sum of the first 0 terms of the series This is geometric series with = 3 d r =. We wt to fid S 0. S S 0 r r 3 The sum of the first 0 terms is 3,45, ,45,75 Fid the sum of the first forty terms of the series This is geometric series with = 8 d r = S S 0 r r We wt to fid S The sum of the first forty terms is Sum of Ifiite Geometric Series Let s tke look t the ifiite series Wht hppes whe we try to evlute this sum usig the S formul? We c put = ½, r = ½, d = ito the formul, but we will ru ito rodblock whe we try to evlute (½).
33 Let s tke closer look t the behviour of (½) for lrge vlues of. As gets lrger, the frctio gets ever smller. I fct, s pproches, (½) will pproch zero. This is true for y r provided tht r <. (If you re ot fmilir with the bsolute vlue brs, x, equivlet expressio is tht < r <.) Recllig tht S r r d lettig the r term go to zero, the S r for < r < for y ifiite geometric series, provided tht r meets the restrictio bove. Let s ow revisit the series tht strted this discussio,..., d evlute it i the followig exmple. Evlute This series is geometric with = ½ d r = ½. The The sum of this series is. / / S r / / Evlute This series is geometric with = 4 d r = 3.
34 4 4 3 S 4 7 r 3 3 Evlute This series is ideticl to the previous oe except tht r is ow egtive: = 4 d r = S r Evlute This series is geometric with = d r = 3. You my lredy relize wht s goig o, but i cse you do t, let s ively put the vlues ito the formul d see wht we get: S 4 r 3 Wit! How c the sum of buch of positive umber be egtive? The swer is tht our restrictio for r is tht it must be betwee d, but r =.5. Becuse r does ot stisfy the restrictio, we cot use the bove formul for S. Ideed, if you dd up buch of positive umbers tht re icresig s you go up, you c see tht the sum just keeps gettig bigger s we dd more terms. You could the either sy tht the sum is ifiite (dicey) or does ot exist (sfer). But why is it sfer to sy does ot exist i the lst exmple? Let s look t three sums: )
35 b) 8 7 c) Ech term i ) is gettig more positive, so the sum of tht sequece will be +. Ech term i b) is gettig more d more egtive, so the sum of tht sequece will be. But i the lst term, the sum oscilltes bck d forth: S =, S = 6, S 3 =, S 4 = 9.5, d so o. The sig of S is either positive or egtive depedig o whether the umber of terms you ve dded is eve or odd. Rther th debtig whether ifiity is odd or eve (?!), we will just sy tht the sum does ot exist. Evlute j 7 j0 3. Ick! The best plce to strt is to figure out the first few terms to determie the ptter: whe j = 0, whe j =, whe j =, so our sequece is 7, 9, 3, This is geometric with = 7 d r = 3. The S r 3 3 Evlute k. k 5
36 Oce gi, let s figure out the first few terms to determie the ptter: whe k = 5, k 5.5 whe k = 6, k 6 3 whe k = 7, k so our sequece is.5, 3, 3.5. Wit! This is rithmetic! Not oly tht, but the umbers re icresig. So the sum will be ifiite, or if you prefer, the sum does ot exist. Repetig Decimls Let s exmie 0.7 i some detil to see wht we fid: But this is just the sum of ifiite series with = 0.7 d r = 0.. Rewritig d r i frctio form (you ll see why i miute) gives = 7 0 d r = 0. The S r So 0.7 = 7/9. Iterestig! Fid exct frctio for
37 But this is just the sum of ifiite series with = 6 0 d r = 0. The S r So 0.6 = /3. Fid exct frctio for But this is just the sum of ifiite series with = 8 00 d r = 00. The S r So 0.8 = /. Summry For geometric sequece, the th term is give by r For geometric series, the sum of the first terms (th prtil sum) is S r r For ifiite geometric series, the sum is S, provided tht < r <. r
38 Sectio 3.3: Geometric Sequeces d Series Exercises Stte whether the followig sequeces re geometric or ot. If they re, stte the first term d commo rtio.. 8, 9,, 3, 6,. 3, 0, 7, 4, 3. 3, 6,, 4, 4.,, 6, 4, 5. 8, 7, 63, 54, 6. 7,48,3,... Give both the geerl formul (or th term ) d the recursive formul for the followig geometric sequeces. 7., 3, 9, 7, 8. 64, 6, 4,, 9., 6,, 4, 0. 4,.4, 0.4, For the followig sequeces, clculte 50 d 6.., 8, 7,., 8, 6 3, Stte whether the followig recursively defied sequeces re geometric or ot. (Is there esy wy to tell?)
39 For the followig sequece, clculte the 0 st term: 5, 5, 45, 0. For the followig sequece, clculte the 0 th term: 7, 4, 8,. Clculte S 0 for the series Clculte S 0 for the series Clculte the sum, if it exists, for the followig series Clculte the followig sums, if they exist k 0 j k j i 5 0. j
40 i i0 3. If the umber of vmpires i Trsylvi doubles every moth, the how my vmpires will be i Trsylvi i 3 yers, strtig from oe idividul? Commet o your result if the totl popultio of Trsylvi is millio people. 3. As I ws goig to St. Ives, I met m with seve wives. Ech wife hd seve scks. Ech sck hd seve cts. Ech sck hd seve kits. Kits, cts, scks, wives: does this form geometric sequece? 33. The pper used i the photocopier by Pt s office is sid to be mm thick. If it is folded over repetedly, doublig its thickess ech time, how thick will the pper be if it s folded 7 times? Bous: why, the, were the Mythbusters hvig so my problems tryig to fold the pper this my times?
41 Sectio 3.3: Geometric Sequeces d Series Solutios. o. o 3. yes, r = 4. o 5. o 6. yes, r = 3 7. d d d d , so d , so d o 4. yes, with r = 5. yes, with r = 0 6. o
42 7. yes, with r = 8. o 9. 53, so 0 = 5(3) 00 = , so 0 = 7( ) 9 = 3,670,06. S 0 = 00 (The exct swer is to three decimls, the swer is ) or , but if you roud. S 0 = 04,857, S r / S = S does ot exist (r > ) 6. S = 6 7. S r 888 ( r ) ( ) 8. S =.5 9. S = S does ot exist (r < ) 3. 3 yers is 36 moths, so we hve 36-term sequece strtig with,, 4, 8, The th term will be, so the 36 th term will be ,359,738,368, which is td lrger th the totl popultio of Trsylvi. 3. m 7 wives # scks = #wives # scks/wife = 7 7 = 49
43 # cts = #scks # cts/sck = 49 7 = 343 # kits = #cts # kits/ct = = 40 So kits, cts, scks, d wives is 40, 373, 49, 7, which is geometric sequece with four terms: = 40 d r = / After oe fold, the thickess will be 0.097, fter two folds 0.097, etc. So our strtig term will be d the will double with r = therefter. So 0.097, d the 7 th term will be , d the pper thickess will be.4 mm, or just over cm thick. (The Mythbusters relized tht the problems with pperfoldig lie with the fold itself. If I remember correctly, they resorted to C-clmps d hittig the fold with hmmer to fltte it.)
Section 3.2: Arithmetic Sequences and Series
Sectio 3.: Arithmetic Sequeces Series Arithmetic Sequeces Let s strt out with efiitio: rithmetic sequece: sequece i which the ext term is fou by ig costt (the commo ifferece ) to the previous term Here
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More information. (b) Evaluate the sum given by. Exercise #1: A sequence is defined by the equation a n 2n
Nme: 453 Dte: SEQUENCES ALGEBRA WITH TRIGONOMETRY Sequeces, or ordered list of umbers, re extremely importt i mthemtics, both theoreticl d pplied A sequece is formlly defied s fuctio tht hs s its domi
More informationCS280 HW1 Solution Set Spring2002. now, we need to get rid of the n term. We know that:
CS80 HW Solutio Set Sprig00 Solutios by: Shddi Doghmi -) -) 4 * 4 4 4 ) 4 b-) ) ) ) * ) ) ) 0 ) c-) ) ) ) ) ) ow we eed to get rid of the term. We ow tht: ) ) ) ) substitute ito the recursive epressio:
More information3n
Prctice Set 6 Sequeces d Series Clcultor Required Objectives Alyze ptters i sequeces to determie subsequet terms. Fid the first four terms of sequece give equtio for. Fid expressio for give sequece. Expd
More informationDef : A radical is an expression consisting of a radical sign (radical symbol), a radicand, and an index.
Mth 0 Uit : Roots & Powers Red Buildig O, Big Ides, d New Vocbulry, p. 0 tet.. Estitig Roots ( clss) Red Lesso Focus p. tet. Outcoes Ch. Notes. Defie d give eple of rdicl. pp. 0, 9. Idetify the ide d the
More informationA Variant of Pascal s Triangle Dennis Van Hise Stetson University
A Vrit of Pscl s Trigle eis V Hise tetso Uiversity I. Itroductio d Nottio It is the purpose of this pper to explore vrit of Pscl s trigle. This vrit hs the rule tht every etry, deoted s,, where,, is clculted
More informationPrimitive Pythagorean triples and generalized Fibonacci sequences
Notes o Number Theory d Discrete Mthemtics Prit ISSN 30 53, Olie ISSN 37 875 Vol 3, 07, No, 5 Primitive Pythgore triples d geerlized ibocci sequeces J V Leyedekkers d A G Sho, 3 culty of Sciece, The Uiversity
More informationLogic Spring Final Review
Idirect Argumet: Cotrdictios d Cotrpositio. Prove the followig by cotrdictio d by cotrpositio. Give two seprte proofs. The egtive of y irrtiol umber is irrtiol. b. For ll iteger, if ² is odd the is odd.
More informationUsing Gaussian Elimination for Determination of Structure Index in Euler Deconvolution
Austrli Jourl of Bsic d Applied Scieces, 4(1): 6390-6396, 010 ISSN 1991-8178 Usig Gussi Elimitio for Determitio of Structure Idex i Euler Decovolutio 1 Rez.toushmli d M.ghbri 1 Islmic zd uiversity,hmed
More informationEE 477 Digital Signal Processing. 8a IIR Systems
EE 477 Digitl Sigl Processig 8 IIR Systems Geerl Differece Equtio FIR: output depeds o curret d pst iputs oly IIR: output depeds o curret d pst iputs d pst outputs y M [] b x[ ] + y[ l] l N l EE 477 DSP
More informationAn (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the.
Sectio.2 Arithmetic Sequeces ad Series -.2 Arithmetic Sequeces ad Series Arithmetic Sequeces Arithmetic Series Key Terms: arithmetic sequece (arithmetic progressio), commo differece, arithmetic series
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationGauss-Seidel Method. An iterative method. Basic Procedure:
Guss-Siedel Method Guss-Seidel Method A itertive method. Bsic Procedure: -Algebriclly solve ech lier equtio for i -Assume iitil guess solutio rry -Solve for ech i d repet -Use bsolute reltive pproimte
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationThe Chromatic Covering of a Graph: Ratios, Domination, Areas and Farey Sequences.
The Chromtic Coverig of Grph: Rtios Domitio res d Frey eueces. Pul ugust Witer mthemtics UKZN Durb outh fric emil: witerp@ukz.c.z bstrct The study of the chromtic umber d vertex coverigs of grphs hs opeed
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationExamples and Applications of Binary Search
Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We
More information1.8 What Comes Next? What Comes Later?
35 1.8 What Comes Next? What Comes Later? A Practice Uderstadig Task For each of the followig tables, CC BY Hiroaki Maeda https://flic.kr/p/6r8odk describe how to fid the ext term i the sequece, write
More informationSEQUENCES AND SERIES
SEQUENCES AND SERIES U N I The umber of gifts set i the popular Christmas Carol days of Christmas form a sequece. A part of the sog goes this way O the th day of Christmas my true love gave to me drummers
More informationEX 1 Find the length of each side EX 2 Find the value of a, b, c, d. if the perimeter is 20.
HOW DOES THIS APPLY? EX Fid the legth of eh side EX 2 Fid the vlue of, b,, d. if the perieter is 20. To solve or ot to solve? C you solve usig properties of isoseles trigles disovered? If so, write the
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationGauss-Siedel Method. Major: All Engineering Majors. Authors: Autar Kaw
Guss-Siedel Method Mjor: All Egieerig Mjors Authors: Autr Kw http://umericlmethods.eg.usf.edu Trsformig Numericl Methods Eductio for STEM Udergrdutes 4//06 http://umericlmethods.eg.usf.edu Guss-Seidel
More informationON THE STABILITY OF LU-FACTORIZATIONS
Idi Jourl of Fudetl d pplied Life Scieces ISSN: 3 6345 (Olie) Ope ccess Olie Itertiol Jourl vilble t wwwcibtechorg/sped/jls/4/4/jlsht 4 Vol 4 (S4) pp 4-49/Sfdr Reserch rticle BSTRCT ON THE STBILITY OF
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationSubtracting Fractions
Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationRecursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames
Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationd i e j example:
Expoet Rules Mth II Foruls to study for NC Fil Ex Fll 017 exple: 0 1 exple: 0 = 1 c h exple: c h 6 1 1 1 exple: 9 bbg b exple: bbg 1 b d 9 F F exple: exple: 7 7 4 16 HG I K J F H G I K J HG I K J F H G
More informationMatrices and Systems of Equations
Mtrices Mtrices nd Sstems of Equtions A mtri is rectngulr rr of rel numbers. CHAT Pre-Clculus Section 8. m m m............ n n n mn We will use the double subscript nottion for ech element of the mtri.
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationMath 3201 Notes Chapter 4: Rational Expressions & Equations
Learig Goals: See p. tet.. Equivalet Ratioal Epressios ( classes) Read Goal p. 6 tet. Math 0 Notes Chapter : Ratioal Epressios & Equatios. Defie ad give a eample of a ratioal epressio. p. 6. Defie o-permissible
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationAnswer Key Lesson 6: Workshop: Angles and Lines
nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power
More informationMath 142, Exam 1 Information.
Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More information50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:
5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )
More informationRaytracing: Quality. Ray Genealogy. Ray Genealogy. Describe what you see! Describe what you see! Describe what you see!
Rytrcig: Qulity COSC 4328/5327 Scott A. Kig Ry Geelogy Primry rys spw off 3 rys. Two of those c spw of 3 more, etc. Whe do you stop? Whe ry leves the scee. Whe the cotriutio is smll eough. After ech ouce
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationUNIT 1 RECURRENCE RELATIONS
UNIT RECURRENCE RELATIONS Structure Page No.. Itroductio 7. Objectives 7. Three Recurret Problems 8.3 More Recurreces.4 Defiitios 4.5 Divide ad Coquer 7.6 Summary 9.7 Solutios/Aswers. INTRODUCTION I the
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:
CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationThe Graphs of Polynomial Functions
Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where
More informationFURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)
Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES
More informationSIMPLIFYING ALGEBRA PASSPORT.
SIMPLIFYING ALGEBRA PASSPORT www.mthletics.com.u This booklet is ll bout turning complex problems into something simple. You will be ble to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give
More informationOn Some Iterative Methods for Solving Systems of Linear Equations
Computtiol d Applied Mthemtics Jourl 205; (2: 2-28 Published olie Februry 20, 205 (http://www.scit.org/jourl/cmj O Some Itertive Methods for Solvig Systems of Lier Equtios Fdugb Sudy Emmuel Deprtmet of
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationCounting unlabeled full binary rooted plane trees
Coutig uleled full iry rooted ple trees How my wys re there to plce - pirs of pretheses i the product i such wy tht the order of multiplictio is completely specified? = = Coutig uleled full iry rooted
More informationIntegration. October 25, 2016
Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationIntegration. September 28, 2017
Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my
More informationRecursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:
Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More information6.2 Definite Integrals
78 Chter 6 The Defiite Itegrl 6. Defiite Itegrls Wht ou will ler out... Riem Sums Termiolog d Nottio of Itegrtio Defiite Itegrl d Are Costt Fuctios Itegrls o Clcultor Discotiuous Itegrle Fuctios d wh...
More informationIf f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.
Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the
More informationFall 2018 Midterm 1 October 11, ˆ You may not ask questions about the exam except for language clarifications.
15-112 Fll 2018 Midterm 1 October 11, 2018 Nme: Andrew ID: Recittion Section: ˆ You my not use ny books, notes, extr pper, or electronic devices during this exm. There should be nothing on your desk or
More information9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association
9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationCMPT 125 Assignment 2 Solutions
CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes
More information