This action might not be possible to undo. Are you sure you want to continue?

A 5-member team and a captain will be selected out of these 10 players. How many different selections can be made? Question 2: Badri has 9 pairs of dark Blue socks and 9 pairs of Black socks. He keeps them all in a same bag. If he picks out three socks at random what is the probability he will get a matching pair? Question 3: How many words of 4 consonants and 3 vowels can be made from 12 consonants and 4 vowels, if all the letters are different? Question 4: If the letters of the word CHASM are rearranged to form 5 letter words such that none of the word repeat and the results arranged in ascending order as in a dictionary what is the rank of the word CHASM? Question 5: How many four letter distinct initials can be formed using the alphabets of English language such that the last of the four words is always a consonant? Question 6: When four fair dice are rolled simultaneously, in how many outcomes will at least one of the dice show 3? Question 7: In how many ways can the letters of the word EDUCATION be rearranged so that the relative position of the vowels and consonants remain the same as in the word EDUCATION? Question 8: How many ways can 10 letters be posted in 5 post boxes, if each of the post boxes can take more than 10 letters? Question 9: A team of 8 students goes on an excursion, in two cars, of which one can seat 5 and the other only 4. In how many ways can they travel?

10. Question 10: How many ways can 4 prizes be given away to 3 boys, if each boy is eligible for all the prizes? 11. Question 11: There are 12 yes or no questions. How many ways can these be answered? 12. Question 12: How many words can be formed by re-arranging the letters of the word ASCENT such that A and T occupy the first and last position respectively? 13. Question 13: Four dice are rolled simultaneously. What is the number of possible outcomes in which at least one of the die shows 6? 14. Question 14: How many alphabets need to be there in a language if one were to make 1 million distinct 3 digit initials using the alphabets of the language? 15. Question 15: In how many ways can the letters of the word MANAGEMENT be rearranged so that the two As do not appear together? 16. Question 16: There are 5 Rock songs, 6 Carnatic songs and 3 Indi pop songs. How many different albums can be formed using the above repertoire if the albums should contain at least 1 Rock song and 1 Carnatic song? 17. Question 17: What is the value of 1*1! + 2*2! + 3!*3! + ............ n*n!, where n! means n factorial or n(n-1)(n2)...1 18. Question 18: How many number of times will the digit '7' be written when listing the integers from 1 to 1000?

5. CHA _ _.PERMUTATION/COMBINATION SOLUTIONS: 1. There are 8 students and the maximum capacity of the cars together is 9. 2nd. Hence. 6th and 9th positions. the number of outcomes in which at least one die will show 3 = 1296 – 625 = 671 outcomes. we can select the 5 member team out of the 10 in 10C5 ways = 252 ways. total ways the selection can be made is 210*6 = 1260. 5. The next word starts with CH and then A. The word EDUCATION is a 9 letter word. the first letter has 5 options. 5th. 12 C4 * 4C3 4. 4 consonants out of 12 can be selected in 12C4 ways. 11. Therefore. The next word will be CHASM.e. there will be a total of 6 4 = 1296 The number of outcomes in which none of the 4 dice show 3 will be 5 4= 625 Therefore. total number of groups each containing 4 consonants and 3 vowels = Each group contains 7 letters. the 4 prizes can be distributed in 34= 81 ways. so does the second letter and so on and so forth for all of the 10 letters. The first 24 of these words will start with A. the total number of ways in which 8 students can travel is 8C3 + 8C4 = 56 + 70 = 126. The first of the words will be CHAMS. Then the 25th word will start will CA _ _ _. 4th. Therefore. Therefore. there are 21 options. Hence answer = 26*26*26*21 = 263 * 21 When 4 dice are rolled simultaneously. 3. 6.*5 (upto 10 times) = 5 ^ 10. The captain can be selected from amongst the remaining 5 players in 5 ways.. Each of the 10 letters can be posted in any of the 5 boxes. 9. Now. 7. the total number of ways = 4! * 5!. We may divide the 8 students as follows Case I: 5 students in the first car and 3 in the second Or Case II: 4 students in the first car and 4 in the second Hence. Any one prize can be given to any one of the 3 boys and hence there are 3 ways of distributing each prize. 2nd. Therefore required number of words = 124 * 4C3 * 7! 2. Hence. Therefore. Similarly. So. with none of the letters repeating.e. So. total ways the selection of 5 players and a captain can be made = 252*5 = 1260. Hence the probability is 1. The vowels occupy 3. Similarly. 7th and 8th position in 4! Ways. the captain can be selected from these 6 players in 6 ways. If he picks any of the three socks invariably any two of them should match. Each of the questions can be answered in 2 ways (yes or no) .e. outcomes. i. in Case I: 8 students are divided into groups of 5 and 3 in 8C3ways. The first three letters can be either consonants or vowels. 8. A team of 6 members has to be selected from the 10 players. Therefore. 3 vowels can be selected in 4C3 ways. The 5 letter word can be rearranged in 5! Ways = 120 without any of the letters repeating. 6 words exist that start with CA. the 5 consonants can be arranged in 1 st. which can be arranging in 7! ways. the rank of CHASM will be 24 + 6 + 2 = 32. This can be done in 10C6 or 210 ways. i. Note that the question asks you to find out the number of distinct initials and not initials where the letters are distinct. Therefore. 5*5*5*…. 6th and 9th position in 5! Ways. 10. The 4 vowels can be arranged in the 3rd. 7th and 8th position in the word and the remaining 5 positions are occupied by consonants As the relative position of the vowels and consonants in any arrangement should remain the same as in the word EDUCATION. in Case II: 8 students are divided into two groups of 4 and 4 in 8C4 ways. i. 4th. each of them have 26 options. The last of the four letter words should be a consonant. Alternatively. the vowels can occupy only the aforementioned 4 places and the consonants can occupy 1 st. The remaining 3 letters can be rearranged in 3! Ways = 6.

For e. That is all four dice show any of the other 5 numbers.3! .. it can be done in 25 . Therefore. 3C1 ways of choosing one out of the three. In this case. the total number of combinations = 31 * 63 * 8 = 15624 17. hence by rearranging the letters of the word ASCENT we can form 1x4! = 4! words.T). the letters A. no. 16. 1*1! = (2 -1)*1! = 2*1! . can be selected in 2 6 . the required answer in which the two As do not appear next to each other = Total number of outcomes .1)*3! = 4*3! . n*n! = (n+1 .3C2 ways of choosing two out of the three and 3C3 ways of choosing all three. The problem requires us to find out the number of outcomes in which the two As do not appear together. We can choose them in 2 5 ways.625 = 671 outcomes at least one of the dice will show 6. M. The number of outcomes in which the two As appear together can be found out by considering the two As as one single letter. the number of ways in which the letters of the word MANAGEMENT can be rearranged reduces to . The remaining 4 positions can be filled in 4! Ways by the remaining words (S. the 6 Carnatic songs. Note distinct initials is different from initials where the digits are different.1! . AAA and BBB are acceptable combinations in the case of distinct initials while they are not permitted when the digits of the initials need to be different. .3C0 ways of choosing none of the three.the number of outcomes in which the 2 As appear together => ways. Therefore. in 1296 . 12.3! = 4! .1 = 64 . As A and T should occupy the first and last position.1 = 63 ways.2! 3*3! = (4 . That is possible in 54 = 625 outcomes. However. we need to account for those. Therefore. if n = 3. Normally. Here the option of not selecting even one Indi Pop is allowed. choosing at least one.1*1! = 2! . 15. .1)*n! = (n+1)(n!) . Therefore. any 10 letter word can be rearranged in 10! ways. Let the number of required alphabets in the language be ‘n’. 13.E. N and M repeat twice. Therefore. using ‘n’ alphabets we can form n * n * n = n 3 distinct 3 digit initials. of ways of answering 12 questions = 212 = 4096 ways. 1 million distinct 3 digit initials are needed. there are 5 Rock songs. then the three objects can be chosen in the following 23 ways . For instance. as there are certain letters of the word repeating..Therefore. Similarly.g.1 = 32 . Therefore. And the 3 Indi pop can be selected in 23 = 8 ways. This n3 different initials = 1 million i. as the problem states that the case where you do not choose a Rock song does not exist (at least one rock song has to be selected). there will now be only 9 letters of which three of them E. There are 2n ways of choosing ‘n’ objects.1! 2*2! = (3 .. the language needs to have a minimum of 100 alphabets to achieve the objective. n3 = 106 (1 million = 106) => n3 = (102)3 => n = 102 = 100 Hence.2! = 3! . In the given problem. However.1)*2! = 3*2! .1 = 31 ways. The word MANAGEMENT is a 10 letter word. So these 9 letters with 3 of them repeating twice can be rearranged in ways. When 4 dice are rolled simultaneously.n! Summing up all these terms.n! = (n+1)! . the first and last position can be filled in only one way.C. we get (n+1)! . E and N repeat twice each. 14. there are 6 4 = 1296 outcomes.N. The converse of what is asked in the question is that none of the dice show '6'.e.

In each of these 27 numbers. the digit 7 is written twice.777 .e 0 to 9 with the exception of 7) You have 1*9*9 = 81 such numbers. There will be 9 such numbers. 7 could appear as the first or the second or the third digit. 7 is written once. 7 is written 54 times. 2-digits and 3. However. a. So we have to count the number of times it appears between 1 and 999. e. . However.g 772 or 377 or 747 or 77 In these numbers. y. c. 743 etc This means that 7 is one of the digits and the remaining two digits will be any of the other 9 digits (i. Any number between 1 and 999 can be expressed in the form of xyz where 0 < x. there will be 3*81 = 243 numbers (1-digit. Therefore. 243 times. In each of these numbers.digits) in which 7 will appear only once. Therefore. So there are 3 * 9 = 27 such numbers. this digit which is not 7 can appear in the first or second or the third place. the total number of times the digit 7 is written between 1 and 999 is 243 + 54 + 3 = 300 b.18. Therefore. Therefore. The numbers in which 7 occurs only once. one of the digits is not 7 and it can be any of the 9 digits ( 0 to 9 with the exception of 7). e.1 number. 17. 78. The numbers in which 7 will appear twice. The number in which 7 appears thrice . 7 is written thrice in it. 7 does not occur in 1000.g 7. 217. z < 9.

- State of the Nation Address
- sulfuric acid
- DLRC Chemistry 16 Comprehensive Samplex for Long Exam 2
- Math 53 Samplex Finals
- Performance Management and Rewards
- Quints February 2013
- Math 53 Samplex Finals
- Math 53 Samplex Finals
- ES 1 - Sectional View
- Acad Cal 2012-2013
- 60766629-FILIPINIZATION
- 548 Heartbeats
- The 22nd of April
- Music and Lyrics-Way Back Into Love-Sheetzbox

exercises

exercises

- Permutation Combination
- Reasoning Sample Paper 1
- Russian Pronunciation Guide
- Smooth Phonics
- French Phonetic
- Izon (Ijaw) Language Book
- Sbi Test Paper
- Workbook 2
- O10-4001
- Telugu Alphabets
- Coding Decoding
- 9781501510977-011
- Word Connections
- CurySHORTHAND VOCABULARY2011
- Permutation Reso Sheet
- Intensifying Prefixes in the Etymologies
- Speech signal processing Report
- Tamil
- Hangul
- 215911799 Japanese Vocabulary
- Vow Conssss
- Text 12
- Phonetics Activities
- ELA Grade 1
- Consonants and Vowels
- Irish - From Spelling to Pronunciation
- Telugu Alphabet
- Italian Diction
- n3121
- Analysis 2
- permutation combination

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd