Random Sampling
A sample is random when a chance mechanism selects the units. In a simple random sample of size $n$, every sample of that size is equally likely: number the population, generate random numbers, take the matching units, skipping repeats (without replacement) or allowing them (with replacement). Stratified sampling splits the population into homogeneous strata and runs an SRS within each, guaranteeing representation and steadying the estimate. Cluster sampling randomly selects whole groups, ideally each a miniature of the population, and measures everyone inside. Systematic sampling takes a random start and a fixed interval.
The traps are all substitutions. Haphazard stands in for random: whoever walks by, whoever replies first, whatever looks typical, none of which is a chance mechanism. Cluster gets called stratified because both involve groups, though one samples within every group and the other takes all of some groups. A systematic sample gets called an SRS though most samples are impossible under it. And when a sampling plan has a flaw, the reflex is to enlarge it, as if more of the same selection could repair how the selecting is done.
The work
Lesson live · diagnostic and drills coming soon
Lesson
Random Sampling
›
Builds the SRS from its labeling-and-generating mechanism, then stratified, cluster, and systematic sampling, with the exact condition that makes stratifying worth it and the within-versus-all contrast that keeps cluster and stratified apart.
Diagnostic
10-item topic check
›
Ten items on sampling designs: naming the method from a study description, running SRS mechanics, choosing when to stratify, and resisting the idea that unpredictable or big means random. Take it cold to find the design you blur, or after the lesson to confirm you no longer do.
Targeted Practice
Drill a single misconception
›
Pick one of the failure modes you missed and drill it on its own. The round is adaptive: two correct in a row clears it for now and moves you to the next. Two in a row is a checkpoint, not proof: if the error resurfaces later, the misconception comes back.