=) 5 =

I [1]

5 =
as""(
[1]
cas"

5 =
E (0 +

Na-a) as 3: =0 (7)

5 = Fa.a by Fa
=

* (k]

- I Fa(z]

=
2) T .
P .
PCAUB) +
PCACUBY 1 +

PAYB) +

PCAnBY

use D M .
: [1]

PCCAnBC) = 1 +
PCAnB) +

PlAnBY
PCAUB) +

213 <prove later)

use C R .
:

PCAUB) + 1 -

PCAB) = 1 +

PCAnB) +

PCAnBY

re-order :

PCABLE pCAnB) +

PCACD) +

PCAnBY
(H)

O
(AnBLUCAB)u(AnBY R
that A
AVB)=

=O
Not
-

- ↑

/
=(x))u( (u(E) ...
=

:
-
,

which is a disjoint union

[1]

S R that (*)
because disjointless
:

the .
.

proves

is true .
[11

C R
proof of .
.

SR
A2

1 -
PCS) =
PCAVA = PCA) + PLA) (1]

P(AC) disjoint
where PCA) and ar

3)
sy ory
4 Suits A ,
B .
L ,
D

without replacement
N
= (=) [12
without ordering

p = crandom sampling) (1)

na
- (i)(i)(2)")=) <as
-

explanation of each sins I point

= ils = )
rence p =

C )

ya) T

P ordering matters
for ,

for C ,
it does not

with ~ items ,
there are r! orderings

P
50
-
=

r ! cano possible with

formulass

[11 answer

(1) reasoning

467 without ordering

:
AB ,
AC
, BC

with ordering AB BA Al LA BC CB
:

, ,
, , ,

With
Ordering
10 2.
=

2
,
i e
. .
Evice as Many

anywar above
10 it matches .