Ordered samples:

 Sampling with replacement: the object is replace before the next is chosen. Now since there are n different ways
to choose each object, there are by the fundamental principle of counting

r times

n. n. n… …= nr different ordered samples with replacement of size r

 sampling without replacement: the object is not replacement before the next is chosen. Thus there is no repetition
in the ordered sample. In other words, an ordered sample of size r without replacement is simply an r-permutation
of the n objects.

𝑛!
P n, r = n n − 1 n − 2 … … (n − r + 1) =
(𝑛 − 𝑟)!
Different ordered samples of size r without replacement from a population of n objects.
Ex.8:

In how many ways can one choose three cards in succession from a peak of 52 cards

i) With replacement
ii) Without replacement?

If each card is replaced in the pack before the next card is chosen, then each card can be chosen in 52 different
ways. Hence there are:

52*52*52 = 523 = 140608 different ordered samples of size 3 with replacement.

On the other hand of there is no replacement, then the first card can be chosen in 52 different ways, the second
in 51 different ways, and third and last card in 50 different ways, thus there are 52*51*50 = 132600
different ordered samples of size 3 without replacement.
Combinations:

A combination of n objects taken r at a time or r-combination, is any subset of r elements. In other words, an r-
combination is any selection of r of the n objects where order does not count.

Ex.9:
The combinations of the letters a, b, c, d taken 3 at a time are:
{a,b,c},{a,b,d},{a,c,d},{b,c,d}, or simply abc, abd, acd, bcd.
Observe that the following combinations are equal:
abc, acb, bac, bca, cab, cba
That is, each denotes the same set {a,b,c}
The number of combinations of n objects taken r at a time will be denoted by C(n, r).
Before we give the general formula for C(n, r), we consider special case.
Ex.10:
We determine the number of combinations of the four letters a, b, c, d taken 3 at a time. Note that each
combination consisting of three letters determines 3! = 6 permutations of the letters in the combination:

Combinations Permutations
abc abc, acb, bac, bca, cab, cba
abd abd, adb, bad, bda, dab, dba
acd acd, adc, cad, cda, dac, dca
bcd bcd, bdc, cbd, cdb, dcb, dbc

Thus the number of combinations multiplied by 3! Equals the number of permutations:

C (4, 3).3! = P (4, 3) or C (4, 3) = P (4, 3)/3!
Now P (4, 3) = 4*3*2 = 24 and 3! = 6 hence C (4, 3) = P (4, 3)/3! = 24/6 = 4 as noted above.
Since each combination of n objects taken r at a time determines r! permutations of the objects, we can conclude
that P (n, r) = C (n, r) r!
𝑃(𝑛,𝑟) 𝑛!
Thus we obtain 𝐶 𝑛, 𝑟 = = 𝑟!(𝑛−𝑟)!
𝑟!

Theorem:
𝑷(𝒏, 𝒓) 𝒏!
𝑪 𝒏, 𝒓 = =
𝒓! 𝒓! (𝒏 − 𝒓)!
𝒏!
Recall that the binomial coefficient ( 𝐧𝒓 ) was defined to be ; hence
𝒓!(𝒏−𝒓)!

C (n, r) = ( 𝒓𝐧 )
Ex.11:
𝑛 𝑛!
How many combinations of 3 can be formed from 8 people? 𝐶 𝑛, 𝑟 = =
𝑟 𝑟! 𝑛−𝑟 !

Each committee is essentially a combination of the 8 people taken 3 at a time, thus

8! 8∗7∗6∗5!
C (8, 3) = ( 83 ) = 3!(8−3) = 3!∗5! = 56 different commit les can be formed.
 Ordered partitions:
Let A contain n elements, and let n1, n2, …., nr be positive integers with
n1 + n2 + + nr = n then there exist.
n!/(n1!. n2!.....nr!) different ordered
partitions of A of the form (A1, A2, , Ar) where A1 contains n1 elements, A2 contains n2 elements, …. and Ar
contains nr elements.

Ex.12:
In how many ways can 9 toys be divided between 4 children if the youngest child is to receive 3 toys and each of
other children 2 toys?
We wish to find the number of ordered partitions of the 9 toys into 4 all containing 3, 2, 2 and 2 toys respectively.
By the above theorem, there are
9!
= 7560
3! 2! 2! 2!
Such ordered partitions
9∗8∗7 6∗5 4∗3 2∗1
( 39 6
2
4
).( ).( ).( )=
2
2
2
. . . = 7560
3∗2∗1 2∗1 2∗1 2∗1