# PERMUTATIONS AND COMBINATIONS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Chapter 7 PERMUTATIONS AND COMBINATIONS Every body of discovery is mathematical i form because there is o other guidace we ca have DARWIN 7.1 Itroductio Suppose you have a suitcase with a umber lock. The umber lock has 4 wheels each labelled with 10 digits from 0 to 9. The lock ca be opeed if 4 specific digits are arraged i a particular sequece with o repetitio. Some how, you have forgotte this specific sequece of digits. You remember oly the first digit which is 7. I order to ope the lock, how may sequeces of 3-digits you may have to check with? To aswer this questio, you may, immediately, start listig all possible arragemets of 9 remaiig digits take 3 at a time. But, Jacob Beroulli this method will be tedious, because the umber of possible ( ) sequeces may be large. Here, i this Chapter, we shall lear some basic coutig techiques which will eable us to aswer this questio without actually listig 3-digit arragemets. I fact, these techiques will be useful i determiig the umber of differet ways of arragig ad selectig objects without actually listig them. As a first step, we shall examie a priciple which is most fudametal to the learig of these techiques. 7.2 Fudametal Priciple of Coutig Let us cosider the followig problem. Moha has 3 pats ad 2 shirts. How may differet pairs of a pat ad a shirt, ca he dress up with? There are 3 ways i which a pat ca be chose, because there are 3 pats available. Similarly, a shirt ca be chose i 2 ways. For every choice of a pat, there are 2 choices of a shirt. Therefore, there are pairs of a pat ad a shirt.

2 PERMUTATIONS AND COMBINATIONS 135 Let us ame the three pats as P 1, P 2, P 3 ad the two shirts as S 1, S 2. The, these six possibilities ca be illustrated i the Fig Let us cosider aother problem of the same type. Sabam has 2 school bags, 3 tiffi boxes ad 2 water bottles. I how may ways ca she carry these items (choosig oe each). A school bag ca be chose i 2 differet ways. After a school bag is chose, a tiffi box ca be chose i 3 differet ways. Hece, there are pairs of school bag ad a tiffi box. For each of these pairs a water bottle ca be chose i 2 differt ways. Fig 7.1 Hece, there are differet ways i which, Sabam ca carry these items to school. If we ame the 2 school bags as B 1, B 2, the three tiffi boxes as T 1, T 2, T 3 ad the two water bottles as W 1, W 2, these possibilities ca be illustrated i the Fig Fig 7.2

3 136 MATHEMATICS I fact, the problems of the above types are solved by applyig the followig priciple kow as the fudametal priciple of coutig, or, simply, the multiplicatio priciple, which states that If a evet ca occur i m differet ways, followig which aother evet ca occur i differet ways, the the total umber of occurrece of the evets i the give order is m. The above priciple ca be geeralised for ay fiite umber of evets. For example, for 3 evets, the priciple is as follows: If a evet ca occur i m differet ways, followig which aother evet ca occur i differet ways, followig which a third evet ca occur i p differet ways, the the total umber of occurrece to the evets i the give order is m p. I the first problem, the required umber of ways of wearig a pat ad a shirt was the umber of differet ways of the occurece of the followig evets i successio: (i) the evet of choosig a pat (ii) the evet of choosig a shirt. I the secod problem, the required umber of ways was the umber of differet ways of the occurece of the followig evets i successio: (i) the evet of choosig a school bag (ii) the evet of choosig a tiffi box (iii) the evet of choosig a water bottle. Here, i both the cases, the evets i each problem could occur i various possible orders. But, we have to choose ay oe of the possible orders ad cout the umber of differet ways of the occurece of the evets i this chose order. Example 1 Fid the umber of 4 letter words, with or without meaig, which ca be formed out of the letters of the word ROSE, where the repetitio of the letters is ot allowed. Solutio There are as may words as there are ways of fillig i 4 vacat places by the 4 letters, keepig i mid that the repetitio is ot allowed. The first place ca be filled i 4 differet ways by ayoe of the 4 letters R,O,S,E. Followig which, the secod place ca be filled i by ayoe of the remaiig 3 letters i 3 differet ways, followig which the third place ca be filled i 2 differet ways; followig which, the fourth place ca be filled i 1 way. Thus, the umber of ways i which the 4 places ca be filled, by the multiplicatio priciple, is Hece, the required umber of words is 24.

4 PERMUTATIONS AND COMBINATIONS 137 Note If the repetitio of the letters was allowed, how may words ca be formed? Oe ca easily uderstad that each of the 4 vacat places ca be filled i successio i 4 differet ways. Hece, the required umber of words Example 2 Give 4 flags of differet colours, how may differet sigals ca be geerated, if a sigal requires the use of 2 flags oe below the other? Solutio There will be as may sigals as there are ways of fillig i 2 vacat places i successio by the 4 flags of differet colours. The upper vacat place ca be filled i 4 differet ways by ayoe of the 4 flags; followig which, the lower vacat place ca be filled i 3 differet ways by ayoe of the remaiig 3 differet flags. Hece, by the multiplicatio priciple, the required umber of sigals Example 3 How may 2 digit eve umbers ca be formed from the digits 1, 2, 3, 4, 5 if the digits ca be repeated? Solutio There will be as may ways as there are ways of fillig 2 vacat places i successio by the five give digits. Here, i this case, we start fillig i uit s place, because the optios for this place are 2 ad 4 oly ad this ca be doe i 2 ways; followig which the te s place ca be filled by ay of the 5 digits i 5 differet ways as the digits ca be repeated. Therefore, by the multiplicatio priciple, the required umber of two digits eve umbers is 2 5, i.e., 10. Example 4 Fid the umber of differet sigals that ca be geerated by arragig at least 2 flags i order (oe below the other) o a vertical staff, if five differet flags are available. Solutio A sigal ca cosist of either 2 flags, 3 flags, 4 flags or 5 flags. Now, let us cout the possible umber of sigals cosistig of 2 flags, 3 flags, 4 flags ad 5 flags separately ad the add the respective umbers. There will be as may 2 flag sigals as there are ways of fillig i 2 vacat places i successio by the 5 flags available. By Multiplicatio rule, the umber of ways is Similarly, there will be as may 3 flag sigals as there are ways of fillig i 3 vacat places i successio by the 5 flags.

5 138 MATHEMATICS The umber of ways is Cotiuig the same way, we fid that The umber of 4 flag sigals ad the umber of 5 flag sigals Therefore, the required o of sigals EXERCISE How may 3-digit umbers ca be formed from the digits 1, 2, 3, 4 ad 5 assumig that (i) repetitio of the digits is allowed? (ii) repetitio of the digits is ot allowed? 2. How may 3-digit eve umbers ca be formed from the digits 1, 2, 3, 4, 5, 6 if the digits ca be repeated? 3. How may 4-letter code ca be formed usig the first 10 letters of the Eglish alphabet, if o letter ca be repeated? 4. How may 5-digit telephoe umbers ca be costructed usig the digits 0 to 9 if each umber starts with 67 ad o digit appears more tha oce? 5. A coi is tossed 3 times ad the outcomes are recorded. How may possible outcomes are there? 6. Give 5 flags of differet colours, how may differet sigals ca be geerated if each sigal requires the use of 2 flags, oe below the other? 7.3 Permutatios I Example 1 of the previous Sectio, we are actually coutig the differet possible arragemets of the letters such as ROSE, REOS,..., etc. Here, i this list, each arragemet is differet from other. I other words, the order of writig the letters is importat. Each arragemet is called a permutatio of 4 differet letters take all at a time. Now, if we have to determie the umber of 3-letter words, with or without meaig, which ca be formed out of the letters of the word NUMBER, where the repetitio of the letters is ot allowed, we eed to cout the arragemets NUM, NMU, MUN, NUB,..., etc. Here, we are coutig the permutatios of 6 differet letters take 3 at a time. The required umber of words (by usig multiplicatio priciple). If the repetitio of the letters was allowed, the required umber of words would be

6 PERMUTATIONS AND COMBINATIONS 139 Defiitio 1 A permutatio is a arragemet i a defiite order of a umber of objects take some or all at a time. I the followig sub Sectio, we shall obtai the formula eeded to aswer these questios immediately Permutatios whe all the objects are distict Theorem 1 The umber of permutatios of differet objects take r at a time, where 0 < r ad the objects do ot repeat is ( 1) ( 2)...( r + 1), which is deoted by P r. Proof There will be as may permutatios as there are ways of fillig i r vacat places... by r vacat places the objects. The first place ca be filled i ways; followig which, the secod place ca be filled i ( 1) ways, followig which the third place ca be filled i ( 2) ways,..., the rth place ca be filled i ( (r 1)) ways. Therefore, the umber of ways of fillig i r vacat places i successio is ( 1) ( 2)... ( (r 1)) or ( 1) ( 2)... ( r + 1) This expressio for P r is cumbersome ad we eed a otatio which will help to reduce the size of this expressio. The symbol! (read as factorial or factorial ) comes to our rescue. I the followig text we will lear what actually! meas Factorial otatio The otatio! represets the product of first atural umbers, i.e., the product ( 1) is deoted as!. We read this symbol as factorial. Thus, ( 1)! 1 1! 1 2 2! ! ! ad so o. We defie 0! 1 We ca write 5! 5 4! 5 4 3! ! ! Clearly, for a atural umber! ( 1)! ( 1) ( 2)! [provided ( 2)] ( 1) ( 2) ( 3)! [provided ( 3)] ad so o.

7 140 MATHEMATICS Example 5 Evaluate (i) 5! (ii) 7! (iii) 7! 5! Solutio (i) 5! (ii) 7! ad (iii) 7! 5! Example 6 Compute (i) 7! 5! 12! (ii) ( 10! ) (2!) Solutio (i) We have 7! 5! 7 6 5! 5! ad (ii) 12! ( 10! )( 2! ) ( ) ( 10! ) ( 2) ! Example 7 Evaluate r ( r)!!!, whe 5, r 2. 5! 2! 5 2! Solutio We have to evaluate ( ) (sice 5, r 2) 5! 2! 5 2! We have ( ) 5! ! 3! 2 Example 8 If 1 1 x +, fid x. 8! 9! 10! Solutio We have 1 1 x + 8! 9 8! ! Therefore 1 x So x 100. or 10 x EXERCISE Evaluate (i) 8! (ii) 4! 3!

8 PERMUTATIONS AND COMBINATIONS Is 3! + 4! 7!? 3. Compute 8! 6! 2! 4. If 1 1 x +, fid x 6! 7! 8!! 5. Evaluate ( r)!, whe (i) 6, r 2 (ii) 9, r Derivatio of the formula for P r! Pr ( r)!, 0 r Let us ow go back to the stage where we had determied the followig formula: P r ( 1) ( 2)... ( r + 1) Multiplyig umerator ad deomirator by ( r) ( r 1) , we get ( ) ( ) ( )( )( ) ( r)( r 1) r+ 1 r r P r! ( r )! Thus Pr ( r)!, where 0 < r This is a much more coveiet expressio for P r tha the previous oe.! I particular, whe r, P! 0! Coutig permutatios is merely coutig the umber of ways i which some or all objects at a time are rearraged. Arragig o object at all is the same as leavig behid all the objects ad we kow that there is oly oe way of doig so. Thus, we ca have P 0 1!!! ( 0)!... (1),! Therefore, the formula (1) is applicable for r 0 also.! P, 0 r!. Thus r ( r)

9 142 MATHEMATICS Theorem 2 The umber of permutatios of differet objects take r at a time, where repetitio is allowed, is r. Proof is very similar to that of Theorem 1 ad is left for the reader to arrive at. Here, we are solvig some of the problems of the pervious Sectio usig the formula for P r to illustrate its usefuless. I Example 1, the required umber of words 4 P 4 4! 24. Here repetitio is ot allowed. If repeatio is allowed, the required umber of words would be The umber of 3-letter words which ca be formed by the letters of the word NUMBER 6 6! P3 3! Here, i this case also, the repetitio is ot allowed. If the repetitio is allowed,the required umber of words would be The umber of ways i which a Chairma ad a Vice-Chairma ca be chose from amogst a group of 12 persos assumig that oe perso ca ot hold more tha oe positio, clearly 12 12! P ! Permutatios whe all the objects are ot distict objects Suppose we have to fid the umber of ways of rearragig the letters of the word ROOT. I this case, the letters of the word are ot all differet. There are 2 Os, which are of the same kid. Let us treat, temporarily, the 2 Os as differet, say, O 1 ad O 2. The umber of permutatios of 4-differet letters, i this case, take all at a time is 4!. Cosider oe of these permutatios say, RO 1 O 2 T. Correspodig to this permutatio,we have 2! permutatios RO 1 O 2 T ad RO 2 O 1 T which will be exactly the same permutatio if O 1 ad O 2 are ot treated as differet, i.e., if O 1 ad O 2 are the same O at both places. Therefore, the required umber of permutatios 4! 2! Permutatios whe O 1, O 2 are Permutatios whe O 1, O 2 are differet. the same O. RO1O 2T RO2O1T R O O T TO1O2R TO O R 2 1 T O O R

10 PERMUTATIONS AND COMBINATIONS 143 RO1T O2 RO T O 2 1 T O1R O2 T O R O 2 1 RTO1O2 RTO2O 1 T R O1O2 T R O2O 1 O 1 O 2 R T O 2 O1 T R OROT 1 2 O2R O1T O 1 T O 2 R O 2 T O 1 R O 1 R T O2 O 2 R T O 1 O 1 T R O2 O 2 T R O 1 O 1 OT 2 R O 2 O1 T R R O T O T O R O R T O O T R O O O O R T O R O T O T O R O R T O O T R O O O T R Let us ow fid the umber of ways of rearragig the letters of the word INSTITUTE. I this case there are 9 letters, i which I appears 2 times ad T appears 3 times. Temporarily, let us treat these letters differet ad ame them as I 1, I 2, T 1, T 2, T 3. The umber of permutatios of 9 differet letters, i this case, take all at a time is 9!. Cosider oe such permutatio, say, I 1 NT 1 SI 2 T 2 U E T 3. Here if I 1, I 2 are ot same

11 144 MATHEMATICS ad T 1, T 2, T 3 are ot same, the I 1, I 2 ca be arraged i 2! ways ad T 1, T 2, T 3 ca be arraged i 3! ways. Therefore, 2! 3! permutatios will be just the same permutatio correspodig to this chose permutatio I 1 NT 1 SI 2 T 2 UET 3. Hece, total umber of 9! differet permutatios will be 2! 3! We ca state (without proof) the followig theorems: Theorem 3 The umber of permutatios of objects, where p objects are of the! same kid ad rest are all differet p!. I fact, we have a more geeral theorem. Theorem 4 The umber of permutatios of objects, where p 1 objects are of oe kid, p 2 are of secod kid,..., p k are of k th kid ad the rest, if ay, are of differet! kid is p! p!...p!. 1 2 k Example 9 Fid the umber of permutatios of the letters of the word ALLAHABAD. Solutio Here, there are 9 objects (letters) of which there are 4A s, 2 L s ad rest are all differet. 9! Therefore, the required umber of arragemets !2! 2 Example 10 How may 4-digit umbers ca be formed by usig the digits 1 to 9 if repetitio of digits is ot allowed? Solutio Here order matters for example 1234 ad 1324 are two differet umbers. Therefore, there will be as may 4 digit umbers as there are permutatios of 9 differet digits take 4 at a time. Therefore, the required 4 digit umbers 9 9! 9! P 4 9 4! 5! ( ) Example 11 How may umbers lyig betwee 100 ad 1000 ca be formed with the digits 0, 1, 2, 3, 4, 5, if the repetitio of the digits is ot allowed? Solutio Every umber betwee 100 ad 1000 is a 3-digit umber. We, first, have to

12 PERMUTATIONS AND COMBINATIONS 145 cout the permutatios of 6 digits take 3 at a time. This umber would be 6 P 3. But, these permutatios will iclude those also where 0 is at the 100 s place. For example, 092, 042,..., etc are such umbers which are actually 2-digit umbers ad hece the umber of such umbers has to be subtracted from 6 P 3 to get the required umber. To get the umber of such umbers, we fix 0 at the 100 s place ad rearrage the remaiig 5 digits takig 2 at a time. This umber is 5 P 2. So 6 5 6! 5! The required umber P3 P2 3! 3! Example 12 Fid the value of such that (i) P5 42 P3,> 4 (ii) 4 1 P 4 P 5, > 4 3 Solutio (i) Give that 5 3 P 42 P or ( 1) ( 2) ( 3) ( 4) 42 ( 1) ( 2) Sice > 4 so ( 1) ( 2) 0 Therefore, by dividig both sides by ( 1) ( 2), we get ( 3 ( 4) 42 or or or ( 10) ( + 3) 0 or 10 0 or or 10 or 3 As caot be egative, so 10. (ii) Give that 4 1 P4 P 5 3 Therefore 3 ( 1) ( 2) ( 3) 5( 1) ( 2) ( 3) ( 4) or 3 5 ( 4) [as ( 1) ( 2) ( 3) 0, > 4] or 10.

13 146 MATHEMATICS Example 13 Fid r, if 5 4 P r 6 5 P r Solutio We have 5 P 6 P r r 1 4! 5! 5 6 4! 5 1! or ( r) ( r+ ) 5! 6 5! 4! ! or ( r) ( r+ )( r)( r ) or (6 r) (5 r) 6 or r 2 11r or r 2 8r 3r or (r 8) (r 3) 0 or r 8 or r 3. Hece r 8, 3. Example 14 Fid the umber of differet 8-letter arragemets that ca be made from the letters of the word DAUGHTER so that (i) all vowels occur together (ii) all vowels do ot occur together. Solutio (i) There are 8 differet letters i the word DAUGHTER, i which there are 3 vowels, amely, A, U ad E. Sice the vowels have to occur together, we ca for the time beig, assume them as a sigle object (AUE). This sigle object together with 5 remaiig letters (objects) will be couted as 6 objects. The we cout permutatios of these 6 objects take all at a time. This umber would be 6 P 6 6!. Correspodig to each of these permutatios, we shall have 3! permutatios of the three vowels A, U, E take all at a time. Hece, by the multiplicatio priciple the required umber of permutatios 6! 3! (ii) If we have to cout those permutatios i which all vowels are ever together, we first have to fid all possible arragmets of 8 letters take all at a time, which ca be doe i 8! ways. The, we have to subtract from this umber, the umber of permutatios i which the vowels are always together. Therefore, the required umber 8! 6! 3! 6! (7 8 6) 2 6! (28 3) 50 6! Example 15 I how may ways ca 4 red, 3 yellow ad 2 gree discs be arraged i a row if the discs of the same colour are idistiguishable? Solutio Total umber of discs are Out of 9 discs, 4 are of the first kid

14 PERMUTATIONS AND COMBINATIONS 147 (red), 3 are of the secod kid (yellow) ad 2 are of the third kid (gree). 9! Therefore, the umber of arragemets ! 3! 2! Example 16 Fid the umber of arragemets of the letters of the word INDEPENDENCE. I how may of these arragemets, (i) do the words start with P (ii) do all the vowels always occur together (iii) do the vowels ever occur together (iv) do the words begi with I ad ed i P? Solutio There are 12 letters, of which N appears 3 times, E appears 4 times ad D appears 2 times ad the rest are all differet. Therefore 12! The required umber of arragemets ! 4! 2! (i) (ii) Let us fix P at the extreme left positio, we, the, cout the arragemets of the remaiig 11 letters. Therefore, the required of words startig with P are 11! ! 2! 4! There are 5 vowels i the give word, which are 4 Es ad 1 I. Sice, they have to always occur together, we treat them as a sigle object for the time beig. This sigle object together with 7 remaiig objects will accout for 8 objects. These 8 objects, i which there are 3Ns ad 2 Ds, ca be rearraged i 8! ways. Correspodig to each of these arragemets, the 5 vowels E, E, E, 3! 2! (iii) E ad I ca be rearraged i 5! ways. Therefore, by multiplicatio priciple the 4! required umber of arragemets 8! 5! ! 2! 4! The required umber of arragemets the total umber of arragemets (without ay restrictio) the umber of arragemets where all the vowels occur together.

17 150 MATHEMATICS rearraged i 3! ways. Therefore, the total of permutatios 5 C3 3! 5 5 Therefore P C 3! or ( ) 3 3 5! 5 3! 3! These examples suggest the followig theorem showig relatioship betwee permutaio ad combiatio: Theorem 5 P C!, 0 < r. r r r Proof Correspodig to each combiatio of C r we have r! permutatios, because r objects i every combiatio ca be rearraged i r! ways. Hece, the total umber of permutatios of differet thigs take r at a time is C r r!. O the other had, it is P C!, 0 < r. r r r! Remarks 1. From above ( r) I particular, if r, r. Thus C r r!!! C 1.!0! 5 C 3 C!!!., i.e., r r ( r) 2. We defie C 0 1, i.e., the umber of combiatios of differet thigs take othig at all is cosidered to be 1. Coutig combiatios is merely coutig the umber of ways i which some or all objects at a time are selected. Selectig othig at all is the same as leavig behid all the objects ad we kow that there is oly oe way of doig so. This way we defie C 0 1.! 3. As 1 C0, the formula 0! ( 0 )! Hece r r r, 0 r. ( ) r r r ( ) is applicable for r 0 also. 4.! C r!! ( ) ( r) ( r)! r!! r ( ) C, r

18 PERMUTATIONS AND COMBINATIONS 151 i.e., selectig r objects out of objects is same as rejectig ( r) objects. 5. C a C b a b or a b, i.e., a + b + 1 Theorem 6 C + C C r r 1 r Proof We have C r!! + Cr 1 + r! r! r 1! r 1! ( ) ( ) ( + )! r r 1! r! ( ) ( )! 1! 1! + ( r ) ( r+ ) ( r )! 1!! ( r ) ( r ) r r+ 1! r+ 1+ r ( r 1! ) ( r )! r ( r+ 1 ) Example 17 If C9 C, fid. 8 Solutio We have C9 C8!! 9! 9! 8!8! i.e., ( ) ( ) ( + 1! ) ( + r) r! 1! + 1 C r 1 1 or or 8 9 or Therefore C17 C17 1. Example 18 A committee of 3 persos is to be costituted from a group of 2 me ad 3 wome. I how may ways ca this be doe? How may of these committees would cosist of 1 ma ad 2 wome? Solutio Here, order does ot matter. Therefore, we eed to cout combiatios. There will be as may committees as there are combiatios of 5 differet persos take 3 at a time. Hece, the required umber of ways 5 5! 4 5 C ! 2! 2 Now, 1 ma ca be selected from 2 me i 2 C 1 ways ad 2 wome ca be selected from 3 wome i 3 C 2 ways. Therefore, the required umber of committees

19 152 MATHEMATICS 2! 3! C C 6 1! 1! 2! 1! Example 19 What is the umber of ways of choosig 4 cards from a pack of 52 playig cards? I how may of these (i) four cards are of the same suit, (ii) four cards belog to four differet suits, (iii) are face cards, (iv) two are red cards ad two are black cards, (v) cards are of the same colour? Solutio There will be as may ways of choosig 4 cards from 52 cards as there are combiatios of 52 differet thigs, take 4 at a time. Therefore The required umber of ways 52 52! C4 4! 48! (i) There are four suits: diamod, club, spade, heart ad there are 13 cards of each suit. Therefore, there are 13 C 4 ways of choosig 4 diamods. Similarly, there are 13 C 4 ways of choosig 4 clubs, 13 C 4 ways of choosig 4 spades ad 13 C 4 ways of choosig 4 hearts. Therefore The required umber of ways 13 C C C C 4. 13! ! 9! (ii) (iii) There are13 cards i each suit. Therefore, there are 13 C 1 ways of choosig 1 card from 13 cards of diamod, 13 C 1 ways of choosig 1 card from 13 cards of hearts, 13 C 1 ways of choosig 1 card from 13 cards of clubs, 13 C 1 ways of choosig 1 card from 13 cards of spades. Hece, by multiplicatio priciple, the required umber of ways C 1 C 1 C 1 C There are 12 face cards ad 4 are to be slected out of these 12 cards. This ca be 12! doe i 12 C 4 ways. Therefore, the required umber of ways 495 4! 8!.

20 PERMUTATIONS AND COMBINATIONS 153 (iv) (v) There are 26 red cards ad 26 black cards. Therefore, the required umber of ways 26 C 2 26 C 2 ( 325) 2 26! 2! 24! red cards ca be selected out of 26 red cards o 26 C 4 ways. 4 black cards ca be selected out of 26 black cards i 26 C 4 ways. Therefore, the required umber of ways 26 C C 4 26! ! 22! EXERCISE If C 8 C 2, fid C Determie if (i) 2 C 2 : C 2 12 : 1 (ii) 2 C 3 : C 3 11 : 1 3. How may chords ca be draw through 21 poits o a circle? 4. I how may ways ca a team of 3 boys ad 3 girls be selected from 5 boys ad 4 girls? 5. Fid the umber of ways of selectig 9 balls from 6 red balls, 5 white balls ad 5 blue balls if each selectio cosists of 3 balls of each colour. 6. Determie the umber of 5 card combiatios out of a deck of 52 cards if there is exactly oe ace i each combiatio. 7. I how may ways ca oe select a cricket team of eleve from 17 players i which oly 5 players ca bowl if each cricket team of 11 must iclude exactly 4 bowlers? 8. A bag cotais 5 black ad 6 red balls. Determie the umber of ways i which 2 black ad 3 red balls ca be selected. 9. I how may ways ca a studet choose a programme of 5 courses if 9 courses are available ad 2 specific courses are compulsory for every studet? Miscellaeous Examples Example 20 How may words, with or without meaig, each of 3 vowels ad 2 cosoats ca be formed from the letters of the word INVOLUTE? Solutio I the word INVOLUTE, there are 4 vowels, amely, I,O,E,Uad 4 cosoats, amely, N, V, L ad T.

22 PERMUTATIONS AND COMBINATIONS 155 Example 22 Fid the umber of words with or without meaig which ca be made usig all the letters of the word AGAIN. If these words are writte as i a dictioary, what will be the 50 th word? Solutio There are 5 letters i the word AGAIN, i which A appears 2 times. Therefore, the required umber of words 5! 60 2!. To get the umber of words startig with A, we fix the letter A at the extreme left positio, we the rearrage the remaiig 4 letters take all at a time. There will be as may arragemets of these 4 letters take 4 at a time as there are permutatios of 4 differet thigs take 4 at a time. Hece, the umber of words startig with 4! A 4! 24. The, startig with G, the umber of words 12 as after placig G 2! at the extreme left positio, we are left with the letters A, A, I ad N. Similarly, there are 12 words startig with the ext letter I. Total umber of words so far obtaied The 49 th word is NAAGI. The 50 th word is NAAIG. Example 23 How may umbers greater tha ca be formed by usig the digits 1, 2, 0, 2, 4, 2, 4? Solutio Sice, is a 7-digit umber ad the umber of digits to be used is also 7. Therefore, the umbers to be couted will be 7-digit oly. Also, the umbers have to be greater tha , so they ca begi either with 1, 2 or 4. 6! The umber of umbers begiig with 1 60, as whe 1 is 3! 2! 2 fixed at the extreme left positio, the remaiig digits to be rearraged will be 0, 2, 2, 2, 4, 4, i which there are 3, 2s ad 2, 4s. Total umbers begiig with 2 6! ! 2! 2 6! ad total umbers begiig with !

23 156 MATHEMATICS Therefore, the required umber of umbers Alterative Method 7! The umber of 7-digit arragemets, clearly, 420 3! 2!. But, this will iclude those umbers also, which have 0 at the extreme left positio. The umber of such 6! arragemets 3! 2! (by fixig 0 at the extreme left positio) 60. Therefore, the required umber of umbers Note If oe or more tha oe digits give i the list is repeated, it will be uderstood that i ay umber, the digits ca be used as may times as is give i the list, e.g., i the above example 1 ad 0 ca be used oly oce whereas 2 ad 4 ca be used 3 times ad 2 times, respectively. Example 24 I how may ways ca 5 girls ad 3 boys be seated i a row so that o two boys are together? Solutio Let us first seat the 5 girls. This ca be doe i 5! ways. For each such arragemet, the three boys ca be seated oly at the cross marked places. G G G G G. There are 6 cross marked places ad the three boys ca be seated i 6 P 3 ways. Hece, by multiplicatio priciple, the total umber of ways 6! 5! 6 P 3 5! 3! Miscellaeous Exercise o Chapter 7 1. How may words, with or without meaig, each of 2 vowels ad 3 cosoats ca be formed from the letters of the word DAUGHTER? 2. How may words, with or without meaig, ca be formed usig all the letters of the word EQUATION at a time so that the vowels ad cosoats occur together? 3. A committee of 7 has to be formed from 9 boys ad 4 girls. I how may ways ca this be doe whe the committee cosists of: (i) exactly 3 girls? (ii) atleast 3 girls? (iii) atmost 3 girls? 4. If the differet permutatios of all the letter of the word EXAMINATION are

24 PERMUTATIONS AND COMBINATIONS 157 listed as i a dictioary, how may words are there i this list before the first word startig with E? 5. How may 6-digit umbers ca be formed from the digits 0, 1, 3, 5, 7 ad 9 which are divisible by 10 ad o digit is repeated? 6. The Eglish alphabet has 5 vowels ad 21 cosoats. How may words with two differet vowels ad 2 differet cosoats ca be formed from the alphabet? 7. I a examiatio, a questio paper cosists of 12 questios divided ito two parts i.e., Part I ad Part II, cotaiig 5 ad 7 questios, respectively. A studet is required to attempt 8 questios i all, selectig at least 3 from each part. I how may ways ca a studet select the questios? 8. Determie the umber of 5-card combiatios out of a deck of 52 cards if each selectio of 5 cards has exactly oe kig. 9. It is required to seat 5 me ad 4 wome i a row so that the wome occupy the eve places. How may such arragemets are possible? 10. From a class of 25 studets, 10 are to be chose for a excursio party. There are 3 studets who decide that either all of them will joi or oe of them will joi. I how may ways ca the excursio party be chose? 11. I how may ways ca the letters of the word ASSASSINATION be arraged so that all the S s are together? Summary Fudametal priciple of coutig If a evet ca occur i m differet ways, followig which aother evet ca occur i differet ways, the the total umber of occurrece of the evets i the give order is m. The umber of permutatios of differet thigs take r at a time, where! repetitio is ot allowed, is deoted by P r ad is give by P r, ( r)! where 0 r.! ! ( 1)! The umber of permutatios of differet thigs, take r at a time, where repeatitio is allowed, is r. The umber of permutatios of objects take all at a time, where p 1 objects

26 PERMUTATIONS AND COMBINATIONS 159 kow the formula for C r. However, he was aware that C r C r for specific values ad r. I 1321 A.D., Levi Be Gerso, aother Hebrew writer came up with the formulae for P r, P ad the geeral formula for C r. The first book which gives a complete treatmet of the subject matter of permutatios ad combiatios is Ars Cojectadi writte by a Swiss, Jacob Beroulli ( A.D.), posthumously published i 1713 A.D. This book cotais essetially the theory of permutatios ad combiatios as is kow today.

### 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

### 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

### 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

### 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,

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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,

### 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

### 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

### 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

### Math C067 Sampling Distributions

Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters

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

### .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,

### 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

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

### Engineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51

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

### 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

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

### 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

### 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

### 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

### 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

### 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

### 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

### Elementary Theory of Russian Roulette

Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some

### 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,

### 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

### 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

### 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

### 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:

### 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

### 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

### 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,

### 3 Basic Definitions of Probability Theory

3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

### 1 Correlation and Regression Analysis

1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

### Permutations, the Parity Theorem, and Determinants

1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

### 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

### A Mathematical Perspective on Gambling

A Mathematical Perspective o Gamblig Molly Maxwell Abstract. This paper presets some basic topics i probability ad statistics, icludig sample spaces, probabilistic evets, expectatios, the biomial ad ormal

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

### BENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets

BENEIT-CST ANALYSIS iacial ad Ecoomic Appraisal usig Spreadsheets Ch. 2: Ivestmet Appraisal - Priciples Harry Campbell & Richard Brow School of Ecoomics The Uiversity of Queeslad Review of basic cocepts

### 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

### MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

### 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

### 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

### 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

### 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

### Part - I. Mathematics

Part - I Mathematics CHAPTER Set Theory. Objectives. Itroductio. Set Cocept.. Sets ad Elemets. Subset.. Proper ad Improper Subsets.. Equality of Sets.. Trasitivity of Set Iclusio.4 Uiversal Set.5 Complemet

### 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

### 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

### 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

### HOW MANY TIMES SHOULD YOU SHUFFLE A DECK OF CARDS? 1

1 HOW MANY TIMES SHOULD YOU SHUFFLE A DECK OF CARDS? 1 Brad Ma Departmet of Mathematics Harvard Uiversity ABSTRACT I this paper a mathematical model of card shufflig is costructed, ad used to determie

### 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

### Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

### 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

### 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

### 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

### 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

### Chapter 7 Methods of Finding Estimators

Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

### 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

### 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

### Confidence Intervals

Cofidece Itervals Cofidece Itervals are a extesio of the cocept of Margi of Error which we met earlier i this course. Remember we saw: The sample proportio will differ from the populatio proportio by more

### 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

### 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

### 0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

### 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

### 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

### AP Calculus BC 2003 Scoring Guidelines Form B

AP Calculus BC Scorig Guidelies Form B The materials icluded i these files are iteded for use by AP teachers for course ad exam preparatio; permissio for ay other use must be sought from the Advaced Placemet

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

### Center, Spread, and Shape in Inference: Claims, Caveats, and Insights

Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the

### 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

### 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

### 1.3. VERTEX DEGREES & COUNTING

35 Chapter 1: Fudametal Cocepts Sectio 1.3: Vertex Degrees ad Coutig 36 its eighbor o P. Note that P has at least three vertices. If G x v is coected, let y = v. Otherwise, a compoet cut off from P x v

### 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

### Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

### 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

### Math 113 HW #11 Solutions

Math 3 HW # Solutios 5. 4. (a) Estimate the area uder the graph of f(x) = x from x = to x = 4 usig four approximatig rectagles ad right edpoits. Sketch the graph ad the rectagles. Is your estimate a uderestimate

### Overview of some probability distributions.

Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

### 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

### 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

### 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

### Multiplexers and Demultiplexers

I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see

### 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:

### 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

### CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

### Notes on Combinatorics. Peter J. Cameron

Notes o Combiatorics Peter J Camero ii Preface: What is Combiatorics? Combiatorics, the mathematics of patters,, helps us desig computer etwors, crac security codes, or solve sudous Ursula Marti, Vice-Pricipal

### 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