Question 1 How many five digit positive integers that are divisible by 3 can be formed using the digits

0, 1, 2, 3, 4 and 5, without any of the digits getting repeating (1) 15 (2) 96 (3) 216 (4) 120 (5) 625 Correct Answer is 216 - (3) Explanation Test of divisibility for 3 The sum of the digits of any number that is divisible by '3' is divisible by 3. For instance, take the number 54372. Sum of its digits is 5 + 4 + 3 + 7 + 2 = 21. As 21 is divisible by '3', 54372 is also divisible by 3. There are six digits viz., 0, 1, 2, 3, 4 and 5. To form 5-digit numbers we need exactly 5 digits. So we should not be using one of the digits. The sum of all the six digits 0, 1, 2, 3, 4 and 5 is 15. We know that any number is divisible by 3 if and only if the sum of its digits are divisible by '3'. Combining the two criteria that we use only 5 of the 6 digits and pick them in such a way that the sum is divisible by 3, we should not use either '0' or '3' while forming the five digit numbers. Case 1 If we do not use '0', then the remaining 5 digits can be arranged in 5! ways = 120 numbers. Case 2 If we do not use '3', then the arrangements should take into account that '0' cannot be the first digit as a 5-digit number will not start with '0'. . The first digit from the left can be any of the 4 digits 1, 2, 4 or 5. Then the remaining 4 digits including '0' can be arranged in the other 4 places in 4! ways. So, there will be 4*4! numbers = 4*24 = 96 numbers. Combining Case 1 and Case 2, there are a total of 120 + 96 = 216 5 digit numbers divisible by '3' that can be formed using the digits 0 to 5. Question 2 In how many ways can 5 different toys be packed in 3 identical boxes such that no box is empty, if any of the boxes may hold all of the toys? (1) 20 (2) 30 (3) 25 (4) 600 (5) 480 Correct Answer is 25 - Choice (3) Explanation The toys are different; The boxes are identical If none of the boxes is to remain empty, then we can pack the toys in one of the following ways a. 2, 2, 1 b. 3, 1, 1 Case a. Number of ways of achieving the first option 2 - 2 - 1 Two toys out of the 5 can be selected in 5C2 ways. Another 2 out of the remaining 3 can be selected in 3C2 ways and the last toy can be selected in 1C1 way. However, as the boxes are identical, the two different ways of selecting which box holds the first two toys and which one holds the second set of two toys will look the same. Hence, we need to divide the result by 2. Therefore, total number of ways of achieving the 2 - 2 - 1 option is = = 15 ways.

Case b. Number of ways of achieving the second option 3 - 1 - 1 Three toys out of the 5 can be selected in 5C3 ways. As the boxes are identical, the remaining two toys can go into the two identical looking boxes in only one way.

Therefore, total number of ways of getting the 3 - 1 - 1 option is 5C3 = 10 = 10 ways. Total ways in which the 5 toys can be packed in 3 identical boxes = number of ways of achieving Case a + number of ways of achieving Case b = 15 + 10 = 25 ways. Question 3 There are 2 brothers among a group of 20 persons. In how many ways can the group be arranged around a circle so that there is exactly one person between the two brothers? (1) 2 * 17! (2) 18! * 18 (3) 19! * 18 (4) 2 * 18! (5) 2 * 17! * 17! Correct Answer is 2 * 18! - Choice (4) Explanation Circular Permutation 'n' objects can be arranged around a circle in (n - 1)!. If arranging these 'n' objects clockwise or counter clockwise means one and the same, then the number arrangements will be half that number. i.e., number of arrangements = . Let there be exactly one person between the two brothers as stated in the question. If we consider the two brothers and the person in between the brothers as a block, then there will 17 others and this block of three people to be arranged around a circle. The number of ways of arranging 18 objects around a circle is in 17! ways. Now the brothers can be arranged on either side of the person who is in between the brothers in 2! ways. The person who sits in between the two brothers could be any of the 18 in the group and can be selected in 18 ways. Therefore, the total number of ways 18 * 17! * 2 = 2 * 18!. Question 4 In how many ways can 15 people be seated around two round tables with seating capacities of 7 and 8 people? (1) 15!/(8!) (2) 7!*8! (3) (15C8)*6!*7! (4) 2*(15C7)*6!*7! (5) 15C8 * 8! Correct Answer is (15C8)*6!*7! - (3) Explanation Circular Permutation 'n' objects can be arranged around a circle in (n - 1)!. If arranging these 'n' objects clockwise or counter clockwise means one and the same, then the number arrangements will be half that number.i.e., number of arrangements = . 15 You can choose the 7 people to sit in the first table in C7 ways. After selecting 7 people for the table that can seat 7 people, they can be seated in (7-1)! = 6!. The remaining 8 people can be made to sit around the second circular table in (8-1)! = 7! Ways. Hence, total number of ways 15C8 * 6! * 7! Question 5 In how many ways can the letters of the word ABACUS be rearranged such that the vowels always appear together? (1) (2) 3!*3! (3) (4) (5) 72

Correct Answer is

- Choice 4

Explanation ABACUS is a 6 letter word with 3 of the letters being vowels. If the 3 vowels have to appear together as stated in the question, then there will 3 consonants and a set of 3 vowels grouped together. One group of 3 vowels and 3 consonants are essentially 4 elements to be rearranged. The number of possible rearrangements is 4! The group of 3 vowels contains two 'a's and one 'u'. The 3 vowels can rearrange amongst themselves in ways as the vowel "a" appears twice.

Hence, the total number of rearrangements in which the vowels appear together are Question 6 There are 6 boxes numbered 1, 2,...6. Each box is to be filled up either with a red or a green ball in such a way that at least 1 box contains a green ball and the boxes containing green balls are consecutively numbered. The total number of ways in which this can be done is ____ (1) 5 (2) 21 (3) 33 (4) 60 (5) 27 Correct Answer is 21 - Choice 2 Explanation If only one of the boxes has a green ball, it can be any of the 6 boxes. So, this can be achieved in 6 ways. If two of the boxes have green balls and then there are 5 arrangement possible. i.e., the two boxes can one of 1-2 or 2-3 or 3-4 or 4-5 or 5-6. If 3 of the boxes have green balls, there will be 4 options in which the 3 boxes are in consecutive positions. i.e., 1-2-3 or 2-3-4 or 3-4-5 or 4-5-6 If 4 boxes have green balls, there will be 3 options. i.e., 1-2-3-4 or 2-3-4-5 or 3-4-5-6 If 5 boxes have green balls, then there will be 2 options. i.e., 1-2-3-4-5 or 2-3-4-5-6 If all 6 boxes have green balls, then there will be just 1 options. Total number of options = 6 + 5 + 4 + 3 + 2 + 1 = 21. Question 7 How many integers, greater than 999 but not greater than 4000, can be formed with the digits 0, 1, 2, 3 and 4, if repetition of digits is allowed? (1) 499 (2) 500 (3) 375 (4) 376 (5) 501 Correct Answer is 376 - Choice (4) Explanation The smallest number in the series is 1000, a 4-digit number. The largest number in the series is 4000, the only 4-digit number to start with 4. The left most digit (thousands place) of each of the 4 digit numbers other than 4000 can take one of the 3 values 1 or 2 or 3. The next 3 digits (hundreds, tens and units place) can take any of the 5 values 0 or 1 or 2 or 3 or 4. Hence, there are 3 * 5 * 5 * 5 or 375 numbers from 1000 to 3999. Including 4000, there will be 376 such numbers. Question 8 In how many rearrangements of the word AMAZED, is the letter 'E' positioned in between the 2 'A's (Not necessarily flanked)? (A) 24 (B) 72 (C) 120 (D) 240

Correct Answer is 120 - Choice (C) Explanation In any rearrangement of the word, consider only the positions of the letters A, A and E. These can be as A A E, A E A or E A A. So, effectively one-third of all words will have 'E' in between the two 'A's. The total number of rearrangements are One-third of 360 is 120. Answer (C) = 360.