Simple random sample
In statistics, a simple random sample is a subset of individuals (a sample) chosen from a larger set (a population). Each individual is chosen randomly and entirely by chance, such that each individual has the same probability of being chosen at any stage during the sampling process, and each subset of k individuals has the same probability of being chosen for the sample as any other subset of k individuals (Yates, Daniel S. (2008). The Practice of Statistics, 3rd Ed. Freeman. ISBN 978-0-7167-7309-2. Unknown parameter |coauthors= ignored (help).mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"\"""\"""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{display:none;font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}). This process and technique is known as Simple Random Sampling, and should not be confused with Random Sampling.
In small populations such sampling is typically done "without replacement", i.e., one deliberately avoids choosing any member of the population more than once. An unbiased random selection of individuals is important so that in the long run, the sample represents the population. However, this does not guarantee that a particular sample is a perfect representation of the population. Simple random sampling merely allows one to draw externally valid conclusions about the entire population based on the sample. Although simple random sampling can be conducted with replacement instead, this is less common and would normally be described more fully as simple random sampling with replacement.
Conceptually, simple random sampling is the simplest of the probability sampling techniques. It requires a complete sampling frame, which may not be available or feasible to construct for large populations. Even if a complete frame is available, more efficient approaches may be possible if other useful information is available about the units in the population.
Advantages are that it is free of classification error, and it requires minimum advance knowledge of the population. It best suits situations where not much information is available about the population and data collection can be efficiently conducted on randomly distributed items. If these conditions are not true, stratified sampling or cluster sampling may be a better choice.

# Distinction between a random sample and a simple random sample
In a simple random sample, one person must take a random sample from a population, and not have any order in which one chooses the specific individual.
Let us assume you had a school with a 1000 students, divided equally into boys and girls, and you wanted to select 100 of them for further study. You might put all their names in a drum and then pull 100 names out. Not only does each person have an equal chance of being selected, we can also easily calculate the probability of a given person being chosen, since we know the sample size (n) and the population (N) and it becomes a simple matter of division:
n/N or 100/1000 = 0.10 (10%)
This means that every student in the school has a 10% or 1 in 10 chance of being selected using this method.
If a systematic pattern is introduced into random sampling, it is referred to as "systematic (random) sampling". For instance, if the students in our school had numbers attached to their names ranging from 0001 to 1000, and we chose a random starting point, e.g. 533, and then pick every 10th name thereafter to give us our sample of 100 (starting over with 0003 after reaching 0993). In this sense, this technique is similar to cluster sampling , since the choice of the first unit will determine the remainder.
There are a number of potential problems with simple and systematic random sampling. If the population is widely dispersed, it may be extremely costly to reach them. On the other hand, a current list of the whole population we are interested in (sampling frame) may not be readily available. Or perhaps, the population itself is not homogeneous and the sub-groups are very different in size. In such a case, precision can be increased through stratified sampling .
Some problems that arise from random sampling can be overcome by weighting the sample to reflect the population or universe. For instance, if in our sample of 100 students we ended up with 60% boys and 40% girls, we could decrease the importance of the characteristics for boys and increase those of the girls to reflect our universe, which is 50/50.

# Sampling a dichotomous population
If the members of the population come in two kinds, say "red" and "black", one can consider the distribution of the number of red elements in a sample of a given size. That distribution depends on the numbers of red and black elements in the full population. For a simple random sample with replacement, the distribution is a binomial distribution. For a simple random sample without replacement, one obtains a hypergeometric distribution.