2.3 Simple Random Sampling • Simple random sampling without replacement (srswor) of size n is the probability sampling design for which a fixed number of n units are selected from a population of N units without replacement such that every possible sample of n units has equal probability of being selected. A resulting sample is called a simple random sample or srs.
• Note: I will use SRS to denote a simple random sample and SR as an abbreviation of ‘simple random’.
• Some necessary combinatorial notation:
– (n factorial) n! = n × (n − 1) × (n − 2) × · · · × 2 × 1. This is the number of unique arrangements or orderings (or permutations) of n distinct items. For example: 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720. N N(N − 1) ··· (N − n + 1) N! – (N choose n) = = . This is the n n! n!(N − n)! number of combinations of n items selected from N distinct items (and the order of 6 6! (6)(5)(4!) (6)(5) selection doesn’t matter). For example, = = = = 15. 2 2!4! 2!4! (2)(1)