PERMUTATIONS AND COMBINATIONS

Size: px
Start display at page:

Download "PERMUTATIONS AND COMBINATIONS"

Transcription

1 PERMUTATIONS AND COMBINATIONS OBJECTIVE PROBLEMS. There are parcels ad 5 post-offices. I how may differet ways the registratio of parcel ca be made 5 (a) 0 (b) 5 (c) 5 (d) 5. I how may ways books ca be arraged i a row so that two specified books are ot together (a)! ( )! (b) ( )!( ) (c)! ( ) (d) ( )!. I how may ways ca 0 true-false questios be replied (a) 0 (b) 00 (c)5 (d)0. There are 5 roads leadig to a tow from a village. The umber of differet ways i which a villager ca go to the tow ad retur back, is (a) 5 (b) 0 (c) 0 (d) 5 5. Six idetical cois are arraged i a row. The umber of ways i which the umber of tails is equal to the umber of heads is (a) 0 (b) 9 (c) 0 (d) 0. Assumig that o two cosecutive digits are same, the umber of digit umbers, is (a)! (b) 9! (c) 9 (d) 9 7. The sum of all digit umbers that ca be formed by usig the digits,,, 8 (repetitio of digits ot allowed) is (a) 0 (b) 580 (c) 58 (d) Noe of these

2 8. The umber of umbers that ca be formed with the help of the digits,,,,,, so that odd digits always occupy odd places, is (a) (b) 8 (c) (d) 0 9. The umber of words which ca be formed from the letters of the word MAXIMUM, if two cosoats caot occur together, is (a)! (b)!! (c) 7! 0. The value of P r is equal to (d) Noe of these (a) P r + r Pr (b). P + r Pr (c) ( Pr + Pr ) (d) Pr + Pr. Numbers greater tha 000 but ot greater tha 000 which ca be formed with the digits 0,,,, (repetitio of digits is allowed), are (a) 50 (b) 75 (c) 50 (d) 57. I how may ways ca 0 balls be divided betwee two boys, oe receivig two ad the other eight balls (a) 5 (b) 75 (c) 90 (d) Noe of these. There are parcels ad 5 post-offices. I how may differet ways the registratio of parcel ca be made 5 (a) 0 (b) 5 (c) 5 (d) 5. How may words ca be made from the letters of the word COMMITTEE 9! (a) (!) (c) 9!! 9! (b) (!) (d) 9! 5. I how may ways ca 5 boys ad girls sit i a row so that o two girls are together (a) 5!! (b) P 5! 5 (c) P 5! (d) P!

3 All the letters of the word EAMCET are arraged i all possible ways. The umber of such arragemets i which two vowels are ot adjacet to each other is (a) 0 (b) (c) 7 (d) 5 7. How may umbers ca be made with the digits,, 5,, 7, 8 lyig betwee 000 ad 000 which are divisible by 5 while repetitio of ay digit is ot allowed i ay umber (a) 0 (b) (c) 0 (d) 8. How may umbers cosistig of 5 digits ca be formed i which the digits, ad 7 are used oly oce ad the digit 5 is used twice (a) 0 (b) 0 (c) 5 (d) I how may ways letters ca be posted i letter-boxes, if all the letters are ot posted i the same letter-box (a) (b) 0 (c) 77 (d) 8 0. The total umber of permutatios of the letters of the word BANANA is (a) 0 (b) 0 (c) 70 (d). How may words ca be formed with the letters of the word MATHEMATICS by rearragig them (a) (c)!!!!!!! (b)!! (d)!. How may umbers less tha 000 ca be made from the digits,,,, 5, (repetitio is ot allowed) (a) 5 (b) 0 (c) 50 (d) Noe of these. How may umbers greater tha hudred ad divisible by 5 ca be made from the digits,, 5,, if o digit is repeated (a) (b) (c) (d) 0

4 If a deotes the umber of permutatios of x + thigs take all at a time, b the umber of permutatios of x thigs take at a time ad c the umber of permutatios of x thigs take all at a time such that (a) 5 (b) (c) 0 (d) 8 a 8 bc, the the value of x is 5. The product of ay r cosecutive atural umbers is always divisible by (a) r! (b) r (c) r (d) Noe of these. The umber of ways i which te cadidates A, A,... A0 ca be raked such that A is always above A 0 is (a) 5! (b) (5!) (c) 0! (d) (0!) 7. How may umbers lyig betwee 999 ad 0000 ca be formed with the help of the digit 0,,,,7,8 whe the digits are ot to be repeated (a) 00 (b) 00 (c) 00 (d) The umber of digit eve umbers that ca be formed usig 0,,,,, 5, without repetitio is (a) 0 (b) 00 (c) 0 (d) 0 9. The umber of words that ca be formed out of the letters of the word ARTICLE so that the vowels occupy eve places is (a) (b) 57 (c) (d) If the letters of the word SACHIN arraged i all possible ways ad these words are writte out as i dictioary, the the word SACHIN appears at serial umber (a) 0 (b) 0 (c) 0 (d) 00

5 The umber of arragemets of the letters of the word BANANA i which two N s do ot appear adjacetly is (a) 0 (b) 0 (c) 80 (d) 00. If a ma ad his wife eter i a bus, i which five seats are vacat, the the umber of differet ways i which they ca be seated is (a) (b) 5 (c) 0 (d) 0. Total umber of four digit odd umbers that ca be formed usig 0,,,, 5, 7 are (a) (b) 75 (c) 00 (d) 70. Let the eleve letters A, B...,K deote a arbitrary permutatio of the itegers (,,...), the ( A )( B )( C )...( K ) (a) Necessarily zero (c) Always eve (b) Always odd (d) Noe of these 5. The umber of ways i which me ad 5 wome ca die at a roud table if o two wome are to sit together is give by (a)! 5! (b) 0 (c) 5!! (d) 7! 5!. If eleve members of a committee sit at a roud table so that the Presidet ad Secretary always sit together, the the umber of arragemets is (a) 0! (b) 0! (c) 9! (d) Noe of these 7. The umber of ways i which 5 beads of differet colours form a ecklace is (a) (b) (c) 0 (d) 0 8. I how may ways 7 me ad 7 wome ca be seated aroud a roud table such that o two wome ca sit together (a) ( 7!) (b) 7!! (c) (!) (d) 7!

6 9. I how may ways a garlad ca be made from exactly 0 flowers (a) 0! (b) 9! 9! (c) (9!) (d) 0. I how may ways ca 5 boys ad 5 girls sit i a circle so that o two boys sit together (a)! 5! 5 (b)! 5! (c) 5! 5! (d) Noe of these. The umber of ways that 8 beads of differet colours be strig as a ecklace is (a) 50 (b) 880 (c) 500 (d) 0. I how may ways ca getleme sit aroud a roud table so that three specified getleme are always together (a) 9! (b) 0! (c)!0! (d)!9!. The umber of ways i which 5 male ad female members of a committee ca be seated aroud a roud table so that the two female are ot seated together is (a) 80 (b) 00 (c) 70 (d) 80. C + r C r is equal to (a) + C r (b) C r+ + (c) C r+ (d) C r 5. A ma has 7 frieds. I how may ways he ca ivite oe or more of them for a tea party (a) 8 (b) 5 (c) 7 (d) 0. If, C 8 C ad r r C r+, the the value of r is (a) (b) (c) (d) Noe of these 7. Everybody i a room shakes had with everybody else. The total umber of had shakes is. The total umber of persos i the room is (a) (b) (c) (d)

7 8. If is eve ad the value of C r is maximum, the r (a) (c) (b) + (d) Noe of these 9. If C : C :, the for which of the followig values of r, the value of C will be 5 r (a) r (b) r (c) r (d) r If C r C r+, the the value of r is (a) (b) (c) 5 (d) 8 5. I a electio there are 8 cadidates, out of which 5 are to be choose. If a voter may vote for ay umber of cadidates but ot greater tha the umber to be choose, the i how may ways ca a voter vote (a) (b) (c) 8 (d) Noe of these 5. I a city o two persos have idetical set of teeth ad there is o perso without a tooth. Also o perso has more tha teeth. If we disregard the shape ad size of tooth ad cosider oly the positioig of the teeth, the the maximum populatio of the city is (a) (b) () (c) (d) 5. How may words ca be formed by takig cosoats ad vowels out of 5 cosoats ad vowels (a) 5 C C (b) 5 C C 5 (c) 5 C C (d) ( 5 C C ) (5)! 5. There are 5 persos i a party ad each perso shake had with aother, the total umber of hadshakes is (a) 5 P (b) 5 C (c)! 5 (d) (5!)

8 55. There are 5 persos i a party ad each perso shake had with aother, the total umber of hadshakes is (a) 5 P (b) 5 C (c)! 5 (d) (5!) 5. If 8, C C ad r r C r +, the equals (a) 8 (b) 9 (c) 0 (d) I a electio the umber of cadidates is greater tha the persos to be elected. If a voter ca vote i 5 ways, the the umber of cadidates is (a) 7 (b) 0 (c) 8 (d) If C C, the (a) (b) (c) 5 (d) 59. I a electio there are 5 cadidates ad three vacacies. A voter ca vote maximum to three cadidates, the i how may ways ca he vote (a) 5 (b) 0 (c) 0 (d) 5 0. Six + ad four sigs are to be placed i a straight lie so that o two sigs come together, the the total umber of ways are (a) 5 (b) 8 (c) 5 (d). The umber of ways of dividig 5 cards amogst four players equally, are 5! (a) (!) (b) 5! (!)! (c) (!) 5! (d) Noe of these (!). Out of 0 white, 9 black ad 7 red balls, the umber of ways i which selectio of oe or more balls ca be made, is (a) 88 (b) 89 (c) 879 (d) 89

9 A total umber of words which ca be formed out of the letters a, b, c, d, e, f take together such that each word cotais at least oe vowel, is (a) 7 (b) 8 (c) 9 (d) Noe of these. Out of books, i how may ways ca a set of oe or more books be chose (a) (b) (c) (d) 5 5. All possible two factors products are formed from umbers,,,,..., 00. The umber of factors out of the total obtaied which are multiples of 5 is (a) 500 (b) 780 (c) 850 (d) Noe of these. The umbers of permutatios of thigs take r at a time, whe p thigs are always icluded, is (a) p! (b) p r! C r p (c) C r! (d) Noe of these r p C r 7. I a tourig cricket team there are players i all icludig 5 bowlers ad wicketkeepers. How may teams of players from these, ca be chose, so as to iclude three bowlers ad oe wicket-keeper (a) 50 (b) 70 (c) 750 (d) The value of C + r C is r (a) 5 C (b) 5 C (c) 55 C (d) 55 C 9. A studet is to aswer 0 out of questios i a examiatio such that he must choose at least from the first five questio. The umber of choices available to him is (a) 0 (b) 9 (c) 80 (d)

10 70. If C r deotes the umber of combiatios of thigs take r at a time, the the expressio r+ + C r + C r equals C (a) + + Cr (b) r+ C (c) + C (d) + r C r+ 7. A father with 8 childre takes them at a time to the Zoological gardes, as ofte as he ca without takig the same childre together more tha oce. The umber of times he will go to the garde is (a) (b) (c) 5 7. C r ( k ). Cr+ if k (d) Noe of these (a) [, ] (b) (, ) (c), ) ( (d) (, ) 7. The umber of ways i which thirty five apples ca be distributed amog boys so that each ca have ay umber of apples, is (a) (b) (c) (d) Noe of these 7. A perso is permitted to select at least oe ad at most cois from a collectio of ( + ) distict cois. If the total umber of ways i which he ca select cois is 55, the equals a) (b) 8 (c) (d) 75. The umber of ways i which four letters of the word MATHEMATICS ca be arraged is give by (a) (b) 9 (c) 80 (d) 5 7. I how may ways ca 5 red ad white balls be draw from a bag cotaiig 0 red ad 8 white balls (a) C 5 C (b) C 5 C (c) 8 C 9 (d) Noe of these

11 77. A studet is allowed to select at most books from a collectio of ( + ) books. If the total umber of ways i which he ca select oe book is, the the value of is (a) (b) (c) (d) Noe of these 78. Let T deote the umber of triagles which ca be formed usig the vertices of a regular polygo of sides. If T T, the equals (a) 5 (b) 7 (c) (d) The straight lies I, I, I are parallel ad lie i the same plae. A total umber of m poits are take o I, formed with vertices at these poits are m (a) k C poits o I, k poits o I. The maximum umber of triagles C C C C + + (b) m+ + k m k m k (c) C C C + + (d) Noe of these 80. If a polygo has diagoals, the the umber of its sides are (a) 7 (b) (c) 8 d) Noe of these 8. The umber of triagles that ca be formed by choosig the vertices from a set of poits, seve of which lie o the same straight lie, is (a) 85 (b) 75 (c) 5 (d) There are m poits o a straight lie AB ad poits o aother lie AC, oe of them beig the poit A. Triagles are formed from these poits as vertices whe (i) A is excluded (ii) A is icluded. The the ratio of the umber of triagles i the two cases is (a) (c) m + m + m + m + + (b) m + (d) Noe of these 8. The greatest possible umber of poits of itersectio of 8 straight lies ad circles is (a) (b) (c) 7 (d) 0

12 8. There are straight lies i a plae, o two of which are parallel ad o three pass through the same poit. Their poits of itersectio are joied. The the umber of fresh lies thus obtaied is (a) ( )( ) 8 (b) ( )( )( ) (c) ( )( )( ) 8 (d) Noe of these 85. A parallelogram is cut by two sets of m lies parallel to its sides. The umber of parallelograms thus formed is (a) ( C ) m m + (b) ( ) C m + (c) ( ) C (d) Noe of these 8. Out of 8 poits i a plae, o three are i the same straight lie except five poits which are colliear. The umber of (i) straight lies, (ii) triagles which ca be formed by joiig them is (i) (a) 0 (b) (c) (d) (ii) (a) 8 (b) 80 (c) 800 (d) The umber of parallelograms that ca be formed from a set of four parallel lies itersectig aother set of three parallel lies is (a) (b) 8 (c) (d) Out of 0 poits i a plae are i a straight lie. The umber of triagles formed by joiig these poits are (a) 00 (b) 50 (c) 0 (d) Noe of these 89. Out of 0 poits i a plae are i a straight lie. The umber of triagles formed by joiig these poits are (a) 00 (b) 50 (c) 0 (d) Noe of these 90. Give six lie segmets of legths,,, 5,, 7 uits, the umber of triagles that ca be formed by these lies is (a) C 7 (b) C (c) C 5 (d) C

13 9. There is a rectagular sheet of dimesio ( ) m ( ), (where m > 0, > 0). It has bee divided ito square of uit area by drawig lies perpedicular to the sides. Fid umber of rectagles havig sides of odd uit legth m (a) ( m + + ) (b) m ( m + )( + ) m + (c) (d) m 9. The sum m 0 0, i 0 i m i where p 0if p < q, is maximum whe m is q (a) 5 (b) 5 (c) 0 (d) 0 9. If P 80, C 5, the is equal to r r (a) (b) (c) 5 (d) 7 9. The umber of way to sit me ad wome i a bus such that total umber of sitted me ad wome o each side is (a) 5! (b) C 5! 5 (c)! P5 (d) 5! + C A -digit umber is a positive umber with exactly digits. Nie hudred distict - digit umbers are to be formed usig oly the three digits, 5 ad 7. The smallest value of for which this is possible is (a) (b) 7 (c) 8 (d) 9 9. Number of ways of selectio of 8 letters from letters of which 8 are a, 8 are b ad the rest ulike, is give by 7 8 (a) (b) 8. 7 (c) 0. (d) Noe of these

14 97. A set cotais ( + ) elemets. The umber of sub-sets of the set which cotai at most elemets is (a) (b) + (c) (d) 98. The umber of umbers of digits which are ot divisible by 5 are (a) 700 (b) 00 (c) 00 (d) The umber of ordered triplets of positive itegers which are solutios of the equatio x + y + z 00 is (a) 005 (b) 85 (c) 508 (d) Noe of these 00. The umber of divisors of 900 icludig ad 900 are (a) 0 (b) 58 (c) 8 (d) PERMUTATIONS AND COMBINATIONS HINTS AND SOLUTIONS. (c) Required umber of ways are 5.. (b) Total umber of arragemets of books!. If two specified books always together the umber of ways ( )! Hece required umber of ways! ( )! ( )! ( ) ( )! ( ).. (d) Required umber of ways are 0 0, because every questio may be aswered i ways.. (a) The ma ca go i 5 ways ad he ca retur i 5 ways. Hece, total umber of ways are ! 70.!! 5. (a) Required umber of ways 0. (a) cocept

15 7. (a) Sum of the digits i the uit place is ( ) 0 uits. Similarly, sum of digits i te place is 0 tes ad i hudredth place is 0 hudreds etc. Sum of all the umbers is 0( ) (b) The odd digits,,, ca be arraged i the odd places i ways ad eve!!!! digits,, ca be arraged i the three eve places i ways. Hece the required! umber of ways 8 9. (a) Cocept 0. (a) C r + Cr Cr. Pr r! + Pr ( r )! Pr r! r + r. Pr Pr. P. (b) Numbers greater tha 000 ad less tha or equal to 000 will be of digits ad will have either (except 000) or or i the first place with 0 i each of remaiig places. After fixig st place, the secod place ca be filled by ay of the 5 umbers. Similarly third place ca be filled up i 5 ways ad th place ca be filled up i 5 ways. Thus there will be ways i which will be i first place but this iclude 000 also hece there will be umbers havig i the first place. Similarly 5 for each or. Oe umber will be i which i the first place ad i.e Hece the required umbers are ways. 0!! 8!. (c) A gets, B gets 8; 5 0! 8!! A gets 8, B gets ; (c) Required umber of ways are 5.. (b) CONCEPT 5. (c) Sice the 5 boys ca sit i 5! ways. I this case there are places are vacat i which the girls ca sit i P ways. Therefore required umber of ways are 5! P.. (c) First, we arrage cosoats i! ways ad the at four places (two places betwee them ad two places o two sides) vowels ca be placed i! P ways. P.! Hece the required umber! 7

16 7. (b) must be at thousad place ad sice the umber should be divisible by 5, so 5 must be at uit place. Now we have to filled two place (te ad hudred) i.e., 5! 8. (b) Required umber of ways are 0.! P. 9. (b) Three letters ca be posted i letter boxes i ways but it cosists the ways that all letters may be posted i same box. Hece required ways 0.!.!! 0. (a) Total o. of permutatios 0. (c) Sice there are M's, A's ad T's. Required umber of ways are!.!!!. (a) Number of digit umbers P Number of digit umbers P Number of digit umbers P The required umber of umbers (b) Stadard problem. (b) We have x+ x a Px + ( x )!, b P. x! + ( x )! Ad x c Px x ( )! x! ( x )! Now a 8 bc ( x + )! 8. ( x )! ( x + )! 8 x! ( x + )( x + ) 8 x. 5. (a) cocept.. (d) Without ay restrictio the 0 persos ca be raked amog themselves i 0! ways; but the umber of ways i which A is above A 0 ad the umber of ways i which A 0 is above A make up 0!. Also the umber of ways i which A is above A 0 is exactly same as the umber of ways i which A 0 is above A.. Therefore the required umber of ways (0!) 7. (c) The umbers betwee 999 ad 0000 are of four digit umbers. The four digit umbers formed by digits 0,,,,7,8 are 0 P. But here those umbers are also ivolved which begi from 0. So we take those umbers as three digit umbers.

17 Takig iitial digit 0, the umber of ways to fill remaiig places from five digits 5,,,7,8 are P 0 So the required umbers (c) The uits place ca be filled i ways as ay oe of 0,, or ca be placed there. The remaiig three places ca be filled i with remaiig digits i P 0 way. So, total umber of ways But, this icludes those umbers i which 0 is fixed i 5 extreme left place. Numbers of such umbers P Fix 5 P ways ways (oly, or ) Required umber of ways (c) Out of 7 places, places are odd ad eve. Therefore vowels ca be arraged i eve places i P ways ad remaiig cosoats ca be arraged i odd places i P ways. Hece required o. of ways P P. 0. (c) Words startig with A, C, H, I, N are each equals to 5! Total words 5 5! 00 The first word startig with S is SACHIN. SACHIN appears i dictioary at serial umber 0.. (a) Required umber of arragemets (Total umber of arragemets) (Number of arragemets i which N s are together)! 5! !!!. (c) There are five seats i a bus are vacat. A ma ca sit o ay oe of 5 seats i 5 ways. After the ma is seated, his wife ca be seated i ay of remaiig seats i ways. Hece total umber of ways of seatig them 5 0. (d) 0,,,, 5, 7 : Six digits. The last place ca be filled i by,, 5, 7. i.e., ways as the umber is to be odd. We have to fill i the remaiig places of the digit umber i.e. I, II, III place. Sice repetitio is allowed each place ca be filled i ways. Hece the place ca be filled i ways.

18 But i case of 0 80 ways. Hece by fudametal theorem, the total umber will be (c) Give set of umbers is {,,...} i which 5 are eve six are odd, which demads that i the give product it is ot possible to arrage to subtract oly eve umber from odd umbers. There must be at least oe factor ivolvig subtractio of a odd umber form aother odd umber. So at least oe of the factors is eve. Hece product is always eve. 5. (a) No. of ways i which me ca be arraged at a roud table ( )! Now wome ca be arraged i! ways. Total Number of ways! 5!. (c) Required umber of ways 9!. W M M W W M M W W M W M 7. (a) The umber of ways i which 5 beads of differet colours ca be arraged i a circle to form a ecklace are ( 5 )!!. But the clockwise ad aticlockwise arragemet are ot. Hece the total umber of ways of arragig the beads (!) 8. (b) Fix up ma ad the remaiig me ca be seated i! ways. Now o two wome are to sit together ad as such the 7 wome are to be arraged i seve empty seats betwee two cosecutive me ad umber of arragemet will be 7!. Hece by fudametal theorem the total umber of ways 7!!. 9. (d) A garlad ca be made from 0 flowers i (9!) ways. 0. (b) Sice total umber of ways i which boys ca occupy ay place is ( 5 )!! ad the 5 girls ca be sit accordigly i 5! ways. Hece required umber of ways are! 5!.. (a) 8 differet beads ca be arraged i circular form i (8 )! 7! ways. Sice there is o distictio betweethe clockwise ad aticlockwise arragemet. So the required umber of 7! arragemets 50.. (d) It is obvious by fudametal property of circular permutatios.

19 (a) Fix up a male ad the remaiig male ca be seated i! ways. Now o two female are to sit together ad as such the female are to be arraged i five empty seats betwee two cosecutive male ad umber of arragemet will be 5 P. Hece by fudametal theorem the total umber of ways is! 5 P 0 80 ways.. (a) It is a fudametal property 5. (c) Required umber of ways 7 7. {Sice the case that o fried be ivited i.e., 7 C 0 is excluded}.. (c) Here Cr Cr 8 ad C C r r+ 8. 0r ad 0r O solvig, we get 9, r. 7. (b) C ( ). 8. (a) It is obvious. 9. (b) ()! ( )!.!! ( )!! ()( )( ) ( ) ( ) Now 5 C r C C r or (a) C r Cr+ C5 r Cr+ 5 r r + r. C r, (c) Required umber of ways C + C + C + C + C (c) We have places for teeth. For each place we have two choices either there is a tooth or there is o tooth. Therefore the umber of ways to fill up these places is. As there is o perso without a tooth, the maximum populatio is (d) The letters ca be select i C C ways. 5 Therefore the umber of arragemets are ( C ) 5! 5. (b) Total umber of hadshakes 5 C. ( ) 55. (b) C C.

20 5. (b) r r ad r r r r ( r + ) Or 9r + 9 r or r. So, (c) Let there are cadidates the. C + C C (c) C. C ( + )!!.!.( )!!.( )! ! (d) A voter ca vote i C + C + C 5 ways.! 0. (c) The arragemet ca be make as i. e., the ( ) sigs ca be put i 7 vacat (poited) place. 7 Hece required umber of ways 5. (a) Required umber of ways 5 9 C C C 5! 9!!! 5!. 9!!!!!!! (!) C C.. (c) The required umber of ways are ( 0 + )(9 + )(7 + ) (c) The required umber of words is ( C C + C C )! 9.. (b) Required umber of ways C + C + C + C + C + C (b) The total umber of two factor products 00 C. The umber of umbers from to 00 which are ot multiples of 5 is 0. Therefore total umber of two factor products which are ot multiple of 5 is 0 C. Hece the required umber of factors 00 0 C C

21 p. (c) Sice umber of selectios are. Therefore the arragemet of r thigs ca be doe i Cr p p r!ways. Hece the total permutatios are C r! 7. (b) Required umber of ways 5 9 C C C (b) C ( C + C + C +... C ) r p +. Takig first two terms together ad addig them ad followig the same patter, we get 9. (b) As for give questio two cases are possible. 70. (b) Expressio C r+ + Cr + Cr + Cr C r Cr + Cr Cr+ Cr + + C r C, [ As C + C C ]. r r r 7. (c) The umber of times he will go to the garde is same as the umber of selectig childre from 8. 8 Therefore the required umber 5 C. 7. (d) We have ( )! ( k )!, 0 r ( r )! r! ( r )!( r + )! r + r + k +, k,, + k, + +, ; (b) The required umber C C 7. (a) Sice the perso is allowed to select at most cois out of ( + ) cois, therefore i order to select oe, two, three,., cois. Thus, if T is the total umber of ways of selectig oe coi, the T C + C C 55..(i) Agai the sum of biomial coefficiets + C C + + C C + + C+ + ( C 0 + C + C C ) + C... + C ( ) C ( T) + + T

22 75. (d) Word MATHEMATICS has M, T, A, H, E, I, C, S. Therefore letters ca be chose i the followig ways. Case I: alike of oe kid ad alike of secod kid.e. Case II: alike of oe kid ad differet i.e., 7 7! C C No. of words C C 75! Case III :All are differet i.e., 8 C No. of words 8! (b) Required umber C 5 C C.. i, C No. of words C (b) Sice the studet is allowed to select at most books out of ( + ) books, therefore i order to select oe book he has the choice to select oe, two, three,..., books.!!! Thus, if T is the total umber of ways of selectig oe book the T C + C C..(i) Agai the sum of biomial coefficiets + C0 + + C + + C C + + C+ + C... + C ( ) Or + C 0 + ( + C + + C C ) + + C + + T + T + + ( ) (b) Clearly, C T. + So, C C. + C + C ) C C ( or ( ) m (b) Total umber of poits are m + + k, the ' s formed by these poits k C Joiig poits o the same lie gives o triagle, such ' s are m C + C k + C m + k m k Required umber C C C C 80. (b) Sice C (a) Required umber of ways C C

23 8. (a) Case I: Whe A is excluded. Number of triagles selectio of poits from AB ad oe poit from AC + selectio of oe poit from AB ad two poits from AC m m C C + C C ( m + ) m..(i) Case II: Whe A is icluded. The triagles with oe vertex at A selectio of oe poit from AB ad oe poit from AC m. Number of triagles m + m ( m + ) m ( m + ) Required ratio..(ii) ( m + ). ( m + ) 8. (d) The required umber of poits 8 8 ( C ) C + C + C (c) Sice o two lies are parallel ad o three are cocurret, therefore straight lies itersect at C N (say) poits. Sice two poits are required to determie a straight lie, N therefore the total umber of lies obtaied by joiig N poits C. But i this each old lie has bee couted C times, sice o each old lie there will be poits of itersectio made by the remaiig ( ) lies. Hece the required umber of fresh lies is N C. C N( N ) ( )( ) C ( C ) ( )( ) ( )( )( ) (c) Each set is havig m + parallel lies ad each parallelogram is formed by choosig two straight lies from the first set ad two straight lies from the secod set. Two straight lies m + from the first set ca be chose i C ways ad two straight lies from the secod set ca m + be chose i C ways. m + m+ m + Hece the total umber of parallelograms formed C. C ( C ).

24 8. (c,b) 8 poits, 5 colliear : 8 5 (i) Number of lies C C ' 8 5 (ii) Number of C C s. 87. (b) Required umber of ways C (a) Number of triagles C (d) Required umber C C (b) No. of triagles C. C. C (d) Alog horizotal side oe uit ca be take i (m ) ways ad uit side ca be take i m ways. The umber of ways of selectig a side horizotally is ( m + m + m ) Similarly the umber of ways alog vertical side is ( ) m. 9. (b) Total umber of rectagles Pr 9. (d) r! r C 9. (b) r C 5 7. me ad wome equal to 5. A group of 5 members make 5! permutatio with each other. The umber of ways to sit 5 members 5! Places are filled by 5 members by C 5 ways The total umber of ways to sit 5 members o seats of a bus 5! C. 95. (b) Sice at ay place, ay of the digits, 5 ad 7 ca be used, total umber of such positive - digit umbers are. Sice we have to form 900 distict umbers, hece (c) The umber of selectios coefficiet of x i ( + x + x x )( + x + x x ).( + x)

25 97. (d) The umber of sub-sets of the set which cotai at most elemets is + + C0 + + C C S (Say) The S ( C + C C ) ( C 0 + C+ ) + ( C + C) ( C + C+ ) C 0 + C C+ S. 98. (a) The total umber of digits are The umbers of digits umber divisible by 5 are Hece required umber of ways are (b) The umber of triplets of positive itegers which are solutios of + y + z Coefficiet of x i ( x + x + x +...) x (c) Sice Hece, umber of divisors ( 7 + )( + )( + ) 8.

PERMUTATION AND COMBINATION

PERMUTATION AND COMBINATION MPC 1 PERMUTATION AND COMBINATION Syllabus : Fudametal priciples of coutig; Permutatio as a arragemet ad combiatio as selectio, Meaig of P(, r) ad C(, r). Simple applicatios. Permutatios are arragemets

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS 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

More information

CS3203 #5. 6/9/04 Janak J Parekh

CS3203 #5. 6/9/04 Janak J Parekh CS3203 #5 6/9/04 Jaak J Parekh Admiistrivia Exam o Moday All slides should be up We ll try ad have solutios for HWs #1 ad #2 out by Friday I kow the HW is due o the same day; ot much I ca do, uless you

More information

8. Combinatorial Structures

8. Combinatorial Structures Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 8. Combiatorial Structures The purpose of this sectio is to study several combiatorial structures that are of basic importace i probability. Permutatios

More information

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters?

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters? COMBINATORICS EXERCISES Stepha Wager 1. How may possible ways are there to form five-letter words usig oly the letters A H? How may such words cosist of five distict letters? 2. How may differet umber

More information

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule Chapter 3 Combiatorics 3.1 Permutatios Readig questios 1. Defie what a permutatio is i your ow words. 2. What is a fixed poit i a permutatio? 3. What do we assume about mutual disjoitedess whe creatig

More information

AS Exercise A: The multiplication principle. Probability using permutations and combinations. Multiplication principle. Example.

AS Exercise A: The multiplication principle. Probability using permutations and combinations. Multiplication principle. Example. Probability usig permutatios ad combiatios Multiplicatio priciple If A ca be doe i ways, ad B ca be doe i m ways, the A followed by B ca be doe i m ways. 1. A die ad a coi are throw together. How may results

More information

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1 1. [5] Give sets A ad B, each of cardiality 1, how may fuctios map A i a oe-tooe fashio oto B? 2. [5] a. Give the set of r symbols { a 1, a 2,..., a r }, how may differet strigs of legth 1 exist? [5]b.

More information

2. There are n letter and n addressed envelopes. The probability that all the letters are not kept in the right envelope, is. (c)

2. There are n letter and n addressed envelopes. The probability that all the letters are not kept in the right envelope, is. (c) PAGE # CHAPTER EXERCISE I. A sigle letter is selected at radom from the word PROBABILITY. The probability that the selected letter is a vowel is / / / 0. There are letter ad addressed evelopes. The probability

More information

Ch 9 Sequences, Series, and Probability

Ch 9 Sequences, Series, and Probability Ch 9 Sequeces, Series, ad Probability Have you ever bee to a casio ad played blackjack? It is the oly game i the casio that you ca wi based o the Law of large umbers. I the early 1990s a group of math

More information

We often find the probability of an event by counting the number of elements in a simple sample space.

We often find the probability of an event by counting the number of elements in a simple sample space. outig Methods We ofte fid the probability of a evet by coutig the umber of elemets i a simple sample space. Basic methods of coutig are: Permutatios ombiatios Permutatio A arragemet of objects i a defiite

More information

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home COMBINATORICS BEGINNER CIRCLE 1/0/013 1. ADVANCE TAXICABS Recall, i the previous lesso, we looked at Taxicabs machies, which always took the shortest path home taxipath We couted the umber of ways that

More information

Counting and Probability CMSC 250

Counting and Probability CMSC 250 Coutig ad Probabilit CMSC 50 1 Coutig Coutig elemets i a list: how ma itegers i the list from 1 to 10? how ma itegers i the list from m to? assumig m CMSC 50 How Ma i a List? How ma positive three-digit

More information

Logarithms APPENDIX IV. 265 Appendix

Logarithms APPENDIX IV. 265 Appendix APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult

More information

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division Master 1.22 Extra Practice 1 Lesso 1.1: Patters i Divisio 1. Which umbers are divisible by 4? By 5? How do you kow? a) 90 b) 134 c) 395 d) 1724 e) 30 f) 560 g) 3015 h) 74 i) 748 2. Write a 5-digit umber

More information

Counting on r-fibonacci Numbers

Counting on r-fibonacci Numbers Claremot Colleges Scholarship @ Claremot All HMC Faculty Publicatios ad Research HMC Faculty Scholarship 5-1-2015 Coutig o r-fiboacci Numbers Arthur Bejami Harvey Mudd College Curtis Heberle Harvey Mudd

More information

7. Counting Measure. Definitions and Basic Properties

7. Counting Measure. Definitions and Basic Properties Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 7. Coutig Measure Defiitios ad Basic Properties Suppose that S is a fiite set. If A S the the cardiality of A is the umber of elemets i A, ad is

More information

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS Sectio 6.5: Combiatios Example Recall our five frieds, Ala, Cassie, Maggie, Seth ad Roger from the example at the begiig of the previous sectio. The have wo tickets for a cocert i Chicago ad everybody

More information

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction THE LUCAS TRIANLE RECOUNTED Arthur T Bejami Dept of Mathematics, Harvey Mudd College, Claremot, CA 91711 bejami@hmcedu 1 Itroductio I 2], Neville Robbis explores may properties of the Lucas triagle, a

More information

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS Sectio 6.5: Combiatios Example Recall our five frieds, Ala, Cassie, Maggie, Seth ad Roger from the example at the begiig of the previous sectio. The have wo tickets for a cocert i Chicago ad everybody

More information

Permutation Enumeration

Permutation Enumeration RMT 2012 Power Roud Rubric February 18, 2012 Permutatio Eumeratio 1 (a List all permutatios of {1, 2, 3} (b Give a expressio for the umber of permutatios of {1, 2, 3,, } i terms of Compute the umber for

More information

Combinatorics. ChaPTer a The addition and multiplication principles introduction. The addition principle

Combinatorics. ChaPTer a The addition and multiplication principles introduction. The addition principle ChaPTer Combiatorics ChaPTer CoTeTS a The additio ad multiplicatio priciples b Permutatios C Factorials D Permutatios usig P r e Permutatios ivolvig restrictios F Arragemets i a circle G Combiatios usig

More information

COLLEGE ALGEBRA LECTURES Copyrights and Author: Kevin Pinegar

COLLEGE ALGEBRA LECTURES Copyrights and Author: Kevin Pinegar OLLEGE ALGEBRA LETURES opyrights ad Author: Kevi iegar 8.3 Advaced outig Techiques: ermutatios Ad ombiatios Factorial Notatio Before we ca discuss permutatio ad combiatio formulas we must itroduce factorial

More information

HIGHER SECONDARY FIRST YEAR MATHEMATICS. ALGEBRA Creative Questions Time : 1.15 Hrs Marks : 45 Part - I Choose the correct answer 10 1 = 10.

HIGHER SECONDARY FIRST YEAR MATHEMATICS. ALGEBRA Creative Questions Time : 1.15 Hrs Marks : 45 Part - I Choose the correct answer 10 1 = 10. www.tbtpsc.com HIGHER SEONDARY FIRST YEAR MATHEMATIS ALGEBRA eative Questios Time :. Hs Maks : Pat - I hoose the coect aswe =. The co-efficiet of middle tem i the epasio of is a) b)...( )! c).6,...( )

More information

Unit 5: Estimating with Confidence

Unit 5: Estimating with Confidence Uit 5: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Uit 5 Estimatig with Cofidece 8.1 8.2 8.3 Cofidece Itervals: The Basics Estimatig a Populatio

More information

Math 7 Flipped Mastery Self Tester Worksheet Name: Class:. Chapter 1 (Unit 1) Patterns and Relationships - Accommodated 1.1 Patterns In Division /36

Math 7 Flipped Mastery Self Tester Worksheet Name: Class:. Chapter 1 (Unit 1) Patterns and Relationships - Accommodated 1.1 Patterns In Division /36 Chapter 1 (Uit 1) Patters ad Relatioships - Accommodated 1.1 Patters I Divisio /36 Divisibility Rule Cheats; A whole umber is divisible by 2 if it is a eve umber A whole umber is divisible by 4 if the

More information

x y z HD(x, y) + HD(y, z) HD(x, z)

x y z HD(x, y) + HD(y, z) HD(x, z) Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece 6.02 Solutios to Chapter 5 Updated: February 16, 2012 Please sed iformatio about errors or omissios to hari; questios

More information

Counting III. Today we ll briefly review some facts you dervied in recitation on Friday and then turn to some applications of counting.

Counting III. Today we ll briefly review some facts you dervied in recitation on Friday and then turn to some applications of counting. 6.04/18.06J Mathematics for Computer Sciece April 5, 005 Srii Devadas ad Eric Lehma Lecture Notes Coutig III Today we ll briefly review some facts you dervied i recitatio o Friday ad the tur to some applicatios

More information

x 1 + x x n n = x 1 x 2 + x x n n = x 2 x 3 + x x n n = x 3 x 5 + x x n = x n

x 1 + x x n n = x 1 x 2 + x x n n = x 2 x 3 + x x n n = x 3 x 5 + x x n = x n Sectio 6 7A Samplig Distributio of the Sample Meas To Create a Samplig Distributio of the Sample Meas take every possible sample of size from the distributio of x values ad the fid the mea of each sample

More information

A Math Learning Center publication adapted and arranged by. EUGENE MAIER and LARRY LINNEN

A Math Learning Center publication adapted and arranged by. EUGENE MAIER and LARRY LINNEN A Math Learig Ceter publicatio adapted ad arraged by EUGENE MAIER ad LARRY LINNEN ALGEBRA THROUGH VISUAL PATTERNS, VOLUME 1 A Math Learig Ceter Resource Copyright 2005, 2004 by The Math Learig Ceter, PO

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12 EECS 70 Discrete Mathematics ad Probability Theory Sprig 204 Aat Sahai Note 2 Probability Examples Based o Coutig We will ow look at examples of radom experimets ad their correspodig sample spaces, alog

More information

Grade 6 Math Review Unit 3(Chapter 1) Answer Key

Grade 6 Math Review Unit 3(Chapter 1) Answer Key Grade 6 Math Review Uit (Chapter 1) Aswer Key 1. A) A pottery makig class charges a registratio fee of $25.00. For each item of pottery you make you pay a additioal $5.00. Write a expressio to represet

More information

Lecture 4: Frequency Reuse Concepts

Lecture 4: Frequency Reuse Concepts EE 499: Wireless & Mobile Commuicatios (8) Lecture 4: Frequecy euse Cocepts Distace betwee Co-Chael Cell Ceters Kowig the relatio betwee,, ad, we ca easily fid distace betwee the ceter poits of two co

More information

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73,

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73, CS 01 Schlag Jauary 6, 1999 Witer `99 CS 01: Adversary argumets This hadout presets two lower bouds for selectio problems usig adversary argumets ëku73, HS78, FG76ë. I these proofs a imagiary adversary

More information

The Institute of Chartered Accountants of Sri Lanka

The Institute of Chartered Accountants of Sri Lanka The Istitute of Chartered Accoutats of Sri Laka Postgraduate Diploma i Busiess ad Fiace Quatitative Techiques for Busiess Hadout 02:Presetatio ad Aalysis of data Presetatio of Data The Stem ad Leaf Display

More information

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress. H2 Mathematics Pure Mathematics Sectio A Comprehesive Checklist of Cocepts ad Skills by Mr Wee We Shih Visit: weshih.wordpress.com Updated: Ja 2010 Syllabus topic 1: Fuctios ad graphs 1.1 Checklist o Fuctios

More information

Final exam PS 30 December 2009

Final exam PS 30 December 2009 Fial exam PS 30 December 2009 Name: UID: TA ad sectio umber: This is a closed book exam. The oly thig you ca take ito this exam is yourself ad writig istrumets. Everythig you write should be your ow work.

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS 8 PERMUTATIONS AND COMBINATIONS FUNDAMENTAL PRINCIPLE OF COUNTING Multiplication Principle : If an operation can be performed in 'm' different ways; following which a second operation can be performed

More information

THE CONTEST CORNER No. 65 John McLoughlin

THE CONTEST CORNER No. 65 John McLoughlin THE CONTEST CORNER /185 THE CONTEST CORNER No. 65 Joh McLoughli The problems featured i this sectio have appeared i, or have bee ispired by, a mathematics cotest questio at either the high school or the

More information

Chapter (6) Discrete Probability Distributions Examples

Chapter (6) Discrete Probability Distributions Examples hapter () Discrete robability Distributios Eamples Eample () Two balaced dice are rolled. Let X be the sum of the two dice. Obtai the probability distributio of X. Solutio Whe the two balaced dice are

More information

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 2303-4874 (p), ISSN (o) 2303-4955 www.imvibl.org/bulletin Vol. 3(2013), 149-154 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

More information

On the Number of Permutations on n Objects with. greatest cycle length

On the Number of Permutations on n Objects with. greatest cycle length Ž. ADVANCES IN APPLIED MATHEMATICS 0, 9807 998 ARTICLE NO. AM970567 O the Number of Permutatios o Obects with Greatest Cycle Legth k Solomo W. Golomb ad Peter Gaal Commuicatio Scieces Istitute, Uiersity

More information

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013 Available olie at www.sciecedirect.com ScieceDirect Procedia - Social ad Behavioral Scieces 18 ( 014 ) 399 405 EPC-TKS 013 Iductive derivatio of formulae by a computer Sava Grozdev a *, Veseli Nekov b

More information

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS A SELETIVE POINTE FOWADING STATEGY FO LOATION TAKING IN PESONAL OUNIATION SYSTES Seo G. hag ad hae Y. Lee Departmet of Idustrial Egieerig, KAIST 373-, Kusug-Dog, Taejo, Korea, 305-70 cylee@heuristic.kaist.ac.kr

More information

Math 140 Introductory Statistics

Math 140 Introductory Statistics 6. Probability Distributio from Data Math Itroductory Statistics Professor Silvia Ferádez Chapter 6 Based o the book Statistics i Actio by A. Watkis, R. Scheaffer, ad G. Cobb. We have three ways of specifyig

More information

Intermediate Information Structures

Intermediate Information Structures Modified from Maria s lectures CPSC 335 Itermediate Iformatio Structures LECTURE 11 Compressio ad Huffma Codig Jo Roke Computer Sciece Uiversity of Calgary Caada Lecture Overview Codes ad Optimal Codes

More information

X-Bar and S-Squared Charts

X-Bar and S-Squared Charts STATGRAPHICS Rev. 7/4/009 X-Bar ad S-Squared Charts Summary The X-Bar ad S-Squared Charts procedure creates cotrol charts for a sigle umeric variable where the data have bee collected i subgroups. It creates

More information

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 95 CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 5.1 GENERAL Ru-legth codig is a lossless image compressio techique, which produces modest compressio ratios. Oe way of icreasig the compressio ratio of a ru-legth

More information

lecture notes September 2, Sequential Choice

lecture notes September 2, Sequential Choice 18.310 lecture otes September 2, 2013 Sequetial Choice Lecturer: Michel Goemas 1 A game Cosider the followig game. I have 100 blak cards. I write dow 100 differet umbers o the cards; I ca choose ay umbers

More information

VIII. Shell-Voicings

VIII. Shell-Voicings VIII. Shell-Voicigs A. The Cocept The 5th (ad ofte the root as well) ca be omitted from most 7th-chords. Ratioale: Most chords have perfect 5ths. The P5th is also preset as the rd partial i the overtoe

More information

LEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together?

LEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together? LEVEL I 1. Three numbers are chosen from 1,, 3..., n. In how many ways can the numbers be chosen such that either maximum of these numbers is s or minimum of these numbers is r (r < s)?. Six candidates

More information

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS APPLICATION NOTE AN95091 INTRODUCTION UNDERSTANDING EFFECTIVE BITS Toy Girard, Sigatec, Desig ad Applicatios Egieer Oe criteria ofte used to evaluate a Aalog to Digital Coverter (ADC) or data acquisitio

More information

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains 7 Figerprit Classificatio Based o Directioal Image Costructed Usig Wavelet Trasform Domais Musa Mohd Mokji, Syed Abd. Rahma Syed Abu Bakar, Zuwairie Ibrahim 3 Departmet of Microelectroic ad Computer Egieerig

More information

Optimal Arrangement of Buoys Observable by Means of Radar

Optimal Arrangement of Buoys Observable by Means of Radar Optimal Arragemet of Buoys Observable by Meas of Radar TOMASZ PRACZYK Istitute of Naval Weapo ad Computer Sciece Polish Naval Academy Śmidowicza 69, 8-03 Gdyia POLAND t.praczy@amw.gdyia.pl Abstract: -

More information

arxiv: v2 [math.co] 15 Oct 2018

arxiv: v2 [math.co] 15 Oct 2018 THE 21 CARD TRICK AND IT GENERALIZATION DIBYAJYOTI DEB arxiv:1809.04072v2 [math.co] 15 Oct 2018 Abstract. The 21 card trick is well kow. It was recetly show i a episode of the popular YouTube chael Numberphile.

More information

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing 206 3 rd Iteratioal Coferece o Mechaical, Idustrial, ad Maufacturig Egieerig (MIME 206) ISBN: 978--60595-33-7 Applicatio of Improved Geetic Algorithm to Two-side Assembly Lie Balacig Ximi Zhag, Qia Wag,

More information

3. Error Correcting Codes

3. Error Correcting Codes 3. Error Correctig Codes Refereces V. Bhargava, Forward Error Correctio Schemes for Digital Commuicatios, IEEE Commuicatios Magazie, Vol 21 No1 11 19, Jauary 1983 Mischa Schwartz, Iformatio Trasmissio

More information

You Think You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU

You Think You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU You Thik You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU Itroductio. My life, like that of ay other s, has its share of problems. I cosider myself fortuate, however, to have more

More information

Circular waveguides. Introduction. Table of Contents

Circular waveguides. Introduction. Table of Contents Itroductio Circular waveguides Waveguides ca be simply described as metal pipes. Depedig o their cross sectio there are rectagular waveguides (described i separate tutorial) ad circular waveguides, which

More information

Wavelet Transform. CSEP 590 Data Compression Autumn Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)

Wavelet Transform. CSEP 590 Data Compression Autumn Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual) Wavelet Trasform CSEP 59 Data Compressio Autum 7 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter low pass filter

More information

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series Roberto s Notes o Ifiite Series Chapter : Series Sectio Ifiite series What you eed to ow already: What sequeces are. Basic termiology ad otatio for sequeces. What you ca lear here: What a ifiite series

More information

MDM 4U MATH OF DATA MANAGEMENT FINAL EXAMINATION

MDM 4U MATH OF DATA MANAGEMENT FINAL EXAMINATION Caadia Iteratioal Matriculatio rogramme Suway Uiversity College MDM 4U MTH OF DT MNGEMENT FINL EXMINTION Date: November 28 th, 2006 Time: 11.30a.m 1.30p.m Legth: 2 HOURS Lecturers: lease circle your teacher

More information

13 Legislative Bargaining

13 Legislative Bargaining 1 Legislative Bargaiig Oe of the most popular legislative models is a model due to Baro & Ferejoh (1989). The model has bee used i applicatios where the role of committees have bee studies, how the legislative

More information

CHAPTER - 7 PERMUTATIONS AND COMBINATIONS KEY POINTS When a job (task) is performed in different ways then each way is called the permutation. Fundamental Principle of Counting : If a job can be performed

More information

GENERALIZED FORM OF A 4X4 STRONGLY MAGIC SQUARE

GENERALIZED FORM OF A 4X4 STRONGLY MAGIC SQUARE IJMMS, Vol. 1, No. Geeralized 1, (Jauary-Jue Form 016):87-9 of A 4x4 Strogly Magic Square Serials Publicatios 87 ISSN: 0973-339 GENERALIZED FORM OF A 4X4 STRONGLY MAGIC SQUARE Neeradha. C. K, ad Dr. V.

More information

Combinatorics and probability

Combinatorics and probability Departmet of Mathematics Ma 3/03 KC Border Itroductio to Probability ad Statistics Witer 208 Lecture 3: Combiatorics ad probability Relevat textboo passages: Pitma [2]: Sectios.5.6, pp. 7 77; Appedix,

More information

EMCdownload. Acknowledgements. Fair use

EMCdownload. Acknowledgements. Fair use EMC_Sulight.idd 1 28/03/2013 09:06 Ackowledgemets Writte by Aa Sarchet, with Kate Oliver Edited by Kate Oliver Frot cover: Rebecca Scambler, 2013 Published by The Eglish ad Media Cetre, 2013 for EMCdowload.co.uk

More information

E X P E R I M E N T 13

E X P E R I M E N T 13 E X P E R I M E N T 13 Stadig Waves o a Strig Produced by the Physics Staff at Colli College Copyright Colli College Physics Departmet. All Rights Reserved. Uiversity Physics, Exp 13: Stadig Waves o a

More information

PROJECT #2 GENERIC ROBOT SIMULATOR

PROJECT #2 GENERIC ROBOT SIMULATOR Uiversity of Missouri-Columbia Departmet of Electrical ad Computer Egieerig ECE 7330 Itroductio to Mechatroics ad Robotic Visio Fall, 2010 PROJECT #2 GENERIC ROBOT SIMULATOR Luis Alberto Rivera Estrada

More information

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani Shufflig Cards Utrecht Uiversity Mathematics Bachelor s Thesis D.J.W. Telkamp Supervised by Dr. K. Dajai Jue 3, 207 Cotets Itroductio 2 2 Prerequisites 2 2. Problems with the variatio distace................

More information

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen Slide 1 of 18 Data Miig the Olie Ecyclopedia of Iteger Sequeces for New Idetities Hieu Nguye Rowa Uiversity MAA-NJ Sectio Sprig Meetig March 31, 2012 2 MAA-NJ Sprig Meetig Data Miig OEIS.b ü Ackowledgemets

More information

MEI Core 2. Logarithms and exponentials. Section 2: Modelling curves using logarithms. Modelling curves of the form y kx

MEI Core 2. Logarithms and exponentials. Section 2: Modelling curves using logarithms. Modelling curves of the form y kx MEI Core 2 Logarithms ad eoetials Sectio 2: Modellig curves usig logarithms Notes ad Eamles These otes cotai subsectios o: Modellig curves of the form y = k Modellig curves of the form y = ka Modellig

More information

4. INTERSYMBOL INTERFERENCE

4. INTERSYMBOL INTERFERENCE DATA COMMUNICATIONS 59 4. INTERSYMBOL INTERFERENCE 4.1 OBJECT The effects of restricted badwidth i basebad data trasmissio will be studied. Measuremets relative to itersymbol iterferece, usig the eye patter

More information

High Speed Area Efficient Modulo 2 1

High Speed Area Efficient Modulo 2 1 High Speed Area Efficiet Modulo 2 1 1-Soali Sigh (PG Scholar VLSI, RKDF Ist Bhopal M.P) 2- Mr. Maish Trivedi (HOD EC Departmet, RKDF Ist Bhopal M.P) Adder Abstract Modular adder is oe of the key compoets

More information

General Model :Algorithms in the Real World. Applications. Block Codes

General Model :Algorithms in the Real World. Applications. Block Codes Geeral Model 5-853:Algorithms i the Real World Error Correctig Codes I Overview Hammig Codes Liear Codes 5-853 Page message (m) coder codeword (c) oisy chael decoder codeword (c ) message or error Errors

More information

15 min/ Fall in New England

15 min/ Fall in New England 5 mi/ 0+ -4 Fall i New Eglad Before witer makes its appearace, a particularly warm fall bathes the forest i a golde shimmer. Durig the Idia Summer, New Eglad blossoms oe last time. Treetops are ablaze

More information

RECOMMENDATION ITU-R P Propagation by diffraction

RECOMMENDATION ITU-R P Propagation by diffraction Rec. ITU-R P.- 1 RECOMMENDATION ITU-R P.- Propagatio by diffractio (Questio ITU-R / The ITU Radiocommuicatio Assembly, (1-1-1-1-1-1-1-1- cosiderig a that there is a eed to provide egieerig iformatio for

More information

Table Of Contents Blues Turnarounds

Table Of Contents Blues Turnarounds Table Of Cotets Blues Turarouds Turaroud #1 Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Blues Turarouds Blues Soloig Masterclass Week 1 Steve Stie A Blues Turaroud

More information

CHAPTER 8 JOINT PAPR REDUCTION AND ICI CANCELLATION IN OFDM SYSTEMS

CHAPTER 8 JOINT PAPR REDUCTION AND ICI CANCELLATION IN OFDM SYSTEMS CHAPTER 8 JOIT PAPR REDUCTIO AD ICI CACELLATIO I OFDM SYSTEMS Itercarrier Iterferece (ICI) is aother major issue i implemetig a OFDM system. As discussed i chapter 3, the OFDM subcarriers are arrowbad

More information

A generalization of Eulerian numbers via rook placements

A generalization of Eulerian numbers via rook placements A geeralizatio of Euleria umbers via rook placemets Esther Baaia Steve Butler Christopher Cox Jeffrey Davis Jacob Ladgraf Scarlitte Poce Abstract We cosider a geeralizatio of Euleria umbers which cout

More information

Chapter 2: Probability

Chapter 2: Probability hapter : roaility A {FF}, B {MM}, {MF, FM, MM} The, A B 0/, B {MM}, B {MF, FM}, A B {FF,MM}, A, B a A B A B c A B d A B A B 4 a 8 hapter : roaility 9 5 a A B A B A B B A A B A B B A B B B A A c A B A B

More information

202 Chapter 9 n Go Bot. Hint

202 Chapter 9 n Go Bot. Hint Chapter 9 Go Bot Now it s time to put everythig you have leared so far i this book to good use. I this chapter you will lear how to create your first robotic project, the Go Bot, a four-wheeled robot.

More information

Sampling Distribution Theory

Sampling Distribution Theory Poulatio ad amle: amlig Distributio Theory. A oulatio is a well-defied grou of idividuals whose characteristics are to be studied. Poulatios may be fiite or ifiite. (a) Fiite Poulatio: A oulatio is said

More information

Summary of Random Variable Concepts April 19, 2000

Summary of Random Variable Concepts April 19, 2000 Summary of Radom Variable Cocepts April 9, 2000 his is a list of importat cocepts we have covered, rather tha a review that derives or explais them. he first ad primary viewpoit: A radom process is a idexed

More information

POWERS OF 3RD ORDER MAGIC SQUARES

POWERS OF 3RD ORDER MAGIC SQUARES Fuzzy Sets, Rough Sets ad Multivalued Operatios ad Applicatios, Vol. 4, No. 1, (Jauary-Jue 01): 37 43 Iteratioal Sciece Press POWERS OF 3RD ORDER MAGIC SQUARES Sreerajii K.S. 1 ad V. Madhukar Mallayya

More information

Solutions to Exercises on Page 86

Solutions to Exercises on Page 86 Solutions to Exercises on Page 86 #. A number is a multiple of, 4, 5 and 6 if and only if it is a multiple of the greatest common multiple of, 4, 5 and 6. The greatest common multiple of, 4, 5 and 6 is

More information

Introduction to Wireless Communication Systems ECE 476/ECE 501C/CS 513 Winter 2003

Introduction to Wireless Communication Systems ECE 476/ECE 501C/CS 513 Winter 2003 troductio to Wireless Commuicatio ystems ECE 476/ECE 501C/C 513 Witer 2003 eview for Exam #1 March 4, 2003 Exam Details Must follow seatig chart - Posted 30 miutes before exam. Cheatig will be treated

More information

On Parity based Divide and Conquer Recursive Functions

On Parity based Divide and Conquer Recursive Functions O Parity based Divide ad Coquer Recursive Fuctios Sug-Hyu Cha Abstract The parity based divide ad coquer recursio trees are itroduced where the sizes of the tree do ot grow mootoically as grows. These

More information

AQA Level 2 Further mathematics Further algebra. Section 3: Inequalities and indices

AQA Level 2 Further mathematics Further algebra. Section 3: Inequalities and indices AQA Level Further mthemtics Further lgebr Sectio : Iequlities d idices Notes d Emples These otes coti subsectios o Iequlities Lier iequlities Qudrtic iequlities Multiplyig epressios The rules of idices

More information

A study on the efficient compression algorithm of the voice/data integrated multiplexer

A study on the efficient compression algorithm of the voice/data integrated multiplexer A study o the efficiet compressio algorithm of the voice/data itegrated multiplexer Gyou-Yo CHO' ad Dog-Ho CHO' * Dept. of Computer Egieerig. KyiigHee Uiv. Kiheugup Yogiku Kyuggido, KOREA 449-71 PHONE

More information

Western Number Theory Problems, 17 & 19 Dec 2016

Western Number Theory Problems, 17 & 19 Dec 2016 Wester Number Theory Problems, 7 & 9 Dec 6 for distributio prior to 7 (Pacific Grove) meetig Edited by Gerry Myerso based o otes by Kjell Woodig Summary of earlier meetigs & problem sets with old (pre

More information

sible number of wavelengths. The wave~~ngt~ ~ ~ ~ c ~ n b~dwidth is set low eno~gh to interfax One of the most im

sible number of wavelengths. The wave~~ngt~ ~ ~ ~ c ~ n b~dwidth is set low eno~gh to interfax One of the most im sible umber of wavelegths. The wave~~gt~ ~ ~ ~ c ~ b~dwidth is set low eo~gh to iterfax vices. Oe of the most im ed trasmitters ad ysis much more CO "The author is also f Cumputer sciece Departmet, Uiversity

More information

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions 0 TH EDITION COLLEGE ALGEBRA 4. Logarithic Fuctios Logarithic Equatios Logarithic Fuctios Properties of LIAL HORNSBY SCHNEIDER 4. - 4. - The previous sectio dealt with epoetial fuctios of the for y = a

More information

Lecture 29: MOSFET Small-Signal Amplifier Examples.

Lecture 29: MOSFET Small-Signal Amplifier Examples. Whites, EE 30 Lecture 9 Page 1 of 8 Lecture 9: MOSFET Small-Sigal Amplifier Examples. We will illustrate the aalysis of small-sigal MOSFET amplifiers through two examples i this lecture. Example N9.1 (text

More information

Technical Explanation for Counters

Technical Explanation for Counters Techical Explaatio for ers CSM_er_TG_E Itroductio What Is a er? A er is a device that couts the umber of objects or the umber of operatios. It is called a er because it couts the umber of ON/OFF sigals

More information

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM AC 007-7: USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM Josue Njock-Libii, Idiaa Uiversity-Purdue Uiversity-Fort Waye Josué Njock Libii is Associate Professor

More information

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code Proceedigs of the 4th WSEAS It. Coferece o Electromagetics, Wireless ad Optical Commuicatios, Veice, Italy, November 0-, 006 107 A New Space-Repetitio Code Based o Oe Bit Feedback Compared to Alamouti

More information

Zonerich AB-T88. MINI Thermal Printer COMMAND SPECIFICATION. Zonerich Computer Equipments Co.,Ltd MANUAL REVISION EN 1.

Zonerich AB-T88. MINI Thermal Printer COMMAND SPECIFICATION. Zonerich Computer Equipments Co.,Ltd  MANUAL REVISION EN 1. Zoerich AB-T88 MINI Thermal Priter COMMAND SPECIFICATION MANUAL REVISION EN. Zoerich Computer Equipmets Co.,Ltd http://www.zoerich.com Commad List Prit ad lie feed Prit ad carriage retur Trasmissio real-time

More information

Compression Programs. Compression Outline. Multimedia. Lossless vs. Lossy. Encoding/Decoding. Analysis of Algorithms

Compression Programs. Compression Outline. Multimedia. Lossless vs. Lossy. Encoding/Decoding. Analysis of Algorithms Aalysis of Algorithms Compressio Programs File Compressio: Gzip, Bzip Archivers :Arc, Pkzip, Wirar, File Systems: NTFS Piyush Kumar (Lecture 5: Compressio) Welcome to 453 Source: Guy E. Blelloch, Emad,

More information

5 Quick Steps to Social Media Marketing

5 Quick Steps to Social Media Marketing 5 Quick Steps to Social Media Marketig Here's a simple guide to creatig goals, choosig what to post, ad trackig progress with cofidece. May of us dive ito social media marketig with high hopes to watch

More information