P (Exactly one of A or B)
or
P (Exactly one of A or B)
or
P(x 5 | x > 2) =
=
=
For no solution D = 0 = 5
Option (b).
is selected
is selected
: white ball is drawn
Probability of obtaining total sum 7 = probability of getting opposite faces. Probability of getting opposite faces
(given)
Let x be the number of heads obtained by A, and y be the number of heads obtained by B.
Note that x and y are binomial variable with parameters n = 3 and p =
Probability that both A and B obtained the same number of heads is
g(3) = 2g(1) can be defined in 3 ways number of onto functions in this condition = 3 4!
Total number of onto functions = 6!
Required probability =
First 10 prime numbers are ={2, 3, 5, 7, 11, 13, 17, 19, 23, 29} Let A is a 2 2 matrix,
Given that matrix A is singular. | A | = 0
Case I : ad = bc condition satisfy when a = b = c = d.
For ex when a = 2, b = 2, c = 2, d = 2, then ad = bc satisfy.
Now there are 10 prime numbers.
We can choose any one of the 10 prime number in
= 10 ways and put them in the four positions of the matrix and matrix will be singular.
In this case, total favorable case = 10 Case 2 : ad = bc condition satisfies when (1) a = 2, d - 3 then (a) b = 2, c = 3 (b) b = 3, c = 2 or a = 3, d = 2 then (a) b = 2, c = 3 (b) b = 3, c = 2 So you can see for two different prime number for a and d there are 4 possible value of b and c which satisfy ad = bc condition.
Two different values of a and d can be chosen from 10 prime numbers =
ways And for each combination of a and d there are 4 possible values of b and c. Total possible values =
4 From case I and case II total possible values of 10 prime numbers which satisfy ad = bc condition = 10 +
4 For sample space, Number of ways to fill element a of matrix A = chose any prime number among 10 available prime number =
ways Similarly, For element b of matrix A =
ways For element c of matrix A =
ways For element d of matrix A =
ways Sample space =
= 104 Probability
Total number of relations Relations that are symmetric as well as transitive are favourable cases
Number of one-one function from to set is .
The required possible set of value (f(a), such that are , and Required probability