Free Basic Algebra - 03 Practice Test - CAT
Question 1
The value of √6+√6+√6+.....∞ is:
SOLUTION
Solution : C
Let y be the given expression, then
y=√(6+y)
y2=6+y
y2−y−6=0
(y – 3)(y + 2) = 0
y = 3, y = -2
So, the value of the given expression is 3.
Question 2
If x3−k2x2+(6k+5)x−5k=0 has two roots 3 and 5, then which of the following is the third root?
SOLUTION
Solution : A
Assume α be the 3rd root.
Sum of the roots, i.e., 3+5+α=k2
Product of the roots, i.e.3×5×α=5k
So,8+α=9α2
Then,α=1 or −89
Hence the 3rd root is 1.
Question 3
A basket has 5 oranges and 4 apples. In how many ways can you make a selection if you have to take at least 1 orange and 1 apple?
22
345
365
465
SOLUTION
Solution : D
At least 1 orange can be selected in 25−1=31ways.
At least 1 apple can be selected in 24−1=15ways.
Total no. of selections possible =31×15=465
Question 4
In a college a committee of 7 people has to be selected from a group of 8 fourth year and 6 third year students. In how many ways can this committee be selected if in the committee, majority of fourth year students is required?
SOLUTION
Solution : D
Majority of fourth year means out of 7, minimum 4 should be from fourth year.
Considering different possibilities:
No.from 4th yearWays of choosing 4th yearNo.from 3rd yearWays of choosing 3rd yearwys of choosing commitee48C4=7036C3=2070 ×20 =140058C5=5626C2=1556 ×15 =84068C6=2816C1=628 ×6 =16878C7=806C0=18 ×1=8Total2416
So, total no. of ways = 2416.
Question 5
Department of Science and Technology wants to form a committee of three people from a panel of 7 people, out of which 3 are scientists, 3 are bureaucrat and one is both scientist as well bureaucrat. In how many ways can the committee be formed if it should have at least one scientist and one bureaucrat?
21
25
23
33
SOLUTION
Solution : D
CASENo. of ways2 SCIENTISTS, 1 BUREAUCRAT3C2×3C1=3×3=91 SCIENTIST, 2 BUREAUCRAT3C1×3C2=3×3=92 OUT OF 6 (3 SCIENTIST, 3 BUREAUCRAT),6C2×1=151WHOISBOTH
So, total number of ways = 9 + 9 + 15 = 33. Hence option (e)
Question 6
Vivek has 31 friends. He wants to invite some of them in a manner that he can throw maximum number of parties; also each party should have same number of guests and different set of persons. How many parties can Vivek throw?
SOLUTION
Solution : A
Soln:
As n is odd, nCris maximum when r = (n−1)2 =15 or (n−1)2 = 16.
So, number of parties possible= 31C16=31C15.
Hence option (a)
Question 7
How many different straight lines can be formed by joining 14 different points of which 6 are collinear and rest are non-collinear?
SOLUTION
Solution : D
No. of lines formed by joining 14 points =14C2
No. of lines formed by joining 6 points =6C2
Out of the 14 points, when you join the 6 collinear points, you don’t get 6C2 lines, but you get only one line.
So, no. of lines =14C2−6C2+1=91−15+1=77.
2nd method:- By selection, 8C2+8C1×6C1+1=77 .
Question 8
If m parallel lines in a plane are intersected by a family of n parallel lines, calculate the number of parallelograms formed.
SOLUTION
Solution : B
A parallelogram is formed when two select 2 lines from the group of m lines, and 2 from the group of n line. This can be done in = mC2 and nC2 ways. So, total no. of parallelograms formed=mC2×nC2
=(14)[(m!n!)((m−2)!(n−2)!)]
=14[mn(m−1)(n−1)]2nd method:- By substitution of any values in choices. Let m=2 & n=2 then total parallelograms =1. Only option C will satisfy. Then option (c).
Question 9
Determine the no. of 4 letter words those can be formed from the letters of the word: CHASSIS.
196
216
217
208
SOLUTION
Solution : D
We have 1 C, 1 H, 1 A, 1 I and 3 S.
The four letter word can be of the form: abcd, aabc, aaab
Case 1: abcd (none repeating): 4 letters can be selected in 5C4 ways. Can be arranged in 4! Ways.
Case 2: aabc (two repeating): a can only be S. 2 can be selected in 4C2ways. Can be arranged in 4!(2!)ways.
Case 3: aaab (three repeating): a can only be S. 1 can be selected in 4C1ways. Can be arranged in 4!(3!)Ways.
So, total no. of words possible
=(5C4×4!)+(4C2×(4!2!)+(4C1×(4!3!)))
=120+72+16=208.
Question 10
Find the no. of ways in which 15 players can be equally divided into three groups
[(15!)(5!)3](13!)
[(15!)(5!)3]
[(15!)(5!)]
15!3
SOLUTION
Solution : A
The no. of ways in which mn different things can be divided equally into m groups containing n things each = [(mn!)(n!)m](1m!)
So, required no. of ways = [(15!)(5!)3](13!)
We divide by 3! Since the groups are of equal size and hence, indistinguishable.
Question 11
Find the number of ways in which 15 players can be equally distributed into three different groups-A,B,C.
[(15!)(5!)3](13!)
[(15!)(5!)3]
[(15!)(5!)]
15!3
SOLUTION
Solution : B
In distribution order is important.
The no. of ways in which mn different things can be distributed equally into m groups containing n things each =[(mn!)(n!)m]
Here, the groups are different, hence we do not divide by3!.
So, required no. of ways =[(15!)(5!)3]
Question 12
In how many ways can a pack of 52 cards be divided equally among 4 players?
SOLUTION
Solution : C
Here as it has to be divided among 4 different players, the order is important.
No. of ways =(52!)[(13!)4].
Question 13
Calculate the number of ways in which 10 different students can be divided into two groups containing 6 and 4 students respectively.
SOLUTION
Solution : C
No. of ways = 10!(6!4!)
2nd method:- Select any six then other four will be automatically selected. i.e 10C6=10!(6!4!)
Question 14
Calculate the number of ways in which 10 different students can be divided into two groups under two different teachers containing 6 and 4 students respectively.
10!6!
10C6×10C4
10!6!4!×2!
10!4!
SOLUTION
Solution : C
No. of ways =10!(6!4!)×2!
Here we multiply by 2! Because the groups are distinct.
Question 15
Find the number of ways of distributing 8 similar balls into 4 different boxes so that none of the boxes are empty.
SOLUTION
Solution : D
This is a type of “similar to different” questions with a lower limit of 1.
Let the 4 boxes be A,B,C,D
A+B+C+D=8
Applying a lower limit of 1
A+B+C+D=4
Applying 0’s and 1’s method:
No. of zeroes = 4 , No. of ones = 3
Total number of ways =7!(4!3!).