Академический Документы
Профессиональный Документы
Культура Документы
k2
(4-1)
n
n!
=
k ( n k )! k !
PILLAI
n k nk
p q
k
2
1
e ( k np ) / 2 npq .
2 npq
(4-2)
k2
k1
where
x1 =
x2
1
1 y2 / 2
( x np ) 2 / 2 npq
e
dx =
e
dy , (4-3)
x1
2npq
2
k np
k 1 np
, x2 = 2
.
npq
npq
1
2
x
0
ey
/2
dy = erf ( x )
(4-4)
2
PILLAI
For example, if
x1
and
x2
P (k 1 X k 2 ) = erf ( x 2 ) erf ( x1 ).
(4-5)
Here
x1 =
x2
x1
1 y2 / 2
e
dy .
2
k np
k 1 np
5
5
= , x2 = 2
= .
7
7
npq
npq
PILLAI
erf ( x ) =
x
0
y2 / 2
dy = G ( x )
1
2
erf(x)
erf(x)
erf(x)
erf(x)
0.05
0.10
0.15
0.20
0.25
0.01994
0.03983
0.05962
0.07926
0.09871
0.80
0.85
0.90
0.95
1.00
0.28814
0.30234
0.31594
0.32894
0.34134
1.55
1.60
1.65
1.70
1.75
0.43943
0.44520
0.45053
0.45543
0.45994
2.30
2.35
2.40
2.45
2.50
0.48928
0.49061
0.49180
0.49286
0.49379
0.30
0.35
0.40
0.45
0.50
0.11791
0.13683
0.15542
0.17364
0.19146
1.05
1.10
1.15
1.20
1.25
0.35314
0.36433
0.37493
0.38493
0.39435
1.80
1.85
1.90
1.95
2.00
0.46407
0.46784
0.47128
0.47441
0.47726
2.55
2.60
2.65
2.70
2.75
0.49461
0.49534
0.49597
0.49653
0.49702
0.55
0.60
0.65
0.70
0.75
0.20884
0.22575
0.24215
0.25804
0.27337
1.30
1.35
1.40
1.45
1.50
0.40320
0.41149
0.41924
0.42647
0.43319
2.05
2.10
2.15
2.20
2.25
0.47982
0.48214
0.48422
0.48610
0.48778
2.80
2.85
2.90
2.95
3.00
0.49744
0.49781
0.49813
0.49841
0.49865
Table 4.1
4
PILLAI
2
1
ex /2
2
x1
x2
x1
(b)
Fig. 4.1
x2
x1 < 0, x2 > 0
PILLAI
Fig. 4.2
PILLAI
= = is a constant,
np
T
However in this case
T
and the normal approximation is invalid here.
Suppose the interval in Fig. 4.2 is of interest to us. A call
inside that interval is a success (H), whereas one outside is
a failure (T ). This is equivalent to the coin tossing
situation, and hence the probability Pn ( k ) of obtaining k
calls (in any order) in an interval of duration is given by
the binomial p.m.f. Thus
Pn ( k ) =
n!
p k (1 p ) n k ,
( n k )! k !
(4-6)
n ( n 1) " ( n k + 1) ( np ) k
n k
(
1
/
)
Pn ( k ) =
np
n
nk
k!
1
2
k 1 k (1 / n ) n
= 1 1 " 1
.
k
n
n
n k ! (1 / n )
Thus
k
lim
Pn ( k ) =
e ,
n , p 0 , np =
k!
(4-7)
(4-8)
k 1
as well
lim 1 = e .
n
n
The right side of (4-8) represents the Poisson p.m.f and the
Poisson approximation to the binomial r.v is valid in
situations where the binomial r.v parameters n and p
diverge to two extremes ( n , p 0 ) such that their
product np is a constant.
8
PILLAI
6
Total no. of tickets
2 10
k
,
k!
= P( X 1) = 1 P( X = 0) = 1 e 0.005.
9
PILLAI
P ( X 1) 0 .95 .
P ( X 1) = 1 e 0 .95 implies ln 20 = 3 .
PILLAI
P ( X 5) = 1 P( X 4) = 1 e
k =0
4
k
k
2
= 1 e
k!
k = 0 k!
4 2
= 1 e 2 1 + 2 + 2 + + = 0.052.
3 3
P( A B )
, P( B ) 0.
P( B )
(4-9)
PILLAI
F X ( x | B ) = P { X ( ) x | B
}=
P { ( X ( ) x ) B
P(B)
}.
(4-11)
F X ( + | B ) =
}=
P(B )
= 1,
P(B )
) B } = P ( ) = 0 .
P(B)
(4-12)
Further
P ( x 1 < X ( ) x 2 | B ) =
P { ( x 1 < X ( ) x 2 ) B }
P(B)
= F X ( x 2 | B ) F X ( x 1 | B ),
(4-13)
12
PILLAI
( X ( ) x 2 ) = ( X ( ) x1 ) (x1 <
X ( ) x 2 ) .
(4-14)
dFX ( x | B )
,
dx
(4-15)
f X ( u | B ) du .
(4-16)
x2
x1
f X ( x | B ) dx .
(4-17)
13
PILLAI
FX ( x )
FX (x)
FX (x | B)
1
(a)
Fig. 4.3
1
(b)
14
PILLAI
For
0 x < 1,
{X ( ) x } = { T }, so that
{ ( X ( ) x ) B } = { T } { H } = and FX ( x | B ) = 0.
For
x 1,
{X ( ) x } = , and
P( B )
=1
{ ( X ( ) x ) B } = { B } = { B } and FX ( x | B) =
P( B )
P { (X x ) (X a ) }
.
P (X a )
(4-18)
15
PILLAI
P (X x )
FX (x)
.
=
P (X a )
FX (a )
For x a , ( X x ) ( X a ) = ( X a ) so that
Thus
FX ( x )
,
FX ( x | B ) = FX (a )
1,
(4-19)
FX ( x | B ) = 1.
x < a,
x a,
(4-20)
and hence
fX (x)
,
d
fX (x | B) =
FX ( x | B ) = FX (a )
dx
0 ,
x < a,
(4-21)
otherwise.
16
PILLAI
FX ( x | B )
f X ( x | B)
f X ( x)
FX ( x )
a
(b)
(a)
Fig. 4.4
(4-22)
(4-23)
17
PILLAI
FX (b ) FX (a )
FX (b ) FX (a )
X ( ) x }
(4-24)
f X ( x | B ) = FX (b ) FX (a )
0,
a < x b,
otherwise.
(4-26)
f X ( x | B)
f X ( x)
Fig. 4.5
x
18
PILLAI
Let
B = {x 1 < X ( ) x 2 }
P (B | A)P ( A)
.
P(B)
(4-27)
(4-17))
P {A | ( x 1 < X ( ) x 2 ) } =
P (( x 1 < X ( ) x 2 ) | A )P ( A )
P (x 1 < X ( ) x 2 )
F ( x | A ) F X ( x1 | A )
= X 2
P ( A) =
F X ( x 2 ) F X ( x1 )
x2
f X ( x | A ) dx
x1
x2
x1
f X ( x ) dx
P ( A ).
(4-28)
19
PILLAI
Further, let
x1 = x, x2 = x + , > 0,
lim P {A | ( x < X ( ) x + ) } = P ( A | X ( ) = x ) =
0
f X ( x | A)
P ( A ).
fX (x)
0,
(4-29)
or
f X |A ( x | A ) =
P( A | X = x) fX (x)
.
P ( A)
(4-30)
P ( A ) f X ( x | A ) dx =
or
P ( A | X = x ) f X ( x ) dx ,
(4-31)
P ( A) =
(4-32)
P ( A | X = x ) f X ( x ) dx
P( A | X = x) fX (x)
P ( A | X = x ) f X ( x ) dx
(4-33)
20
PILLAI
P ( A | P = p ) = p k q nk ,
(4-34)
0
Fig.4.6
p
21
PILLAI
1
0
P ( A | P = p ) f P ( p ) dp =
1
0
p k (1 p ) n k dp =
( n k )! k !
.
( n + 1 )!
(4-35)
P|A
( n , k ).
(4-36)
Fig. 4.7
PILLAI
1
0
P ( B | P = p ) f P ( p | A ) dp .
(4-37)
1
0
( n + 1)!
k +1
k nk
.
p
p q dp =
( n k )! k !
n+2
(4-38)
23
PILLAI
24
PILLAI
PILLAI
k 1 log x dx <
k +1
log x
n +1
log k
1
k 1 k k +1
(4-40)
26
PILLAI
(4-41)
This gives
an an +1 = log n ! ( n + 12 ) log n + n log( n + 1)!
+ ( n + 23 ) log( n + 1) ( n + 1)
= log( n + 1) ( n + 12 ) log n + ( n + 23 ) log( n + 1) 1
= ( n + ) log
1
2
1According
n +1
n
n + 12 + 12
1 = ( n + ) log n + 1 1 1.
1
2
2 2
(n + 12 )log
n n is due
27
PILLAI
Hence1
1
1
+
an an +1 = ( n + 12 ) log( 1 2 n1+1 ) 1
2 n +1
(4-42)
n + 12 n
(4-44)
n! ~ e n e .
To find the constant term c in (4-44), we can make use of
a formula due to Wallis ( 1655).
1By
1
(1 x )
28
1 2 1 3 1 4
= x+2 x +3 x +4 x +"
PILLAI
sin x
The well known function sinx x = sinc x
x
goes to zero at x = n ;
moreover these are the only
n
or [for a proof of this formula, see chapter 4 of Dienes,
The Taylor Series]
sin x = x (1 )(1
x2
2
x2
4 2
)" (1
x2
n 2 2
)",
PILLAI
(2 n )2
4 n2
62
22
42
= (2 n 1)(2 n +1) = (1 3 )( 3 5 )( 5 7 )" ( (2 n 1)(2 n+1) )"
2 n =1
= (1 2354" 6(2"n2n1)"" ) 2 2 n1+1".
Thus as n , this gives
or
6 " 2n
= 1 2354"
(2 n1)
1
n+ 1
2
"
2
(2 4 6 " 2 n )2 1
2 n ( n!)
1 .
=
"=2
(2 n )!
(2n )! n + 1
n+1
Thus as n
(4-46)
30
PILLAI
of (4-46) we get
log = c 12 log 2 lim 12 log(1 + 21n ) = c 12 log 2
n
which gives
(4-47)
e c = 2 .
With (4-47) in (4-44) we obtain (4-39), and this proves
the Stirlings formula.
Upper and Lower Bounds
It is possible to obtain reasonably good upper and
lower bounds for n! by elementary reasoning as well.
To see this, note that from (4-42) we get
an an +1
< 13 1 2 + 1 4 "
(2 n +1) (2 n +1)
31
PILLAI
an < c + 121n
1
n + 12 n 112 n 2
n ! < 2 n e
Similarly from (4-42) we also have
(4-48)
2 n
n + 12 n
e e
1
12 n +1
< n ! < 2 n
n + 12 n
1
12 n
e e .
(4-50)
( x ) = 2 e x
x 12
139 + o( 1 )
1 + 121x + 2861 x2 51840
x3
x4
(4-51)
33
PILLAI
function. Since
n!
n k n k
k n k
=
p
q
p
q ,
(4-52)
k
( n k )! k !
using (4-50) on the right side of (4-52) we obtain
and
where
and
n k n k
k p q > c1
n k n k
k p q < c2
{
c1 = e
n
2 ( n k ) k
n
2 ( n k ) k
1
1
1
12 n +1 12 ( n k ) 12 k
{
c2 = e
( )( )
np k nq n k
k
n k
( )( )
np k nq n k
k
n k
}
}.
1
1
1
12 n 12 ( n k ) +1 12 k +1
34
PILLAI