P.

27 Q40
n(S) = no. of combination of getting 25 fish out of N fish in the pond = NC25
n(E) = no. of combination of getting 3 marked fish (out of 20 marked fish, 20C3 ways) and 22 (= 25
3) non-marked fish
= 20C3 (N 20)C22
C
C
20 19 18 ( N 20 )!25!( N 25 )!
PN = 20 3 N 20 22 =
(Here N > 42)
3!22!( N 42 )! N !
N C 25
=

15732000 ( N 20 )! ( N 25 )!
N !( N 42 )!

Hence,
PN
( N 20 )! ( N 25 )!
( N 1)! ( N 43 )!
( N 20 )( N 25 )
N 2 45 N + 500

=
=
=
N !( N 42 )!
( N 21)! ( N 26 )!
N ( N 42 )
PN 1
N 2 42 N
Now,
PN < PN1
PN

< 1 (PN1 > 0)

PN 1
N 2 45 N + 500
< 1 (for N > 42)
N 2 42 N
45N + 500 < 42N

N >
Note:

500
3
500
, by above, when N 167, PN is decreasing, i.e. P167 < P166, P168 < P167, and so
= 166. 6
3

on. Also, for N < 167, PN is increasing, i.e. P43 < P44 < P45 << P165 < P166 > P167 > P168 > P169 >
Thus maximum value of PN is P166 and hence N0 = 166.