Permutation Combination 1. A college has 10 basketball players.

A 5-member team and a captain will be selected out of

these 10 players. How many different selections can be made? 1.1260 2.210 3.10C6 * 6! 4.10C5 * 6 Correct Answer - 1260. Choice (1) Explanatory Answer A team of 6 members has to be selected from the 10 players. This can be done in 10C6 or 210 ways. Now, the captain can be selected from these 6 players in 6 ways. Therefore, total ways the selection can be made is 210*6 = 1260. Alternatively, we can select the 5 member team out of the 10 in 10C5 ways = 252 ways. The captain can be selected from amongst the remaining 5 players in 5 ways. Therefore, total ways the selection of 5 players and a captain can be made = 252*5 = 1260.

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? (1) (2*9C2 * 9C1) / 18C3 (2) (9C2 * 9C1) / 18C3 (3) 1 (4) None of these Correct Answer - (3) Solution: If he picks any of the three socks invariably any two of them should match. Hence the probability is 1.

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? (1) 16C7 * 7! (2) 12C4 * 4C3 * 7! (3) 12C3 * 4C4 (4) 12C4 * 4C3 Correct Answer - (2)

Solution: 4 consonants out of 12 can be selected in 12C4 ways. 3 vowels can be selected in 4C3 ways. Therefore, total number of groups each containing 4 consonants and 3 vowels = 12C4 * 4C3 Each group contains 7 letters, which can be arranging in 7! ways. Therefore required number of words = 124 * 4C3 * 7! 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? (1) 24 (2) 31 (3) 32 (4) 30 Correct Answer - (3) Solution: The 5 letter word can be rearranged in 5! Ways = 120 without any of the letters repeating. The first 24 of these words will start with A. Then the 25th word will start will CA _ _ _. The remaining 3 letters can be rearranged in 3! Ways = 6. i.e. 6 words exist that start with CA. The next word starts with CH and then A, i.e., CHA _ _. The first of the words will be CHAMS. The next word will be CHASM. Therefore, the rank of CHASM will be 24 + 6 + 2 = 32.

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? (1) (26^3)*(21) (2) 26*25*24*21 (3) 25*24*23*21 (4) None of these. Correct Answer - (1) Solution: The last of the four letter words should be a consonant. Therefore, there are 21 options. The first three letters can be either consonants or vowels. So, each of them have 26 options. Note that the question asks you to find out the number of distinct initials and not initials where the letters are distinct. Hence answer = 26*26*26*21 = 263 * 21

6. When four fair dice are rolled simultaneously, in how many outcomes will at least one of the dice show 3? (1) 155 (2) 620 (3) 671 (4) 625 Correct Answer - (3) Solution: When 4 dice are rolled simultaneously, there will be a total of 64 = 1296 outcomes. The number of outcomes in which none of the 4 dice show 3 will be 54 = 625 outcomes. Therefore, the number of outcomes in which at least one die will show 3 = 1296 625 = 671

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? (1) 9!/4 (2) 9!/(4!*5!) (3) 4!*5! (4) None of these Correct Answer - (3) Solution: The word EDUCATION is a 9 letter word, with none of the letters repeating. The vowels occupy 3, 5, 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, the vowels can occupy only the aforementioned 4 places and the consonants can occupy 1st, 2nd, 4th, 6th and 9th positions. The 4 vowels can be arranged in the 3rd, 5th, 7th and 8th position in 4! Ways. Similarly, the 5 consonants can be arranged in 1st, 2nd, 4th, 6th and 9th position in 5! Ways. Hence, the total number of ways = 4! * 5!.

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?

(1) 5^10 (2) 10^5 (3) 10P5 (4) 10C5 Correct Answer - (1) Solution: Each of the 10 letters can be posted in any of the 5 boxes. So, the first letter has 5 options, so does the second letter and so on and so forth for all of the 10 letters. i.e. 5*5*5*.*5 (upto 10 times) = 5 ^ 10.

9. How many numbers are there between 100 and 1000 such that atleast one of their digits is 6?

10. 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? (1) 9 (2) 26 (3) 126 (4) 3920 Correct Answer - (3) Solution: There are 8 students and the maximum capacity of the cars together is 9. 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, in Case I: 8 students are divided into groups of 5 and 3 in 8C3 ways. Similarly, in Case II: 8 students are divided into two groups of 4 and 4 in 8C4 ways. Therefore, the total number of ways in which 8 students can travel is 8C3 + 8C4 = 56 + 70 = 126. 11. How many ways can 4 prizes be given away to 3 boys, if each boy is eligible for all the prizes? (1) 256 (2) 12 (3) 81 (4) None of these

Correct Answer - (3) Solution: Any one prize can be given to any one of the 3 boys and hence there are 3 ways of distributing each prize.

12. There are 12 yes or no questions. How many ways can these be answered? (1) 1024 (2) 2048 (3) 4096 (4) 144 Correct Answer - (3) Solution: Each of the questions can be answered in 2 ways (yes or no) Therefore, no. of ways of answering 12 questions = 212 = 4096 ways.

13. 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? (1) 5! (2) 4! (3) 6! - 2! (4) 6! / 2! Correct Answer - (2) Solution: As A and T should occupy the first and last position, the first and last position can be filled in only one way. The remaining 4 positions can be filled in 4! Ways by the remaining words (S,C,E,N,T). hence by rearranging the letters of the word ASCENT we can form 1x4! = 4! words.

14. Four dice are rolled simultaneously. What is the number of possible outcomes in which at least one of the die shows 6? (1) 6! / 4! (2) 625 (3) 671 (4) 1296

Correct Answer - (3) Solution: When 4 dice are rolled simultaneously, there are 64 = 1296 outcomes. The converse of what is asked in the question is that none of the dice show '6'. That is all four dice show any of the other 5 numbers. That is possible in 54 = 625 outcomes. Therefore, in 1296 - 625 = 671 outcomes at least one of the dice will show 6.

15. 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? (1) 26 (2) 50 (3) 100 (4) 1000 Correct Answer - (3) Solution: 1 million distinct 3 digit initials are needed. Let the number of required alphabets in the language be n. Therefore, using n alphabets we can form n * n * n = n3 distinct 3 digit initials. Note distinct initials is different from initials where the digits are different. For instance, 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. This n3 different initials = 1 million i.e. n3 = 106 (1 million = 106) => n3 = (102)3 => n = 102 = 100 Hence, the language needs to have a minimum of 100 alphabets to achieve the objective.

16. In how many ways can the letters of the word MANAGEMENT be rearranged so that the two As do not appear together? (1) 10! - 2! (2) 9! - 2! (3) 10! - 9! (4) None of these Correct Answer - (4) Solution: The word MANAGEMENT is a 10 letter word.

Normally, any 10 letter word can be rearranged in 10! ways. However, as there are certain letters of the word repeating, we need to account for those. In this case, the letters A, M, E and N repeat twice each. Therefore, the number of ways in which the letters of the word MANAGEMENT can be rearranged reduces to . The problem requires us to find out the number of outcomes in which the two As do not appear together. The number of outcomes in which the two As appear together can be found out by considering the two As as one single letter. Therefore, there will now be only 9 letters of which three of them E, N and M repeat twice. So these 9 letters with 3 of them repeating twice can be rearranged in ways. Therefore, the required answer in which the two As do not appear next to each other = Total number of outcomes - the number of outcomes in which the 2 As appear together

=>

ways.

17. 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? (1) 15624 (2) 16384 (3) 6144 (4) 240 Correct Answer - (1) Solution: There are 2n ways of choosing n objects. For e.g. if n = 3, then the three objects can be chosen in the following 23 ways - 3C0 ways of choosing none of the three, 3C1 ways of choosing one out of the three, 3C2 ways of choosing two out of the three and 3C3 ways of choosing all three. In the given problem, there are 5 Rock songs. We can choose them in 25 ways. However, 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), it can be done in 25 - 1 = 32 - 1 = 31 ways. Similarly, the 6 Carnatic songs, choosing at least one, can be selected in 26 - 1 = 64 - 1 = 63 ways. And the 3 Indi pop can be selected in 23 = 8 ways. Here the option of not selecting even one Indi Pop is allowed. Therefore, the total number of combinations = 31 * 63 * 8 = 15624

18. What is the value of 1*1! + 2*2! + 3!*3! + ............ n*n!, where n! means n factorial or n(n-1)(n-2)...1 (1) n(n-1)(n-1)! (2) (n+1)!/(n(n-1)) (3) (n+1)! - n! (4) (n + 1)! - 1! Correct Answer - (4) Solution: 1*1! = (2 -1)*1! = 2*1! - 1*1! = 2! - 1! 2*2! = (3 - 1)*2! = 3*2! - 2! = 3! - 2! 3*3! = (4 - 1)*3! = 4*3! - 3! = 4! - 3! .. .. .. n*n! = (n+1 - 1)*n! = (n+1)(n!) - n! = (n+1)! - n! Summing up all these terms, we get (n+1)! - 1!

19. How many number of times will the digit 7' be written when listing the integers from 1 to 1000? (1) 271 (2) 300 (3) 252 (4) 304 Correct Answer - (2) Solution: 7 does not occur in 1000. So we have to count the number of times it appears between 1 and 999. Any number between 1 and 999 can be expressed in the form of xyz where 0 < x, y, z < 9. 1. The numbers in which 7 occurs only once. e.g 7, 17, 78, 217, 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.e 0 to 9 with the exception of 7) You have 1*9*9 = 81 such numbers. However, 7 could appear as the first or the second or the third digit. Therefore, there will be 3*81 = 243 numbers (1-digit, 2-digits and 3- digits) in which 7 will appear only once. In each of these numbers, 7 is written once. Therefore, 243 times. 2. The numbers in which 7 will appear twice. e.g 772 or 377 or 747 or 77 In these numbers, one of the digits is not 7 and it can be any of the 9 digits ( 0 to 9 with the exception of 7).

There will be 9 such numbers. However, this digit which is not 7 can appear in the first or second or the third place. So there are 3 * 9 = 27 such numbers. In each of these 27 numbers, the digit 7 is written twice. Therefore, 7 is written 54 times. 3. The number in which 7 appears thrice - 777 - 1 number. 7 is written thrice in it. Therefore, the total number of times the digit 7 is written between 1 and 999 is 243 + 54 + 3 = 300