Permutations and Combinations

Size: px
Start display at page:

Download "Permutations and Combinations"

Transcription

1 Pemutatios ad ombiatios Fudametal piciple of coutig Pemutatio Factoial otatio P!! ombiatio This uit facilitates you i, statig the fudametal piciple of coutig. defiig pemutatio ad combiatio. usig factoial otatio. deivig the fomula fo umbe of pemutatios ( P ).!!! deivig the fomula fo umbe of combiatios ( ). diffeetiatig betwee pemutatios ad combiatios solvig poblems usig P ad. Jacob Beoulli ( - 70 A. D.) I mathematics the at of poposig a questio must be held of highe value tha solvig it. - Geoge ato Swiss mathematicia, Jacob Beoulli has give a complete teatmet of pemutatios ad combiatios i his book As ojectadli (Posthumously published i 7 A. D)

2 UNIT- Let us begi this uit with some eal life situatios. Study them ad discuss i goups. Illustatio We see diffeet types of moto vechicles plyig o the oad. Each ad evey vehicle will have a umbe plate with it's egistatio umbe. Recall that each umbe plate will have the followig ifomatio. ) Name of the state (Eg : KA - fo Kaataka) ) Regioal taspot office code umbe. (0 - Bagaloe - Jayaaga RTO) ) Eglish alphabet/s ) Followed by a umbe (fom a sigle digit to a fou digit umbe) Do you kow how may vehicles ca be egisteed i ay oe of the seies? You kow that thee ca be 9999 vehicles!! Have you eve thought how these umbes ae geeated by the R.T.O? What mathematical piciple is behid this calculatio? Illustatio Suppose we have a suitcase with umbe lock. The umbe lock has thee wheels each labelled with te digits fom 0 to 9. The lock ca be opeed if thee specific digits ae aaged i a paticula aagemet o may be i a sequece say with o epetitios. Let us suppose that we have fogotte this sequece of digits. I ode to ope the lock, how may sequeces of thee - digits we have to check? To aswe this questio we have to check all the thee - digit umbes. But this will take lot of time. Is thee ay mathematical idea which ca help us to kow the umbe of possibilities? I this uit let us lea some basic coutig techiques by which we ae able to fid solutios fo the above situatios. As a fist step, we shall examie caefully a piciple which is most fudametal to leaig of the coutig techiques.the mai subject of this uit is coutig. Give a set of objects, the task is to aage a subset accodig to some specificatios o to select a subset as pe some specificatios. Fudametal Piciple of outig (FP) Study the followig illustatios. EV007 Example : Thee ae thee dolls as show. Two out of them have to be aaged o a shelf. I how may diffeet ways ca they be aaged? How do we cout this? Obseve the tee diagam epesetig the umbe of ways of selectig the fist doll ad the secod doll.

3 Pemutatios ad ombiatios 7 Fom this diagam, we ca coclude that the fist doll ca be selected i thee diffeet ways ad fo each of these fist selectio, the secod doll ca be selected i two diffeet ways. So thee ae totally ways. The total umbe of ways of aagig two dolls out of thee is = ways. The diffeet ways ca be epeseted as follows: Example : A boy has pats ad shits. How may diffeet pais of a pat ad a shit ca he dess up with? Thee ae two ways i which a pat ca be chose ad fo evey choice of a pat thee ae fou ways i which a shit ca be chose. Let us deote the two pats as P ad P ad the shits as S, S, S ad S. The diffeet ways of paiig a pat ad a shit ca be epeseted by a tee diagam as show below. Shits thee ae totally 8 ways. I othe wods, thee ae = 8 ways of paiig a pat ad a shit. Example : Sajay goes to a hotel to have beakfast. The meu cad idicates the followig items that ae seved: Tiffi Sweets Hot diks Idli Kesai bath offee Dosa Jamoo Tea Pooi Khaabath Pats Badam milk I how may diffeet ways ca he select oe item fom each type? Tiffi ca be chose i diffeet ways. Afte a tiffi is chose, a sweet ca be chose i diffeet ways. thee ae = 8 ways i which a tiffi ad a sweet ca be chose. P P S PS S PS S PS S PS S PS S PS S PS

4 8 UNIT- Fo each of the above 8 ways, a hot dik ca be chose i diffeet ways. thee ae 8 = ways i which Sajay ca choose the thee items. the total umbe of ways = = If we epeset tiffi as T, T, T ad T, sweets as S ad S, hot diks as H, H ad H, the possible ways ca be listed i the table as follows. T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H T S H The data fom the above thee examples is eteed i the table. Study the table ad discuss i goups to ife the piciple of coutig. Example Numbe of ways Total umbe Activity Activity Activity of ways = = 8 = We ca coclude ad state the fudametal piciple of coutig (FP) o multiplicatio piciple as follows : If oe activity ca be doe i 'm' umbe of diffeet ways ad coespodig to each of these ways of the fist activity, secod activity (idepedet of fist activity) ca be doe i '' umbe of diffeet ways the, both the activities, oe afte the othe ca be doe i (m ) umbe of ways. The above piciple ca be geealised fo ay fiite umbe of evets. Fo thee activities, the FP ca be stated as: If oe activity, ca be doe i 'm' umbe of diffeet ways, fo each of these 'm' diffeet ways, a secod activity ca be doe i '' umbe of diffeet ways ad fo each of these activities, a thid activity ca be doe i 'p' ways, the all the thee activities oe afte the othe ca be doe i (m p) umbe of ways. We ca ow easily fid the total umbe of ways of doig moe tha two activities without actually listig, coutig o dawig tee diagam. We shall illustate this FP with a few moe examples. ILLUSTRATIVE EXAMPLES Example : How may - digit umbes ca be fomed fom the digits {,,,, } without epetitio ad with epetitio? Sol: The digits i the selectio set ae {,,,, }. Sice we have to fom - digit umbe, let us daw boxes, oe fo uits place ad aothe fo tes place. T U

5 Pemutatios ad ombiatios 9 We fill the uits place fist ad the tes place. The box fo uits place ca be filled i diffeet ways with the digits,,, ad. Afte fillig the uits place we ae left with digits, as epetitio of digits ae ot allowed, the box fo tes place ca be filled i diffeet ways. By applyig fudametal piciple of coutig we get = 0 ways. thee ae 0 ways of fomig - digit umbes by usig,,,, without epetitio. If the epetitio of digits ae allowed the the tes place ca also be filled by diffeet ways, usig,,, ad. The total umbe ways a - digit umbe ca be fomed by usig,,, ad with epetitio is = ways. Note: Discuss i goups ad veify the aswe by actually listig the - digit umbes. Example. How may lette code ca be fomed by usig the five vowels without epetitios? Sol. The vowels ae a, e, i, o ad u. We have to fom a thee lette code. The fist lette ca be chose i ways. The secod lette ca be chose i ways. The thid lette ca be chose i ways. ( o epetitio is allowed) ( o epetitio is allowed) The total umbe of ways i which the lette code ca be fomed without epetitio = = 0 ways Example. How may - digit umbes ca be fomed fom the digits 0,,, ad with epetitios? Sol. A Thee - digit umbe will have thee places - Hudeds, tes, uits. The digits i the selectio set ae {0,,,, } Hudeds place - Zeo caot occupy hudeds place, because it becomes a - digit umbe. Hece, the hudeds place ca be filled i by ways, i.e.,,,. Tes place - We have five ways of fillig tes place, as epetitios ae allowed ad zeo ca also be used. Uits place - This ca also be filled i diffeet ways. the total umbe of - digit umbes that ca be fomed usig 0,,,, ae = 00 umbes. Example. Now let us ty to solve the suitcase lock poblem (illustatio i page ), by applyig the fudametal piciple of coutig. Sol. The umbe lock of the suitcase has thee digits. Each umbe ca be fomed i 0 diffeet ways usig the digits 0,,,,,,, 7, 8,

6 70 UNIT- It is also evidet that the digits ca be epeated. the total umbe of ways the umbe lock code ca be fomed is = 000 ways So, to ope the suitcase 000 diffeet ways have to be checked. EXERISE.. How may - digit umbes ca be fomed usig the digits,,,,, without epeatig ay digit.. How may digit eve umbes ca be fomed usig the digits,, 7, 8, 9, if the digits ae ot epeated?. How may lette code ca be fomed usig the fist 0 lettes of Eglish alphabet, if o lette ca be epeated?. How may digit telephoe umbes ca be fomed usig the digits 0 to 9, if each umbe stats with ad o digit appea moe tha oce?. If a coi is tossed times, fid the umbe of outcomes.. Give flags of diffeet colous, how may diffeet sigals ca be geeated if each sigal equies the use of flags oe below the othe? Pemutatios ad ombiatios While leaig the fudametal piciple of coutig, we have obseved that i all the examples some umbe of objects ae give ad out of these a few objects ae to be chose. Now, let us study moe about the selectio ad aagemet of thigs. Study the examples give i the table. Read the fist poblem i colum 'P' ad the the fist poblem i colum '' Now compae them. Repeat the same pocedue fo the emaiig set of poblems. Sl No.... olum 'P' pesos cotest fo the post of a pesidet ad a secetay. I how may ways they ca be elected? A child has 8 focks ad pais of shoes. I how may ways the child ca dess heself? I how may ways ca all the lettes of the wod TEAH be aaged? olum '' Thee ae codidates cotestig fo posts. I how may ways ca the posts be filled. Thee ae 8 white ad ed oses i a gade. I how may ways flowes of which ae ed be plucked? I how may ways all the lettes of the wod MEANS ca be selected? Do you otice ay similaties i the poblems of each colum? Fo the poblems i the colum 'P', we have to fid out the umbe of ways of aagemets. Fo the poblems i the colum '' we have to fid the umbe of ways of selectios.

7 Pemutatios ad ombiatios 7 I solvig polems of the above types the fist step is we must caefully idetify, whethe it is the aagemets o selectios. As a example let us udestad the fist poblem i the above table. Let the pesos be A, B ad. Thee ae two posts, pesidet ad a secetay. Let us have the box otatio ad wite all the possible ways. Pesidet A A B B Secetay ase. If 'A' is the pesidet the 'B' ca be secetay o '' ca be secetay ase : If 'B' is the pesidet the 'A' ca be secetay o '' ca be secetay ase : If '' is the pesidet the 'A' ca be secetay o B ca be the secetay. So all togethe thee possible ways of electig. B A A B Let the pesos be A, B ad. Thee ae two posts oly. Let us have the box otatio ad wite all the possibilities. hoices fo posts SL No. Post - Post - A A B ase. If 'A' is selected fo oe post, aothe post ca be give to B o. ase : If 'B' is selected fo oe post the the othe post ca be give to but ot to A because BA ad AB ae the same selectios. Hece thee ca be ways by which the posts ca be filled up B It is also evidet fom the above discussio that, i examples of colum P the aagemet of thigs o objects o pesos is doe with egad to ode. I examples of colum, the selectio of thigs o objects o pesos is doe without egad to ode. Such aagemets with egad to ode ae called pemutatios ad selectios without egad to ode ae called combiatios. Pemutatio : A pemutatio is a odeed aagemet of a set of objects. It is a act of aagemets of objects i a odely way. A pemutatio of elemets take at a time is ay odeed subset of elemets take fom the set of elemets. The umbe of pemutatios of '' diffeet objects take '' at a time is deoted as P whee. ombiatio : A combiatio is a selectio of a set of objects without ay ode. It is a act of selectio of objects ot ivolvig ay odely way. A combiatio of elemets take at a time is ay subset of elemets take fom the set of elemets (without egad to ode). Note that i a set thee is o ode fo listig the elemets. e.g. {,, } = {,, } The umbe of combiatios of '' diffeet objects take '' at a time is deoted as, whee.

8 7 UNIT- EXERISE. I. Below ae give situatios fo aagemets ad selectios. lassify them as examples of pemutatios ad combiatios.. A committee of membes to be chose fom a goup of people.. Five diffeet subject books to be aaged o a shelf.. Thee ae 8 chais ad 8 people to occupy them.. I a committee of 7 pesos, a chaipeso, a secetay ad a teasue ae to be chose.. The owe of childe's clothig shop has 0 desigs of focks ad of them have to be displayed i the fot widow.. Thee-lette wods to be fomed fom the lettes i the wod 'ARITHMETI'. 7. I a questio pape havig questios, studets must aswe the fist questios but may select ay 8 of the emaiig oes. 8. A ja cotais black ad 7 white balls. balls to be daw i such a way that ae black ad is white. 9. Thee-digit umbes ae to be fomed fom the digits,,, 7, 9 whee epetitios ae ot allowed. 0. Five keys ae to be aaged i a cicula key ig.. Thee ae 7 poits i a plae ad o of the poits ae colliea. Tiagles ae to be daw by joiig thee o-colliea poits.. A collectio of 0 toys ae to be divided equally betwee two childe. I each of the above examples give easo to explai why it is pemutatio o combiatio. Ty: List atleast examples each fo pemutatio ad combiatio. Discuss i the class. To fid the geeal fomula fo the umbe of ways by which th box ca be filled up: By usig FP we ca wite the expasio of each pemutatio as follows :- P P P P P I each pemutatio, obseve caefully the umbe of ways i which the last box is filled up. Thee is some commo patte i all the pemutatios. Thee is a elatioship betwee values of, ad the umbe of ways i which the last box ca be filled up. The elatio is as follows :

9 Pemutatios ad ombiatios 7 'Subact '' fom '' ad add oe to it' to get the umbe of ways by which th box ca be filled up i.e., ( + ) Note that whe use say th box, is atleast. So > 0 Study the followig examples: ) oside P - we kow that the last box i.e., th box ca be filled up i just way. We ca get this by subtactig ( fom ) ad add to it. i.e., ( + ) = 0 + = way. ) oside P - Hee also we kow that the last box i.e., th box ca be filled up i ways. We ca get this by subtactig ( fom ) ad add to it. i.e., ( + ) = + = ways. ) oside P - Hee also we see fom the above table last box ca be filled up i ways. This we ca get by subtactig ( fom ) ad the add to it. i.e., ( + ) = + = ways Hece, we ca coclude that i P the th box ca be filled i ( + ) ways. To fid the umbe of pemutatios of '' distict objects take '' at a time whee 0 ad the objects do ot epeat. The umbe of pemutatios of '' objects take '' at a time is same as the o of ways of fillig '' blak boxes with '' give objects. oside '' diffeet objects ad '' blak boxes as show below. ( ) ( ) [ )] [ )] ways ways ways ways ways The fist box ca be filled by '' umbe of ways by puttig '' diffeet give objects. Thus, thee ae '' diffeet ways of fillig up the fist box. Afte fillig up the fist box by ay oe of the '' objects, we ae left with ( ) objects as epetitios ae ot allowed. So, the secod box ca be filled up i ( ) umbe of ways. Thus, the fist boxes ca be filled up i ( ) umbe of ways (by FP). Now afte fillig up the fist boxes, we ae left with ( ) objects. Thus, the d box ca be filled up i ( ) umbe of ways. Agai by F.P. the fist thee boxes ca be filled up i ( ) ( ) ways. Obseve that a ew facto is itoduced with each ew box filled up, ad that at ay stage the umbe of factos is the same as the umbe of boxes filled up. Hece, by FP the umbe of ways of fillig '' boxes i successio is give as follows. ( ) ( )... [ ( )]

10 7 UNIT- Thus the umbe of pemutatios of '' objects take '' at a time is give by P P = ( ) ( )... [ ( )] oollay : The umbe of pemutatios of '' objects take all at a time is P = ( ) ( )... [ ( )] P = ( ) ( )... o P = ( ) ( )... Factoial otatio : ('' factos) Obseve that the RHS of the above expesssio is the poduct of fist atual umbes. It is deoted by a otatio!.! is ead as factoial. ( ) ( )... =!! deotes the poduct of fist atual umbes. Thus! = o Remembe :! = o! = o! =... o ( ) ( )... 0! by defiitio is take as. [Note : If is a egative umbe o a decimal,! is ot defied.]! is the poduct of fist '' atual umbes.! = ( ) ( )... S is the sum of fist '' atual umbes. S = Study the expasios of factoial otatios give below.! = ( ) ( )... ( )! = ( ) ( ) ( )... ( + )! = ( + ) ( ) ( )... ( )! = ( ) ( ) ( )... ( )! = ( ) ( ) ( )... I geeal ;! = ( ) ( )...! = [( ) ( )... ]! = [( )!] o! = ( ) ( )! o! = ( ) ( ) ( )! ad so o. Fo example, oside!! =! = (!)! = (!)! = (!)

11 Pemutatios ad ombiatios 7 EXERISE.. ovet the followig poducts ito factoials. (i) 7 (ii) (iii) (iv) 8. Evaluate : (i)! (ii) 9! (iii) 8!! (iv) 7!! (v)! 9!! (vi) 0! 8!. Evaluate : (i)!! (ii)!!! whe = ad =. Fid the LM of!,!,!. (i) If ( +)! = ( )! fid the value of (ii) If 9! 0!! fid the value of. Simplify : ( )! ( )! ( ) To deive the fomula fo P i factoial otatio By Fudametal Piciple of coutig, P = ( ) ( )... ( + ) oside the RHS of the equatio, ( ) ( )... ( + ) The fist facto of the RHS is. The last facto of the RHS is ( + ). RHS is the poduct of atual umbes statig fom '' i descedig ode upto ( + ). Had the poduct cotiued upto what we would have got? We would have got! What exta facto we have to wite to get!? [( ) ( )... ] which is ( )! P = ( ) ( )... ( + ) P = ( ) ( )... ( ) ( ) ( )... ( ) ( )... P =!! P =!! [If > 0] Numbe of pemutatios of '' thigs take '' at a time is The above fomula fo P holds good oly whe epetitios ae ot allowed. P!!, whee 0.

12 7 UNIT- The umbe of pemutatios of '' diffeet objects take '' at a time, whee epetitio is allowed is. Now let us study some special cases of P ase : What happes whe = 0? We shall see it ow. If = 0 i how may ways ca we aage 0 objects fom objects? Aagig o object at all is the same as leavig behid all the objects as they ae ad we kow that thee is oly oe way of doig it. Thus P0 P = o! 0! =!! = Example : 00 P, 0 P, 98 P ase : Let = P = ( ) ( )... ( + ) P = ( ) ( )... ( + ) P = ( ) ( )... P = ( ) ( )... P =! Also, P!!!!! 0! (ecall the defiitio 0! = ) Example : 009 P 009 = 009!, 0 P 0 = 0!, 00 P 00 = 00! ase : Let = P!! P!! P!! P = Example : 00 P = 00, 7 P = 7 Discuss: P is meaigless. Why? Remembe: P!! If = 0 the P 0 = If = the P =! If = the P =

13 Pemutatios ad ombiatios 77 ILLUSTRATIVE EXAMPLES Example. Evaluate : (i) 7 P (ii) 8 P Sol. (i) 7 P 7! 7! 7! 7!!! 7 0 (ii) 8 P 8! 8! 8 7! 8!!! Example. Fid '', if P = P Sol.!!!!!!!!!! ( ) ( ) = + = 0 ( 8) ( ) = 0 = Example. Pove that! + ( + )! =! ( + ) [ = 8 has o meaig] Sol. LHS:! + ( + )! =! + ( + )! =! ( + + ) =! ( + ) = RHS Example. Fid '' if P P Sol. ( ) ( ), ( ) = 0 = = 0 = 0 Example. If + P : P = : fid. Sol. P P i.e., + P = P.!.!!!!!!! 0!!

14 78 UNIT- 0 ( + ) = ( + ) ( + ) = 0 ( + ) ( ) = 0 o =. Sice is a positive itege, =. Example. If P = 00, fid '' Sol. P = 7 = 00! = 7! = 7 (ii) If P = 90 fid '' Sol. P = 90 ( ) = 0 9 = 0 (iii) If P = 990 fid '' Sol. P = 990 P = 0 9 = EXERISE.. Evaluate: i) P ii) 7 P iii) 8 P 8 iv) P v) 8 P 0.. If P = 0 P fid ''. If P = + P fid ''. If P =. P fid ''.. If P : P = : fid ''. If P : + P = : fid ''.. If 9 P + 9 P = 0 P, fid ''. If 0 P + : P = 0 :, fid ''.. Pove that + P + = ( + ) P. Show that 0 P = 9 P + 9 P

15 Pemutatios ad ombiatios 79 Pactical Poblems o Pemutatio Example. sogs ae to be edeed i a pogamme. I how may diffeet odes could they be pefomed? Sol. The diffeet odes i which sogs that ca be pefomed is P =!! = [ FP] o = 70 diffeet odes P!!! P! = = 70 sogs ca be edeed i a pogamme i 70 diffeet odes. Example. How may wods (with o without dictioay meaig) ca be made fom the lettes i the wod LASER assumig that o lette is epeated it, such that (i) All lettes ae used at a time (ii) lettes ae used at a time (iii) All lettes ae used such that it should begi with lette A ad ed with lette R Sol. Numbe of lettes i the wod LASER is. (i) If all lettes ae used at a time, the =, = The umbe of wods that ca be fomed P =!!!! 0!! 0 0 wods ca be fomed with o without meaig. (ii) If lettes ae used at a time, the =, = The umbe of wods fomed with o without meaig P =!! 0 (iii) So thee will be 0 wods with o without meaig. Box Box Box Box Box lette A is fixed lette R is fixed Thee ae lettes i the give wod LASER of which two lettes A ad R ae fixed i the fist & last place espectively. So oly thee boxes have to be filled amely d, d ad th. This ca be doe i P!! 0! ways Thee will be oly wods with o without meaig which begis with lette 'A' ad ed with the lette 'R'.

16 80 UNIT- Example. I how may ways ca 7 diffeet books be aaged o a shelf? I how may ways thee paticula books ae always togethe? Sol. The 7 books ca be aaged i 7 P 7 = 7! = 7 = 00 ways. Sice thee paticula books ae always togethe, let us tie thee books togethe ad the coside them as oe book (o oe uit). Remaiig fou books have to be cosideed sepaately. So i all we ca coside 7 books as [ books + book ] = books ( uit of books) These books ca be aaged i P =! = = 0 ways. I each of these 0 ways, the thee paticula books ca be aaged i! = = ways { (B B B )(B B B ), (B B B ), (B B B ), (B B B )(B B B ) By FP, the total umbe of aagemets P! = 0 = 70 ways. So, the umbe of ways of aagig 7 books, so that thee paticula books is eve togethe is = 0 Example. How may five digit umbes ca be fomed with the digits {,,, 7, 9} which lie betwee 0,000 ad 90,000 usig each digit oly oce. Sol. Te thousad Thousad Huded Teth uit 's place place place place place ways {, o 7} ways ways ways way Sice we equie umbes which ae geate tha 0,000 ad less tha 90,000, the te thousadth place ca be filled by {, o 7} oly. Theefoe te thousadth place ca be filled i by ways oly. The emaiig fou places ca be filled with the emaiig fou digits. This ca be doe is! ways. Theefoe the total umbe of umbes lyig betwee 0,000 ad 90,000 is! { FP} = = 7 Example. A DNA molecule will have a itoge base which cosists of diffeet bases A, G, T o all attached to it? I how may ways the thee bases ca be aaged without epetitio. Sol. Hee, = ad =. Hece the umbe of ways A = Adeie = ytosie G = Geaie T = Thymie P! ways!

17 Pemutatios ad ombiatios 8 EXERISE.. How may wods with o without dictioay meaig ca be fomed usig all the lettes of the wod 'JOULE' usig each lette exactly oce?. It is equied to seat me ad wome i a ow so that the wome occupy the eve places. How may such aagemets ae possible?. I how may ways ca wome daw wate fom wells, if o well emais uused?. Seve studets ae cotestig the electio fo the Pesidetship of the studet's uio. I how may ways ca thei ames be listed o the ballot papes?. 8 studets ae paticipatig i a competitio. I how may ways ca the fist thee pizes be wo?. Fid the total umbe of - digit umbes. 7. Thee ae stickes of diffeet sizes. It is desied to make a desig by aagig them i a ow. How may such desigs ae possible? 8. How may - digit umbes ca be fomed usig the digits,,, 7, 8, 9 (epetitios ot allowed)? (a) How may of these ae less tha 000? (b) How may of these ae eve? (c) How may of these ed with 7? 9. Thee ae buses uig betwee two tows. I how may ways ca a ma go to oe tow ad etu by a diffeet bus? To fid out the umbe of combiatios of '' distict objects take '' at a time whee 0 oside the followig examples of selectig ad aagig lettes fom a, b, c ad d. Hee = : ombiatios Pemutatios =, a, b, c, d a, b, c, d = P = Each combiatio of give ise to! Pemutatio. = ab,ac,ad,ba,bc,bd ab,ac,ad,bc,bd,cd ca,cb,cd,da,db,dc = P = Each combiatio of give ise to! Pemutatios. = abc,abd,acd,bcd abc abd bcd acd = acb adb bdc adc bac bad cbd cad bca bda cdb cda cab dab dbc dac cba dba dcb dca P = ways Each combiatio of give ise to! Pemutatios.

18 8 UNIT- = abcd abcd bacd cabd dabc = abdc badc cadb dacb acbd bcad cdba dbac acdb bcda cdab dbca adcb bdac cdab dcab abdc bdca cbda dcba P : I Geeal: Each combiatio i gives ise to! Pemutatios. Each combiatio i give ise to! pemutatios. How may pemutatios ca thee be altogethe? Total o of Pemutatios =! P =! =! i.e. =!!! Theefoe, the umbe of combiatios of '' distict objects, take '' at a time is give by P!! -! Note: The elatioship betwee P ad is give by = P! Study the vaious expasios of.. P!!!!....!!....! Now let us coside some special cases of ase (i): Let = 0!! If = 0 the, 0 0! 0! 00 0 =, 00 0 =, = 0 =

19 Pemutatios ad ombiatios 8 ase (ii): Let = If = the,!!! =!! = Example: 00 = 00, 00 = 00 7 = 7 ase (iii): Let = If = the,!!!!!0!!! = Example: =, =, = Remembe :!!! If = 0, 0 =, If =, =, If =, = ILLUSTRATIVE EXAMPLES Example. Evaluate : (i) (ii) 8 Sol.!!! (i)!!!!!!!! (ii) 8 8! 8! 8!!!! 8 7!! Example.If = 0, fid Sol. = 0!!!!!!!!! 0 ( ) = 0 ( ) = 0 = 0 =

20 8 UNIT- Example. If P = 0 ad =, fid ''. Sol. P =! 0 =! 0! = =! = Example. Pove that = Sol. We kow that!!! Replacig by ( ) i the equatio (i) we get!!!...(i)!!!!!!...(ii) By compaig (i) ad (ii) we ca say that = Example. If 8 =, fid. Sol. 8 = 8 = 8 = = + 8 = 0. EXERISE.. Evaluate (i) 0 (ii) 0 0 (iii) (i) If = 7 fid. (ii) If P = 80, =, fid.. If : = :, fid.. Veify that = 9. Pove that whe.. If - : : + = : :, fid.

21 Pemutatios ad ombiatios 8 Example. A ma has fieds. I how may ways ca he ivite oe o moe of them to a paty? Sol. The diffeet ways of combiatios of ivitig fieds ae ivitig exactly oe,, exactly,... exactly. These ca be doe i,,,,, ways. The total umbe of ways i which oe o moe ca be ivited = = 0 = = ways. Example. Fo a set of tue o false questios o studet has witte all coect aswes ad o two studets have give the same sequece of aswes. What is the maximum umbe of studets i the class fo this to be possible? Sol. Each questio ca be asweed i exactly ways eithe T o F. Total umbe of ways i which the questios ca be asweed = = Out of these ways exactly oe will be all coect aswe. Sice o studet has witte all coect aswes The maximum possible umbe of studets = =. Example. fieds shake hads mutually. Fid the umbe of hadshakes. Sol. Let the fieds be A, B, ad D. Fo oe had shake, thee will be pesos ivolved. To stat with let peso 'A' shakes had with the peso 'B'. It is the same as peso 'B' shakig hads with peso 'A'. AB ad BA ae the same. So i fidig the umbe of hadshakes, we obseve that ode is ot impotat. Hece the umbe of hadshakes will be always A {AB, A, AD} B D B, ad =. D I this poblem =. Numbe of hadshakes will be. {B, BD}!!! Example. Eveybody i a fuctio shakes had with eveybody else. The total umbe of hadshakes is. Fid the umbe of pesos i the fuctio. Sol. Let the umbe of pesos i the fuctio be. The = {D} D!!!

22 8 UNIT- ( ) = 90 ( ) = 0 9 ( ) = 0(0 ) = 0 Hece the umbe of pesos i the fuctio is 0. Example. How may committees of five with a give chaipeso ca be selected fom pesos? Sol. The chaipeso ca be choose i ways ad followig this the othe fou o the committee ca be choose i ways. The possible umbe of such committees = = 0 = 90. Example. Thee ae 8 poits such that ay of of them ae o colliea. How may staight lies ca be daw by joiig these poits? Sol. A staight lie is obtaied by joiig poits. Let the poits be A ad B. The staight lie is obtaied by joiig eithe A with B o B with A. AB ad BA ae same. This is a poblem o combiatio. Total umbe of lies that ca be daw out of '' o-colliea poits = Veificatio : We kow,!!! Hee, = 8, = 8 8! 8 = 8!! 8 8 = 8 8 7! 8 staight lies ca be daw by joiig 8 poits.! Example 7. Thee ae 0 poits such that ay of them ae ocolliea. How may tiagles ca be fomed by joiig these poits? Sol. A tiagle is fomed by joiig o-colliea poits. Hee the ode i which the poits ae joied is ot at all impotat. A Total umbe of tiagles that ca be daw out of '' o-colliea poits = B 8 8 Hee, = 0, =,!!! 0 0! 0! 0!! 7!! ! 7! = 0 0 tiagles ca be fomed by joiig poits out of 0 o-colliea poits.

23 Pemutatios ad ombiatios 87 Alteate method:!!!!!!!! If = 0 A = 0 B Example 8. How may diagoals ca be daw i a hexago? Sol. A hexago has vetices = A diagoal is obtaied by joiig the opposite vetices i pais. Total umbe of sides ad diagoals = = lies icludes sides. Numbe of diagoals = = 9 Alteate method: Numbe of diagoals = Numbe of staight lies fomed Numbe of sides of polygo = = = Numbe of diagoals i a polygo of sides = I a hexago, = Numbe of diagoals Example 9. The maximum umbe of diagoals i a polygo is. Fid the umbe of sides. Sol. Numbe of diagoals i a polygo = 9 ( ) = ( ) = 7 ( ) = 7(7 ) = 7

24 88 UNIT- Alteate : ( ) = 8 = = 0 ( 7) + ( 7) = 0 ( 7) ( + ) = 0 7 = 0 OR + = 0 = 7 = '' caot be a egative umbe Hece = 7 (Heptago) Remembe Whe '' umbe of o-colliea poits ae give i a plae, * umbe of staight lies = * umbe of tiagles = * umbe of diagoals i a polygo = Pascal Tiagle Pascal, Blaise ( - ) geat Fech Mathematicia, pobabilist, combiatioist, physicist ad philosophe. Obseve the tiagle patte discoveed by Pascal. ompae the coespodig elemets i the two tiagles. The tiagle o the ight side is called Pascal tiagle

25 Pemutatios ad ombiatios 89 EXERISE.7. Out of 7 osoats ad vowels, how may wods of cosoats ad vowels ca be fomed?. I how may ways ca spotsme be selected fom a goup of 0?. I how may ways a cicket team of eleve be selected fom 7 playes i which playes ae bowles ad the cicket team must iclude bowles?. How may (i) lies (ii) tiagles ca be daw though 8 poits o a cicle?. How may diagoals ca be daw i a (i) decago (ii) icosago. A Polygo has diagoals. Fid the umbe of sides. 7. Thee ae white ad ed oses i a gade. I how may ways ca flowes of which ed be plucked? 8. I how may ways ca a studet choose couses out of 9 couses, if couses ae compulsoy fo evey studet? 9. Thee ae questios i a questio pape. I how may ways ca a boy solve oe o moe questios? 0. I how may ways cads fom a pack of playig cads ca be chose?. I a electio thee ae 7 cadidates ad thee ae to be elected. A vote is allowed to vote fo ay umbe of cadidates ot geate tha the umbe to be elected. I how may ways ca we vote? EXERISE.8. If thee ae peiods i each wokig day of a school, i how may ways ca oe aage subjects such that each subject is allowed at least oe peiod?. A committee of is to be fomed out of me ad ladies. I how may ways ca this be doe whe (i) at least ladies ae icluded. (ii) at most ladies ae icluded.. A spots team of studets is to be costituted choosig at least fom class IX ad at least fom class X. If thee ae 8 studets i each of these classes, i how may ways ca the team be costituted?. I a vegetable mela o fai, a atist wats to make mascot (a toy that epesets a ogaizatio) with Beas, aot, Peas ad Tomato i a lie. I how may ways ca the atist make the mascot?. Fom a goup of studets, 8 ae to be chose fo a excusio. Thee ae studets who decide that eithe of them will joi o oe of them will joi. I how may ways ca the 8 be chose?. How may chods ca be daw though 0 poits o a cicle? 7. The Eglish alphabet has vowels ad cosoats. How may wods with diffeet vowels ad diffeet cosoats ca be fomed fom the alphabet? 8. I how may ways lettes be posted i post boxes, if ay umbe of lettes ca be posted i all of the thee post boxes? 9. I a goup of studets thee ae scouts. I how may ways ca studets be selected, so as to iclude at least scouts?

26 90 UNIT- Pemutatio ad ombiatio Fudametal Piciple of outig (FP) Pemutatio P ombiatio Factoial otatio!! P = ( )! whee 0 =!!( )! P =! If = 0, P 0 = If =, P =! If =, P = If = 0, 0 = If =, = If =, = ANSWERS EXERISE. ] 0 ] ] 70 ] ] 8 ] 0 EXERISE. ] (i) 7! (ii) 8! (iii) 9! (iv)! ] (i) 70 (ii),,880 (iii) 0,00! (iv) (v) 0 (vi) 870 ] (i) 0 (ii) 0 ] 70 ] (i) (ii) ] ( + ) EXERISE. ] (i),880 (ii),0 (iii) 0,0 (iv) (v) ] (i) 7 (ii) (iii) ] (i) (ii) 8 ] (i) (ii) EXERISE. ] 0 ],880 ] 70 ] ] ] 90 7] 0 8] (a) 80 (b) 0 (c) 0 9] 0 EXERISE. ] (i) 0 (ii) (iii),,700 ] (i) (ii) 7 ] ] 7 EXERISE.7 ],00 ] ],00 ] (i) 8 (ii) ] (i) (ii) 70 ] 7] 8 8] 9] 0],70,7 ] EXERISE.8 ],00 ] (i) 8 (ii) 8 ], ] ] 7 ] 90 7] 0,00 8] 9]

Using Counting Techniques to Determine Probabilities

Using Counting Techniques to Determine Probabilities Kowledge ticle: obability ad Statistics Usig outig Techiques to Detemie obabilities Tee Diagams ad the Fudametal outig iciple impotat aspect of pobability theoy is the ability to detemie the total umbe

More information

4. PERMUTATIONS AND COMBINATIONS

4. PERMUTATIONS AND COMBINATIONS 4. PERMUTATIONS AND COMBINATIONS PREVIOUS EAMCET BITS 1. The umbe of ways i which 13 gold cois ca be distibuted amog thee pesos such that each oe gets at least two gold cois is [EAMCET-000] 1) 3 ) 4 3)

More information

Consider unordered sample of size r. This sample can be used to make r! Ordered samples (r! permutations). unordered sample

Consider unordered sample of size r. This sample can be used to make r! Ordered samples (r! permutations). unordered sample Uodeed Samples without Replacemet oside populatio of elemets a a... a. y uodeed aagemet of elemets is called a uodeed sample of size. Two uodeed samples ae diffeet oly if oe cotais a elemet ot cotaied

More information

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n!

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n! 0 Combiatoial Aalysis Copyight by Deiz Kalı 4 Combiatios Questio 4 What is the diffeece betwee the followig questio i How may 3-lette wods ca you wite usig the lettes A, B, C, D, E ii How may 3-elemet

More information

MATH Midterm Solutions

MATH Midterm Solutions MATH 2113 - Midtem Solutios Febuay 18 1. A bag of mables cotais 4 which ae ed, 4 which ae blue ad 4 which ae gee. a How may mables must be chose fom the bag to guaatee that thee ae the same colou? We ca

More information

The Pigeonhole Principle 3.4 Binomial Coefficients

The Pigeonhole Principle 3.4 Binomial Coefficients Discete M athematic Chapte 3: Coutig 3. The Pigeohole Piciple 3.4 Biomial Coefficiets D Patic Cha School of Compute Sciece ad Egieeig South Chia Uivesity of Techology Ageda Ch 3. The Pigeohole Piciple

More information

The number of r element subsets of a set with n r elements

The number of r element subsets of a set with n r elements Popositio: is The umbe of elemet subsets of a set with elemets Poof: Each such subset aises whe we pick a fist elemet followed by a secod elemet up to a th elemet The umbe of such choices is P But this

More information

BINOMIAL THEOREM An expression consisting of two terms, connected by + or sign is called a

BINOMIAL THEOREM An expression consisting of two terms, connected by + or sign is called a BINOMIAL THEOREM hapte 8 8. Oveview: 8.. A epessio cosistig of two tems, coected by + o sig is called a biomial epessio. Fo eample, + a, y,,7 4 5y, etc., ae all biomial epessios. 8.. Biomial theoem If

More information

BINOMIAL THEOREM NCERT An expression consisting of two terms, connected by + or sign is called a

BINOMIAL THEOREM NCERT An expression consisting of two terms, connected by + or sign is called a 8. Oveview: 8.. A epessio cosistig of two tems, coected by + o sig is called a biomial epessio. Fo eample, + a, y,,7 4, etc., ae all biomial 5y epessios. 8.. Biomial theoem BINOMIAL THEOREM If a ad b ae

More information

Ch 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology

Ch 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology Disc ete Mathem atic Chapte 3: Coutig 3. The Pigeohole Piciple 3.4 Biomial Coefficiets D Patic Cha School of Compute Sciece ad Egieeig South Chia Uivesity of Techology Pigeohole Piciple Suppose that a

More information

ICS141: Discrete Mathematics for Computer Science I

ICS141: Discrete Mathematics for Computer Science I Uivesity of Hawaii ICS141: Discete Mathematics fo Compute Sciece I Dept. Ifomatio & Compute Sci., Uivesity of Hawaii Ja Stelovsy based o slides by D. Bae ad D. Still Oigials by D. M. P. Fa ad D. J.L. Goss

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS Pemutatios Ad ombiatios MODULE - I 7 PERMUTATIONS AND OMBINATIONS The othe day, I wated to tavel fom Bagaloe to Allahabad by tai. Thee is o diect tai fom Bagaloe to Allahabad, but thee ae tais fom Bagaloe

More information

( ) ( ) ( ) ( ) Solved Examples. JEE Main/Boards = The total number of terms in the expansion are 8.

( ) ( ) ( ) ( ) Solved Examples. JEE Main/Boards = The total number of terms in the expansion are 8. Mathematics. Solved Eamples JEE Mai/Boads Eample : Fid the coefficiet of y i c y y Sol: By usig fomula of fidig geeal tem we ca easily get coefficiet of y. I the biomial epasio, ( ) th tem is c T ( y )

More information

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method CHAPTER 5 : SERIES 5.1 Seies 5. The Sum of a Seies 5..1 Sum of Powe of Positive Iteges 5.. Sum of Seies of Patial Factio 5..3 Diffeece Method 5.3 Test of covegece 5.3.1 Divegece Test 5.3. Itegal Test 5.3.3

More information

MATH /19: problems for supervision in week 08 SOLUTIONS

MATH /19: problems for supervision in week 08 SOLUTIONS MATH10101 2018/19: poblems fo supevisio i week 08 Q1. Let A be a set. SOLUTIONS (i Pove that the fuctio c: P(A P(A, defied by c(x A \ X, is bijective. (ii Let ow A be fiite, A. Use (i to show that fo each

More information

4. PERMUTATIONS AND COMBINATIONS Quick Review

4. PERMUTATIONS AND COMBINATIONS Quick Review 4 ERMUTATIONS AND COMBINATIONS Quick Review A aagemet that ca be fomed by takig some o all of a fiite set of thigs (o objects) is called a emutatio A emutatio is said to be a liea emutatio if the objects

More information

Counting Functions and Subsets

Counting Functions and Subsets CHAPTER 1 Coutig Fuctios ad Subsets This chapte of the otes is based o Chapte 12 of PJE See PJE p144 Hee ad below, the efeeces to the PJEccles book ae give as PJE The goal of this shot chapte is to itoduce

More information

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P.

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P. Pogessio Sequece & Seies A set of umbes whose domai is a eal umbe is called a SEQUENCE ad sum of the sequece is called a SERIES. If a, a, a, a 4,., a, is a sequece, the the expessio a + a + a + a 4 + a

More information

MATH 1823 Honors Calculus I Permutations, Selections, the Binomial Theorem

MATH 1823 Honors Calculus I Permutations, Selections, the Binomial Theorem MATH 823 Hoors Calculus I Permutatios, Selectios, the Biomial Theorem Permutatios. The umber of ways of arragig (permutig) obects is deoted by! ad is called factorial. I formig a particular arragemet (or

More information

Einstein Classes, Unit No. 102, 103, Vardhman Ring Road Plaza, Vikas Puri Extn., Outer Ring Road New Delhi , Ph. : ,

Einstein Classes, Unit No. 102, 103, Vardhman Ring Road Plaza, Vikas Puri Extn., Outer Ring Road New Delhi , Ph. : , MB BINOMIAL THEOREM Biomial Epessio : A algebaic epessio which cotais two dissimila tems is called biomial epessio Fo eample :,,, etc / ( ) Statemet of Biomial theoem : If, R ad N, the : ( + ) = a b +

More information

a) The average (mean) of the two fractions is halfway between them: b) The answer is yes. Assume without loss of generality that p < r.

a) The average (mean) of the two fractions is halfway between them: b) The answer is yes. Assume without loss of generality that p < r. Solutios to MAML Olympiad Level 00. Factioated a) The aveage (mea) of the two factios is halfway betwee them: p ps+ q ps+ q + q s qs qs b) The aswe is yes. Assume without loss of geeality that p

More information

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences Chapte : Theoy of Modula Aithmetic 8 Sectio D Chiese Remaide Theoem By the ed of this sectio you will be able to pove the Chiese Remaide Theoem apply this theoem to solve simultaeous liea cogueces The

More information

Permutations, Combinations, and the Binomial Theorem

Permutations, Combinations, and the Binomial Theorem Permutatios, ombiatios, ad the Biomial Theorem Sectio Permutatios outig methods are used to determie the umber of members of a specific set as well as outcomes of a evet. There are may differet ways to

More information

DANIEL YAQUBI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD

DANIEL YAQUBI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD MIXED -STIRLING NUMERS OF THE SEOND KIND DANIEL YAQUI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD Abstact The Stilig umbe of the secod id { } couts the umbe of ways to patitio a set of labeled balls ito

More information

2012 GCE A Level H2 Maths Solution Paper Let x,

2012 GCE A Level H2 Maths Solution Paper Let x, GCE A Level H Maths Solutio Pape. Let, y ad z be the cost of a ticet fo ude yeas, betwee ad 5 yeas, ad ove 5 yeas categoies espectively. 9 + y + 4z =. 7 + 5y + z = 8. + 4y + 5z = 58.5 Fo ude, ticet costs

More information

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

More information

Auchmuty High School Mathematics Department Sequences & Series Notes Teacher Version

Auchmuty High School Mathematics Department Sequences & Series Notes Teacher Version equeces ad eies Auchmuty High chool Mathematics Depatmet equeces & eies Notes Teache Vesio A sequece takes the fom,,7,0,, while 7 0 is a seies. Thee ae two types of sequece/seies aithmetic ad geometic.

More information

Discussion 02 Solutions

Discussion 02 Solutions STAT 400 Discussio 0 Solutios Spig 08. ~.5 ~.6 At the begiig of a cetai study of a goup of pesos, 5% wee classified as heavy smoes, 30% as light smoes, ad 55% as osmoes. I the fiveyea study, it was detemied

More information

KEY. Math 334 Midterm II Fall 2007 section 004 Instructor: Scott Glasgow

KEY. Math 334 Midterm II Fall 2007 section 004 Instructor: Scott Glasgow KEY Math 334 Midtem II Fall 7 sectio 4 Istucto: Scott Glasgow Please do NOT wite o this exam. No cedit will be give fo such wok. Rathe wite i a blue book, o o you ow pape, pefeably egieeig pape. Wite you

More information

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as Math 7409 Hoewok 2 Fall 2010 1. Eueate the equivalece classes of siple gaphs o 5 vetices by usig the patte ivetoy as a guide. The cycle idex of S 5 actig o 5 vetices is 1 x 5 120 1 10 x 3 1 x 2 15 x 1

More information

Stat 198 for 134 Instructor: Mike Leong

Stat 198 for 134 Instructor: Mike Leong Chapter 2: Repeated Trials ad Samplig Sectio 2.1 Biomial Distributio 2.2 Normal Approximatio: Method 2.3 Normal Approximatios: Derivatio (Skip) 2.4 Poisso Approximatio 2.5 Radom Samplig Chapter 2 Table

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Conditional Convergence of Infinite Products

Conditional Convergence of Infinite Products Coditioal Covegece of Ifiite Poducts William F. Tech Ameica Mathematical Mothly 106 1999), 646-651 I this aticle we evisit the classical subject of ifiite poducts. Fo stadad defiitios ad theoems o this

More information

Math for Liberal Studies

Math for Liberal Studies Math for Liberal Studies We want to measure the influence each voter has As we have seen, the number of votes you have doesn t always reflect how much influence you have In order to measure the power of

More information

EXAMPLES. Leader in CBSE Coaching. Solutions of BINOMIAL THEOREM A.V.T.E. by AVTE (avte.in) Class XI

EXAMPLES. Leader in CBSE Coaching. Solutions of BINOMIAL THEOREM A.V.T.E. by AVTE (avte.in) Class XI avtei EXAMPLES Solutios of AVTE by AVTE (avtei) lass XI Leade i BSE oachig 1 avtei SHORT ANSWER TYPE 1 Fid the th tem i the epasio of 1 We have T 1 1 1 1 1 1 1 1 1 1 Epad the followig (1 + ) 4 Put 1 y

More information

Using Difference Equations to Generalize Results for Periodic Nested Radicals

Using Difference Equations to Generalize Results for Periodic Nested Radicals Usig Diffeece Equatios to Geealize Results fo Peiodic Nested Radicals Chis Lyd Uivesity of Rhode Islad, Depatmet of Mathematics South Kigsto, Rhode Islad 2 2 2 2 2 2 2 π = + + +... Vieta (593) 2 2 2 =

More information

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer. SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify

More information

CfE Advanced Higher Mathematics Course materials Topic 5: Binomial theorem

CfE Advanced Higher Mathematics Course materials Topic 5: Binomial theorem SCHOLAR Study Guide CfE Advaced Highe Mathematics Couse mateials Topic : Biomial theoem Authoed by: Fioa Withey Stilig High School Kae Withey Stilig High School Reviewed by: Magaet Feguso Peviously authoed

More information

LESSON 15: COMPOUND INTEREST

LESSON 15: COMPOUND INTEREST High School: Expoeial Fuctios LESSON 15: COMPOUND INTEREST 1. You have see this fomula fo compoud ieest. Paamete P is the picipal amou (the moey you stat with). Paamete is the ieest ate pe yea expessed

More information

Chapter 2 Sampling distribution

Chapter 2 Sampling distribution [ 05 STAT] Chapte Samplig distibutio. The Paamete ad the Statistic Whe we have collected the data, we have a whole set of umbes o desciptios witte dow o a pape o stoed o a compute file. We ty to summaize

More information

Sets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram

Sets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse

More information

Greatest term (numerically) in the expansion of (1 + x) Method 1 Let T

Greatest term (numerically) in the expansion of (1 + x) Method 1 Let T BINOMIAL THEOREM_SYNOPSIS Geatest tem (umeically) i the epasio of ( + ) Method Let T ( The th tem) be the geatest tem. Fid T, T, T fom the give epasio. Put T T T ad. Th will give a iequality fom whee value

More information

Math 166 Week-in-Review - S. Nite 11/10/2012 Page 1 of 5 WIR #9 = 1+ r eff. , where r. is the effective interest rate, r is the annual

Math 166 Week-in-Review - S. Nite 11/10/2012 Page 1 of 5 WIR #9 = 1+ r eff. , where r. is the effective interest rate, r is the annual Math 66 Week-i-Review - S. Nite // Page of Week i Review #9 (F-F.4, 4.-4.4,.-.) Simple Iteest I = Pt, whee I is the iteest, P is the picipal, is the iteest ate, ad t is the time i yeas. P( + t), whee A

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Permutations and Combinations

Permutations and Combinations Massachusetts Istitute of Techology 6.042J/18.062J, Fall 02: Mathematics fo Compute Sciece Pof. Albet Meye ad D. Radhika Nagpal Couse Notes 9 Pemutatios ad Combiatios I Notes 8, we saw a vaiety of techiques

More information

9.7 Pascal s Formula and the Binomial Theorem

9.7 Pascal s Formula and the Binomial Theorem 592 Chapte 9 Coutig ad Pobability Example 971 Values of 97 Pascal s Fomula ad the Biomial Theoem I m vey well acquaited, too, with mattes mathematical, I udestad equatios both the simple ad quadatical

More information

ELEMENTARY AND COMPOUND EVENTS PROBABILITY

ELEMENTARY AND COMPOUND EVENTS PROBABILITY Euopea Joual of Basic ad Applied Scieces Vol. 5 No., 08 ELEMENTARY AND COMPOUND EVENTS PROBABILITY William W.S. Che Depatmet of Statistics The Geoge Washigto Uivesity Washigto D.C. 003 E-mail: williamwsche@gmail.com

More information

EDEXCEL NATIONAL CERTIFICATE UNIT 28 FURTHER MATHEMATICS FOR TECHNICIANS OUTCOME 2- ALGEBRAIC TECHNIQUES TUTORIAL 1 - PROGRESSIONS

EDEXCEL NATIONAL CERTIFICATE UNIT 28 FURTHER MATHEMATICS FOR TECHNICIANS OUTCOME 2- ALGEBRAIC TECHNIQUES TUTORIAL 1 - PROGRESSIONS EDEXCEL NATIONAL CERTIFICATE UNIT 8 FURTHER MATHEMATICS FOR TECHNICIANS OUTCOME - ALGEBRAIC TECHNIQUES TUTORIAL - PROGRESSIONS CONTENTS Be able to apply algebaic techiques Aithmetic pogessio (AP): fist

More information

Intermediate Math Circles November 4, 2009 Counting II

Intermediate Math Circles November 4, 2009 Counting II Uiversity of Waterloo Faculty of Mathematics Cetre for Educatio i Mathematics ad Computig Itermediate Math Circles November 4, 009 Coutig II Last time, after lookig at the product rule ad sum rule, we

More information

Advanced Physical Geodesy

Advanced Physical Geodesy Supplemetal Notes Review of g Tems i Moitz s Aalytic Cotiuatio Method. Advaced hysical Geodesy GS887 Chistophe Jekeli Geodetic Sciece The Ohio State Uivesity 5 South Oval Mall Columbus, OH 4 7 The followig

More information

THE ANALYTIC LARGE SIEVE

THE ANALYTIC LARGE SIEVE THE ANALYTIC LAGE SIEVE 1. The aalytic lage sieve I the last lectue we saw how to apply the aalytic lage sieve to deive a aithmetic fomulatio of the lage sieve, which we applied to the poblem of boudig

More information

CIS Spring 2018 (instructor Val Tannen)

CIS Spring 2018 (instructor Val Tannen) CIS 160 - Sprig 2018 (istructor Val Tae) Lecture 5 Thursday, Jauary 25 COUNTING We cotiue studyig how to use combiatios ad what are their properties. Example 5.1 How may 8-letter strigs ca be costructed

More information

PROGRESSION AND SERIES

PROGRESSION AND SERIES INTRODUCTION PROGRESSION AND SERIES A gemet of umbes {,,,,, } ccodig to some well defied ule o set of ules is clled sequece Moe pecisely, we my defie sequece s fuctio whose domi is some subset of set of

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k

More information

CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo

CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber

More information

P1 Chapter 8 :: Binomial Expansion

P1 Chapter 8 :: Binomial Expansion P Chapter 8 :: Biomial Expasio jfrost@tiffi.kigsto.sch.uk www.drfrostmaths.com @DrFrostMaths Last modified: 6 th August 7 Use of DrFrostMaths for practice Register for free at: www.drfrostmaths.com/homework

More information

Generating Functions. 1 Operations on generating functions

Generating Functions. 1 Operations on generating functions Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example

More information

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) = COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.

More information

Multivector Functions

Multivector Functions I: J. Math. Aal. ad Appl., ol. 24, No. 3, c Academic Pess (968) 467 473. Multivecto Fuctios David Hestees I a pevious pape [], the fudametals of diffeetial ad itegal calculus o Euclidea -space wee expessed

More information

At the end of this topic, students should be able to understand the meaning of finite and infinite sequences and series, and use the notation u

At the end of this topic, students should be able to understand the meaning of finite and infinite sequences and series, and use the notation u Natioal Jio College Mathematics Depatmet 00 Natioal Jio College 00 H Mathematics (Seio High ) Seqeces ad Seies (Lecte Notes) Topic : Seqeces ad Seies Objectives: At the ed of this topic, stdets shold be

More information

Lecture 3 : Probability II. Jonathan Marchini

Lecture 3 : Probability II. Jonathan Marchini Lecture 3 : Probability II Jonathan Marchini Puzzle 1 Pick any two types of card that can occur in a normal pack of shuffled playing cards e.g. Queen and 6. What do you think is the probability that somewhere

More information

MATHS FOR ENGINEERS ALGEBRA TUTORIAL 8 MATHEMATICAL PROGRESSIONS AND SERIES

MATHS FOR ENGINEERS ALGEBRA TUTORIAL 8 MATHEMATICAL PROGRESSIONS AND SERIES MATHS FOR ENGINEERS ALGEBRA TUTORIAL 8 MATHEMATICAL PROGRESSIONS AND SERIES O completio of this ttoial yo shold be able to do the followig. Eplai aithmetical ad geometic pogessios. Eplai factoial otatio

More information

Week 03 Discussion. 30% are serious, and 50% are stable. Of the critical ones, 30% die; of the serious, 10% die; and of the stable, 2% die.

Week 03 Discussion. 30% are serious, and 50% are stable. Of the critical ones, 30% die; of the serious, 10% die; and of the stable, 2% die. STAT 400 Wee 03 Discussio Fall 07. ~.5- ~.6- At the begiig of a cetai study of a gou of esos, 5% wee classified as heavy smoes, 30% as light smoes, ad 55% as osmoes. I the five-yea study, it was detemied

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

14 Classic Counting Problems in Combinatorics

14 Classic Counting Problems in Combinatorics 14 Classic Coutig Problems i Combiatorics (Herbert E. Müller, May 2017, herbert-mueller.ifo) Combiatorics is about coutig objects, or the umber of ways of doig somethig. I this article I preset some classic

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

On ARMA(1,q) models with bounded and periodically correlated solutions

On ARMA(1,q) models with bounded and periodically correlated solutions Reseach Repot HSC/03/3 O ARMA(,q) models with bouded ad peiodically coelated solutios Aleksade Weo,2 ad Agieszka Wy oma ska,2 Hugo Steihaus Cete, Woc aw Uivesity of Techology 2 Istitute of Mathematics,

More information

Sequences I. Chapter Introduction

Sequences I. Chapter Introduction Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which

More information

I PUC MATHEMATICS CHAPTER - 08 Binomial Theorem. x 1. Expand x + using binomial theorem and hence find the coefficient of

I PUC MATHEMATICS CHAPTER - 08 Binomial Theorem. x 1. Expand x + using binomial theorem and hence find the coefficient of Two Maks Questios I PU MATHEMATIS HAPTER - 08 Biomial Theoem. Epad + usig biomial theoem ad hece fid the coefficiet of y y. Epad usig biomial theoem. Hece fid the costat tem of the epasio.. Simplify +

More information

ARRANGEMENTS IN A CIRCLE

ARRANGEMENTS IN A CIRCLE ARRANGEMENTS IN A CIRCLE Whe objects are arraged i a circle, the total umber of arragemets is reduced. The arragemet of (say) four people i a lie is easy ad o problem (if they liste of course!!). With

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

Problem Set 2 Solutions

Problem Set 2 Solutions CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S

More information

Technical Report: Bessel Filter Analysis

Technical Report: Bessel Filter Analysis Sasa Mahmoodi 1 Techical Repot: Bessel Filte Aalysis 1 School of Electoics ad Compute Sciece, Buildig 1, Southampto Uivesity, Southampto, S17 1BJ, UK, Email: sm3@ecs.soto.ac.uk I this techical epot, we

More information

Set Notation and Axioms of Probability NOT NOT X = X = X'' = X

Set Notation and Axioms of Probability NOT NOT X = X = X'' = X Set Notation and Axioms of Probability Memory Hints: Intersection I AND I looks like A for And Union U OR + U looks like U for Union Complement NOT X = X = X' NOT NOT X = X = X'' = X Commutative Law A

More information

On composite conformal mapping of an annulus to a plane with two holes

On composite conformal mapping of an annulus to a plane with two holes O composite cofomal mappig of a aulus to a plae with two holes Mila Batista (July 07) Abstact I the aticle we coside the composite cofomal map which maps aulus to ifiite egio with symmetic hole ad ealy

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

Recursion. Algorithm : Design & Analysis [3]

Recursion. Algorithm : Design & Analysis [3] Recusio Algoithm : Desig & Aalysis [] I the last class Asymptotic gowth ate he Sets Ο, Ω ad Θ Complexity Class A Example: Maximum Susequece Sum Impovemet of Algoithm Compaiso of Asymptotic Behavio Aothe

More information

What is Probability?

What is Probability? Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t kow what will happe o ay oe experimet, but has a log ru order. The cocept of probability

More information

Lecture 24: Observability and Constructibility

Lecture 24: Observability and Constructibility ectue 24: Obsevability ad Costuctibility 7 Obsevability ad Costuctibility Motivatio: State feedback laws deped o a kowledge of the cuet state. I some systems, xt () ca be measued diectly, e.g., positio

More information

ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS

ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS Joual of Pue ad Alied Mathematics: Advaces ad Alicatios Volume 0 Numbe 03 Pages 5-58 ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS ALI H HAKAMI Deatmet of Mathematics

More information

BINOMIAL THEOREM SOLUTION. 1. (D) n. = (C 0 + C 1 x +C 2 x C n x n ) (1+ x+ x 2 +.)

BINOMIAL THEOREM SOLUTION. 1. (D) n. = (C 0 + C 1 x +C 2 x C n x n ) (1+ x+ x 2 +.) BINOMIAL THEOREM SOLUTION. (D) ( + + +... + ) (+ + +.) The coefficiet of + + + +... + fo. Moeove coefficiet of is + + + +... + if >. So. (B)... e!!!! The equied coefficiet coefficiet of i e -.!...!. (A),

More information

When two numbers are written as the product of their prime factors, they are in factored form.

When two numbers are written as the product of their prime factors, they are in factored form. 10 1 Study Guide Pages 420 425 Factos Because 3 4 12, we say that 3 and 4 ae factos of 12. In othe wods, factos ae the numbes you multiply to get a poduct. Since 2 6 12, 2 and 6 ae also factos of 12. The

More information

Lecture 6: October 16, 2017

Lecture 6: October 16, 2017 Ifomatio ad Codig Theoy Autum 207 Lectue: Madhu Tulsiai Lectue 6: Octobe 6, 207 The Method of Types Fo this lectue, we will take U to be a fiite uivese U, ad use x (x, x 2,..., x to deote a sequece of

More information

Finite q-identities related to well-known theorems of Euler and Gauss. Johann Cigler

Finite q-identities related to well-known theorems of Euler and Gauss. Johann Cigler Fiite -idetities elated to well-ow theoems of Eule ad Gauss Joha Cigle Faultät fü Mathemati Uivesität Wie A-9 Wie, Nodbegstaße 5 email: oha.cigle@uivie.ac.at Abstact We give geealizatios of a fiite vesio

More information

BINOMIAL THEOREM & ITS SIMPLE APPLICATION

BINOMIAL THEOREM & ITS SIMPLE APPLICATION Etei lasses, Uit No. 0, 0, Vadhma Rig Road Plaza, Vikas Pui Et., Oute Rig Road New Delhi 0 08, Ph. : 9690, 87 MB Sllabus : BINOMIAL THEOREM & ITS SIMPLE APPLIATION Biomia Theoem fo a positive itegal ide;

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

SOLUTIONS TO PRISM PROBLEMS Junior Level 2014

SOLUTIONS TO PRISM PROBLEMS Junior Level 2014 SOLUTIONS TO PRISM PROBLEMS Juior Level 04. (B) Sice 50% of 50 is 50 5 ad 50% of 40 is the secod by 5 0 5. 40 0, the first exceeds. (A) Oe way of comparig the magitudes of the umbers,,, 5 ad 0.7 is 4 5

More information

Permutations and Combinations

Permutations and Combinations Pemutations and Combinations Mach 11, 2005 1 Two Counting Pinciples Addition Pinciple Let S 1, S 2,, S m be subsets of a finite set S If S S 1 S 2 S m, then S S 1 + S 2 + + S m Multiplication Pinciple

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

First selection test, May 1 st, 2008

First selection test, May 1 st, 2008 First selectio test, May st, 2008 Problem. Let p be a prime umber, p 3, ad let a, b be iteger umbers so that p a + b ad p 2 a 3 + b 3. Show that p 2 a + b or p 3 a 3 + b 3. Problem 2. Prove that for ay

More information

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007 UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =

More information

AIEEE 2004 (MATHEMATICS)

AIEEE 2004 (MATHEMATICS) AIEEE 004 (MATHEMATICS) Impotat Istuctios: i) The test is of hous duatio. ii) The test cosists of 75 questios. iii) The maimum maks ae 5. iv) Fo each coect aswe you will get maks ad fo a wog aswe you will

More information

L8b - Laplacians in a circle

L8b - Laplacians in a circle L8b - Laplacias i a cicle Rev //04 `Give you evidece,' the Kig epeated agily, `o I'll have you executed, whethe you'e evous o ot.' `I'm a poo ma, you Majesty,' the Hatte bega, i a temblig voice, `--ad

More information

Permutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination

Permutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination Discrete Mathematic Chapter 3: C outig 3. The Basics of Coutig 3.3 Permutatios & Combiatios 3.5 Geeralized Permutatios & Combiatios 3.6 Geeratig Permutatios & Combiatios Dr Patrick Cha School of Computer

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

More information

1) (A B) = A B ( ) 2) A B = A. i) A A = φ i j. ii) Additional Important Properties of Sets. De Morgan s Theorems :

1) (A B) = A B ( ) 2) A B = A. i) A A = φ i j. ii) Additional Important Properties of Sets. De Morgan s Theorems : Additional Impotant Popeties of Sets De Mogan s Theoems : A A S S Φ, Φ S _ ( A ) A ) (A B) A B ( ) 2) A B A B Cadinality of A, A, is defined as the numbe of elements in the set A. {a,b,c} 3, { }, while

More information

Injections, Surjections, and the Pigeonhole Principle

Injections, Surjections, and the Pigeonhole Principle Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs

More information

05 - PERMUTATIONS AND COMBINATIONS Page 1 ( Answers at the end of all questions )

05 - PERMUTATIONS AND COMBINATIONS Page 1 ( Answers at the end of all questions ) 05 - PERMUTATIONS AND COMBINATIONS Page 1 ( Aswers at the ed of all questios ) ( 1 ) If the letters of the word SACHIN are arraged i all possible ways ad these words are writte out as i dictioary, the

More information