Scribd
Upload
96 views

Unordered Sampling With Replacement

The document discusses sampling methods and provides a proof of the formula for unordered sampling with replacement. It also explains multinomial coefficients and the multinomial theorem. Finally, it derives the formula for the total number of possible intersections of independent events as 2n_n_1.

Uploaded by

Sonya Shrideh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
96 views

Unordered Sampling With Replacement

The document discusses sampling methods and provides a proof of the formula for unordered sampling with replacement. It also explains multinomial coefficients and the multinomial theorem. Finally, it derives the formula for the total number of possible intersections of independent events as 2n_n_1.

Uploaded by

Sonya Shrideh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Yarmouk University

Hijjawi Faculty of Engineering Technology


Wireless Communications
Random processes

Proof of unordered sampling with replacement.


Multinomial coefficients.
(𝟐𝒏 _𝒏_𝟏) Formula in independent test.

Student name:
Sonia Alshrideh
2020976010

Supervised by:
Dr.Rami Halloush
1.The aim of the report
In this report I talked about a sampling , and proof of the unordered sampling
with replacement formula. Then I explained about the meaning of Multinomial
theorem and multinomial coefficients .Finally, I explained about ( 𝟐𝒏 _𝒏_𝟏 )
formula in independent test.

2. Introduction
Sampling is Choosing an element from a set in which each element of a set has
equal chance of being chosen, in counting methods we select elements by
using five methods and unordered sampling with replacement is one of these
methods ]3[ .

3. Methodology
3.1 Proof of unordered sampling with replacement
If we have a set 𝐴 = {1,2,3, … , 𝑛 } and I want to choose K time in order
does not matter and with replacement ]3[ ]1[.
Let:
X1: number of 1
X2: number of 2
X3: number of 3
Xn: number of 4
𝑋1 + 𝑋2 + 𝑋3 + 𝑋4 + 𝑋5 = 𝐾
where 𝑥 ∈ {0,1,2,3} ; nonnegative number
If we suppose that :
𝑋1 + 𝑋2 + 𝑋3 + 𝑋4 + 𝑋5 = 8
Then 2 + 3 + 0 + 1 + 2 = 8
We replace the numbers with code” / ” to become the equation in this shape:
//+///+ +/+//= 8
Now we will make a sequence by using “/“𝑠 and “ + ”𝑠 ; there are eight “/”𝑠
And four “ + ”𝑠 .
Let 𝑀 = 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 “/”𝑠 𝑎𝑛𝑑 𝑅 = 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 “ + ”𝑠
then 𝑀 + 𝑅 = 12

( 𝑀+𝑅
𝑀
) = ( 𝑀+𝑅
𝑅
) ➔ (12
4
) =( 12
8
)
In general :
𝑋1 + 𝑋2 + 𝑋3 + 𝑋4 + 𝑋5 = 𝐾
If we suppose that
𝐾 = 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 “/”𝑠 𝑎𝑛𝑑 (𝑛 − 1) = 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 “ + ”𝑠
Then :

(𝑛+𝑘−1
𝑘
) = ( 𝑛+𝑘−1
𝑛−1
)

3.2 Multinomial coefficients


while the binomial coefficient is a general case of k=2, the multinomial
coefficient used to find permutations when we duplicate values for k; it is a
general case of binomial coefficient.

Suppose that 𝑘1, 𝑘2, … . 𝑘𝑚 are positive integers and 𝑘1 + 𝑘2 + ⋯ + 𝑘𝑚 = 𝑛

then [2] :

𝑚=𝑖
𝑛
(𝑘1 𝑘2 𝑘3 ...𝑘𝑚
𝑛
) = (𝑘1 ) (𝑛−𝑘1
𝑘2
) (𝑛−𝑘1−𝑘2
𝑘3
) … ( 𝑘1𝑛−∑ 𝑖=1 𝑘𝑖 )
𝑘2 𝑘3 ...𝑘𝑚
3.2.1 Multinomial theorem
Multinomial theorem is a general case of binomial theorem to more than two
variables.
Multinomial theorem formula is [2]:

3.2.2 Example : the number of distinct permutations of the letters in the word
MISSISSIPPI [2].
Solution :
𝐾1 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑀 𝑖𝑛 𝑡ℎ𝑒 𝑤𝑜𝑟𝑑 = 1
𝐾3 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑆 𝑖𝑛 𝑡ℎ𝑒 𝑤𝑜𝑟 = 4
𝐾2 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝐼 𝑖𝑛 𝑡ℎ𝑒 𝑤𝑜𝑟𝑑 = 4
𝐾4 = 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑃 𝑖𝑛 𝑡ℎ𝑒 𝑤𝑜𝑟𝑑 = 2
𝑁 = 𝐾1 + 𝐾2 + 𝐾3 + 𝐾4 = 11
11!
(𝑘1 𝑘2𝑛𝑘3 𝑘4) = (1 4114 2) = = 34650
1! 4! 4! 2!

4. (𝟐𝒏 _𝒏_𝟏) the total number of tests


The event A1, A2, A3,. . . . ,An are said to be independent if for K=2, ……,n
𝑝[𝐴𝑖1 ∩ 𝐴𝑖2 ∩ 𝐴𝑖3, . . . . . . , 𝐴𝑖𝑘] = 𝑝(𝐴𝑖1)𝑝(𝐴𝑖2)𝑝(𝐴𝑖3). . . . . . 𝑃(𝐴𝑖𝑘)
where 1 ≤ i1 < i2 < ik <. . . . ≤ n ]1[ .
For a set of n events the probabilities of all possible intersections factor can
be found by 2n _ n _1 ]1[ .
This formula is abbreviation to (n2)_(nn)_(n0) .
Proof:
n
By using binomial theorem ; for k=2 ➔(2) = 2n

for k=3 ➔(n3) = 3n

for k=4 ➔(n4) = 4n

for k=n ➔(nn) =1


𝑛 n n
Now,the total number of test = ∑n
k=2(𝑘 ) =(2) + (3 ) +
(n4)+. . . . . +(nn)
By applying to binomial theorem if we assumed a=b=1

2n = ∑nk=0 (𝑛𝑘) ➔ 2n = (n0)(n1) + ∑nk=2(𝑛𝑘) ➔∑nk=2(𝑛𝑘) = 2n _(n0)_(n1)


➔ 2n _n_1
References:
]1[Leon_Garcia,alberto. (2008). Probability, Statistics, and Random Processes
for Electrical Engineering, Pearson prentice Hall: USA
]2[ https://www.youtube.com/watch
]3[ http://www-unix.ecs.umass.edu/~dgoeckel/Disc_3_2018-no_sol.pdf

You might also like