0% found this document useful (0 votes)
14 views

SOL Probability Numerical DTS-12.PDF

The document contains a series of mathematical problems and solutions related to probability, combinatorics, and numerical values. Each problem is numbered and includes calculations for favorable cases, total cases, and probabilities. The solutions involve various mathematical concepts, including combinations, arrangements, and conditional probabilities.

Uploaded by

Sunil Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views

SOL Probability Numerical DTS-12.PDF

The document contains a series of mathematical problems and solutions related to probability, combinatorics, and numerical values. Each problem is numbered and includes calculations for favorable cases, total cases, and probabilities. The solutions involve various mathematical concepts, including combinations, arrangements, and conditional probabilities.

Uploaded by

Sunil Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Numerical Value Type Daily Tutorial Sheet - 12

141.(11) Number of favorable cases  10C5  Dearrangement of 5 objects

1 1 1 1 1 1
 10C5  5       
 0 1 2 3 4 5
Total cases  10
10
C5  44 10  44 44 11
Probability    
10 5  5  10 120  120 3600
k = 11

8
142.(12) There are 8 even and 9 odd numbers. So probabilities of getting first even number is
17
9 8 9 72
and probabilities of getting second odd number  , so required probabilities   
17 17 17 289

k  72  23  32
Number of divisors = 4 × 3 = 12

10  9
143.(1) Sum of all numbers between 1 to 9, 1 + 2 + … 9  = 45, and 1 + 2 + 6 + 3 + 6 = 18, total is
2
18 + 45 = 63 which is divisible by 9. so whatever the arrangement the number will always be
divisible by 9. so probability is one.

144.(7) A number has exactly 3 factors if the number is square of a prime number.
Squares of 11, 13, 17, 19, 23, 29, 31 are 3-digit numbers.
7
Required probability   k 7
900

145.(0.5) n(A) = total numbers divisible by 2, n(B) = total numbers divisible by 6


n(C) = total numbers divisible by 8
Hence, n ( A  B  C )  n ( A )  100
100 
Required probability  
200 2

1  4p 1 3
146.(0.5) 0 1   p  …(i)
4 4 4
1 p
0  1  1  p  1 …(ii)
2
1  2p 1 1
0 1   p  …(iii)
2 2 2
Also, 0  P ( A  B  C )  1
1  4 p 1  p 1  2p
 0   1
4 2 2
5  2p 1 5
 0 1  p …(iv)
4 2 2
1 1 1
From (i), (ii), (iii) and (iv) p  p
2 2 2

Mathematics 28 Solutions | Probability


147.(0.48) P ( A  B  C )  P ( A )  P ( B )  P (C )  P ( A  B )  P ( B  C )  P ( A  C )  P ( A  B  C )
 0.3  0.4  0.8  0.08  P ( A  C )  0.28  0.09  1.23  P ( B  C )
Now, 0.75  1.23  P ( B  C )  1  0.23  P ( B  C )  0.48

148.(12.25) The problem is of conditional probability. Total cases in which at least one of the cubes is red
painted is 125 –27 = 98 out of which 8 are painted on three sides.
8 4 1
 Probability   
98 49 k
k = 12.25

149.(16) Favorable cases m  6C2  2C1  2C1  2C1  2C1

Total cases  n  12C8

m 16
Required probability  
n 33

150.(18.75) n(S) = 8 × 8 = 64
Square values that product can take are 1, 4, 9, 16, 25, 36, 49, 64
4 : (1, 4), (2, 2), (4, 1)
16: (2, 8), (4, 4), (8, 2)
For other values, there is only one way of getting the product.
n(E) = 2 × 3 + 6 × 1 = 12
12 3
Probability   k ; 100k = 18.75
64 16

151.(9.375) Case I H H H H H

Case II T H H H H H

Case III T H H H H H

Case IV T H H H H H

Case V T H H H H H

5 6 6 6 6
1  1  1  1  1  3
Required probability                k
2
  2
  2
  2
  2
  32
100k = 9.375

1 2
152.(0.166) P(A )  , P (B ) 
2 3
1
P ( A) 
2
P ( A   B )  P ( A )  P ( B )  P ( A   B )
 P ( A)  P ( B )  1
1 2
  1
2 3
1

6

Mathematics 29 Solutions | Probability


153.(3.2) Favorable cases: 3 C0  3C0  3C1  3C1  3C2  3C2  3C3  3C3  20

Total cases: 23  23  64
20 5
Probability   k
64 16
1
 3.2
k

6!
154.(8.1) Favorable cases   3!  90
(2!)3 3!

Total cases  36
90 10
Probability   k
36 81
1
 8.1
k

155.(212) All three squares will share a common vertex if they will form L shape

We have, n (S )  64C3

Let ‘E’ be the event of selecting 3 squares which form the letter ‘L’
The number of ways of selecting square consisting of 4 unit squares is 7 × 7 = 49
Each square with 4 unit squares from 4 L-shapes consisting of 3 unit squares.
Therefore n ( E )  7  7  4  196
196 7
 P (E )   k
64 1488
C3

1 1488
 
k 7
1 
   212
k 

Mathematics 30 Solutions | Probability

You might also like