Maths
Get insights from 6.5k questions on Maths, answered by students, alumni, and experts. You may also ask and answer any question you like about Maths
Follow Ask QuestionQuestions
Discussions
Active Users
Followers
New answer posted
11 months agoContributor-Level 10
39. As out of the total 9 seats 4 women are to be at even places we can have the following arrangement.
Seat places
| M | W | M | W | M | W | M | W | M |
Seat places | 1st | 2nd | 3rd | 4th | 5th | 6th | 7th | 8th | 9th |
Also from this arrangement the women and men can rearrange among themselves.
Therefore, the required number of ways = 4! * 5!
= (4 * 3 * 2 * 1) * (5 * 4 * 3 * 2 * 1)
= 24 * 120
= 2880
New answer posted
11 months agoContributor-Level 10
38. In a deck of 52 card there are four kings.
So, number of ways of selecting exactly one king is 4C1.
Now, after fixing one king card, we need to have the remaining 4 out of 5 cards to be a non-king i.e., only from the other 48 cards. So, number of ways of selecting is 48C4
Therefore, the required number of ways
= 4C1*48C4
New answer posted
11 months agoContributor-Level 10
37. Since out of 8 total questions at least 3 questions has to be attempted from each of part I and II containing 5 and 7 questions respectively we can have the choices.
(a) 3 questions from I and 5 questions from II selected in 5C3*7C5 ways.
(b) 4 questions from I and 4 questions from II selected in 5C4*7C4 ways.
(c) 5 questions from I and 3 questions from II selected in 5C5*7C3 ways.
Therefore, the required number of ways.
= (5C3*7C5) + (5C4*7C4) + (5C5*7C3)
= * + * + *

= (10 * 21) + (5 * 35) + 35
= 210 + 175 + 35
= 420
New answer posted
11 months agoContributor-Level 10
32. Given, f (x) =
For
n = m
So, exist for n = m.
Again,
So, Thus, exist for any integral value of m and n.
New answer posted
11 months agoContributor-Level 10
36. In an English word there are 5 vowels and 21 consonants.
The number of ways of selecting 2 vowel out of 5 = 5C2
=

= 5 * 2 = 10
The number of ways of selecting 2 consonants out of 21 = 21C2
=

= 21 * 10
= 210
Therefore, the number of combinations of 2 vowels and 2 consonants is 10 * 210 = 2100
Each of these 2100 combinations has 4 letters which can be rearranged among themselves in 4! Ways.
Therefore, the required number of ways
= 4! * 2100
= 4 * 3 * 2 * 1 * 2100
= 50400
New answer posted
11 months agoContributor-Level 10
30. Given,
As | x | =
We can rewrite f (x) =
Case 1: when a<0,
So, = exist such that a< 0
Case II when a> 0,
So, exist such that a>0.
Case III when a = 0.
L.H.L =
R.H.L =
Thus,
So, does not exist at a = 0.
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else
Sign Up on ShikshaOn Shiksha, get access to
- 66k Colleges
- 1.2k Exams
- 688k Reviews
- 1850k Answers
