THE FUNDAMENTAL COUNTING PRINCIPLES - | The Multiplication Principle or Product Rule : several operations are carried out in a certain order, then the number of ways of performing all the operations is the product of the number of ways of performing each operation, More precisely, if an event can be performed in T successive steps and step 1 can be done Nj ways, step 2 can be done in N) ways, ...... , step T can be done in Nz ways, then the number of different possible events is Nj .N2. Ny |AxB/=|A].|B Ex.J/How many 3 letter words can be made from “WORD?” if no letter is repeated? Soln. ' N3 [ir Ax Bis ‘f product of sets A and B, then D AAA KAR XAA KAA RDODOR RDWDWR O DWDWO 0 RWRWO From the above diagram, the different possibilities are WOR, WOD, WRO, WRD, WDO, WDR OWR, OWD, ORW, ORD, ODW, ODR RWO, RWD, ROW, ROD, RDW, RDO DWO, DWR, DOW, DOR, DRW, DRO -. Required number of 3 letter words =6+6+6+6=24 We can solve the above problem by product rule.as follows. In the required 3 letter word, the first letter can be selected in 4 ways, the second letter can be selected in 3 ways, the third letter can be selected inp ways. Required number of 3 letter words 4x3x2=24 Ans.Ex.2, A house has 4 doors and 8 windows. In how many / ways can be burglar rob the house by entering through 4 window and exiting through a door? Soin. Here there are 8 ways of entering through a window and 4 ways of exiting through a door. Hence by product rule, The total number of ways=8%4=32 | Ans. E w many strings of length 4 can be formed using a letters ABCDE if repetitions are not allowed? Soln, Here we have to form a string of length 4. ‘The first letter can be filled in 5 ways, the second letter can be filled in 4 ways, similarly the third and fourth letters can be filled in 3 and 2 ways respectively. Hence by product rule, The total number of ways =5x4x3x2=120 Ans, Using multiplication principle, slow that a set Wp X29 +n} with n elements has 2” subsets. Soln. Here a subset can be formed in n successive steps. Select or do not selettx), select or do not select Xpynnueey Select or do not select xq. This shows that each step can be done in 2 ways. Hence by multiplication principle, ‘The total number of possible subsets =2%x2x2*...... %2(ntimes = 2") Ans. Ex.S. There are 10 multiple choice questions in an ‘examination. How many sequence of answers are \/ possible, if the first § questions have 4 choices and the next 5 have 5 choices each? Soin, Here each one of the first 5 questions can be answered in 4 ways and each one of the last 5 questions can be answered in 5 ways. Hence by product rule, The total number of possible sequences SAKA AKA RA KS KSKS*SHS = 3200000. ....Ans. / E; 4 How many numbers are there between 100 and 1000 in which all the digits are distinct? Soln, We know that any number between 100 and 1000 has 3 digits. Here we have to find all the possible 3-digit number with distinct digits. Here hundread’s place cannot be filled by 0 (otherwise the number will be2 digit number). So, the hundread’s‘d by any one of the digits ¢ can be fi place can be fille ., 9. Hence hundread’s plac ways. Hence by product rule, Total number of ways = wage In how many can 5 letters be posted i nN boxes? Soln, Here any letter (of 5 letters) can be posted) Vfin any one of the 4 letter boxes. The first letter can be posted in 4, ways. The second letter again can be posted in 4 ways, Similarly the third, fourth and fifth ‘letters can’ be posted in 4,4 &4.ways. | >% Hence by product rule, ae The total number of ways = 4 * 4 *4/« 4 x4 = 1024, ....Ans. f Addition Principle or Sum Rule : [ioe operations are mutually exclusive (ie. they do T overlap), then the number of ways of performing one operation or the other operation is the sum of the number of ways of performing each operation. More precisely, if an even x; can occur in Ny ways, 9 x 9 x B= 4B. “sees 4 letter even x2can occur in Nz WAYS vac eVENt Xp can occur in Nz ways, then one of the events viz XY, X2 nena Xp CaN OCCUF IN Ny + No + ccc tNp va] : If A and B are disjoint sets, then | A + B | =|Al+1 Bi : Ex.% How many 3 letters words starting @r)edding with +, ‘0% can be made from the letters of “WORD”? In. No words starting or ending with ‘O° afe mutually exclusive ive, they do not overlap. Hence we will find the number of words starting with ‘O° and the number of words ending with ‘O" and add them. Starting with ‘O” : Here the first place is fixed which is ‘O” ie. the first place can be filled in 1 way. The second place can be filled in 3 ways by using any one of the letter’s W, R, D. - The third place can be filled in 2 ways. Hence by product rule, The number of words starting with ‘O” =1%3%2=6, Ending with ‘O° : Here the last place is fixed which is “0” ice. the last placé can be filled in 1 way The first place can be filled in 3 ways by using any one of the letters W, R, R. The second place can be filled in 2 ways.Ex.9. Soln. @ ii) Hence by product rule, The number of words ending with ‘O° =3x2x1=6, By sum rule The total of words starting or ending with '0'=6 +6 =12 Ans, A computer password consists of a letter followed by 3@ 4 digits. Find (i) The total number of passwords that"can be formed (ii) The number of Passwords in which no digit repeats. There are 26 alphabets and 10 digits (0 to 9) and the digits can be repeated (given). Here the required password consists of one letter (alphabet) and 3 or 4 digits. Hence passwords of length 4 characters and 5 characters can be formed. 4 character Passwords : The first place is a letter and can be filled in 26 ways. The second place is a digit and can be filled in 10 ways. The third and fourth places are also digits and can be filled in 10 and 10 ways respectively (since the digits can repeat). Hence by product rule, The number of 4 character passwords = 26 * 10 « 10 x 10 = 26000 5 character Passwords : The first place is a letter and can be filled in 26 ways. The second, third, fourth and fifth places are digits and can be filled in 10, 10, 10 and 10 ways respectively (since the digits can repeat). The number of 5 character passwords = 26 « 10 x 10 x 10 « 10 = 260000. . By sum rule, ‘The total number of passwords that can be formed. = 26000 + 260008 = 286000 ....Ans. There are 26 alphabets and 10 digits (0 to 9) and the digits cannot be repeated (given). 4 character Passwords : The first place is a letter and can be filled in 26 ways. The second third and fourth places are digits and can be filled in 10, 9 and 8 ways respectively (since the digits cannot be repeated). Hence by product rule, ‘The number of 4 character passwords = 26 x 10x 9x 8 = 18720 S character Passwords : The first place is a letter and can be filled in 26 ways. The second, third, fourth and fifth places are digits and can be filled in 10, 9, 8 and 70 ways respectively (Since the digits cannot be repeated),Hence by product rule, The number of 5 character passwords = 26 x 10x 9x 8x 7= 131040. -. By sum rule, The total number of passwords that can be formed. = 18720 + 131040 = 149760 ....Ans.