Exams > Cat > Quantitaitve Aptitude
MODERN MATHS MCQs
:
B
We need to find the largest possible number of subsets of {1, 2, 3, 4, 5} such that no 2 subsets are disjoint. Fix one element from the set to be presented in each subset and we can have 24 such possibilities.
Because one element is common. So, remaining 4 can be selected 4C0 + 4C1 + 4C2 + 4C3 + 4C4 = 24 = 16 ways. There are total 16 days.
:
A
5 people can sit together around a round table in (5−1)!=4! Ways. But in anticlockwise and clockwise arrangements each of them will have the same neighbour. So, no. of arrangements possible = 12(4!)=12.
So, they dine together for 12 days.
Hence option (a)
:
A
Soln:
n!(n−6)!=12×n!(n−4)!
(n−4)!=12×(n−6)!
(n−4)(n−5)=4×3
n = 8
Hint: go from answer options. Only option(a) satisfies given equation.
:
A
This is a type of “Different to Different” question.
5 prizes can be distributed among 4 students in 45 ways.
Hence option (a)
:
E
Soln: nPrnCr = 1205 = 2
nCr=(nPr)(r!)
nPr[nPrr!]
r! = 24
r = 4
Given nPr = 120
nP4 = 120
n!(n−4)!=120
n(n-1)(n-2)(n-3) = 120
n = 5
Hence option (e)
:
D
Total number of 5 digit telephone numbers which can be formed using digits 0,1,2…9 is 105
Number of 5 digit numbers having not even a single digit repeated is 10P5 = 30240
Required number of telephone numbers = 105 -30240 = 69760
:
B
To get a two factor product out of 50 numbers, we can choose the two numbers in 50C2 ways, out of
which we need to negate pairs wherein both numbers are not multiples of 3.
Non multiples of 3 till 50=50−503=34.
50C2−34C2
:
D
Since the order of vowels will always remain the same despite these occupying different positions -> if we assume each vowel as X then our question is same as asking "arrange JPTRXXX" => in all 7!3! ways. => Choice (d) is the right answer
:
D
C+S+G+Ch+P = 15
Removing 1+2+2+3 =8
C+S+G+Ch+P=7
This is the arrangement of 7 zeroes and 4 ones. 11C4=330
:
B
Case 1- No girls
Possible selections = 11C10=11
Case 2- One girl
Possible selections= 4×11C9=220
Case 3- Two girls
Possible selections =4C2×11C8=990
Case 4- Three girls
Possible selections = 4C3×11C7=1320
Total= 2541