Your Equation

Library / Probability distributions / PRD-44

Probability distributions

Sampling without replacement: count variance

Variance of the sample count: the binomial variance multiplied by the finite-population factor (N − n)/(N − 1), which falls to zero when the whole lot is sampled.

Ref
PRD-44
Rev
v1
Field
Probability distributions
Result
Var[X]

The variance is the binomial variance n(K/N)(1 − K/N) multiplied by the finite-population factor (N − n)/(N − 1). The factor falls to zero when the whole lot is sampled, because the count is then known exactly. For samples below about 10 % of the lot it is close to 1.

Variance of the sample count: the binomial variance multiplied by the finite-population factor (N − n)/(N − 1), which falls to zero when the whole lot is sampled.

Calculator

Solve for
20200
020
120
  • Finite-population factor, (N − n)/(N − 1)0.9184
  • Standard deviation of the count0.7856
  • Variance if sampling with replacement0.672

What drives the result

Each variable is moved across its typical range while the others stay at the values above. The longest bar is the key driver.

Variance of the count () current value 0.6171
nSample size nKey driver
0.1341.65
KItems of the type in the lot K
01.1
NLot size N
0.1880.947
  • The count has a standard deviation of 0.786, 4.17 % tighter than with replacement because the lot is finite.
  • Sampling the whole lot (n = N) would leave no variance at all: the count would be known exactly.
Chart data as tables

Ranked variables

VariableTypical rangeLowest resultHighest resultSwing ()Local stepChange in result
n Sample size n1 to 20 0.13441.6461.511+1 +17.3 %
K Items of the type in the lot K0 to 20 01.1021.102+1 +9.82 %
N Lot size N20 to 200 0.18810.94740.7592+1 −1.42 %

Sweep of Sample size n

Sample size nVariance of the count
10.1344
3.3750.4316
5.750.6979
8.1250.9332
10.51.138
12.881.311
15.251.454
17.631.565
201.646

Sweep one variable

Variance of the count ()Hover, touch, or use the arrow keys on the chart
0.511.5 5101520 Sample size n now 0.6171

Variables and how each one contributes

Var[X]

Variance of the count

Result ·

What the equation gives you. Everything else feeds it.

N

Lot size N

· typical 20 to 200

The lot size (a count): the total number of items. A larger lot behaves more like sampling with replacement. Raising it by 10 (to 60) moves the result by −12.7 %, from 0.6171 to 0.5386.

K

Items of the type in the lot K

· typical 0 to 20

The number of items of the specified type in the lot (a count), such as defectives. More items of the type raise the chance of finding them. Raising it by 1 (to 9) moves the result by +9.82 %, from 0.6171 to 0.6778.

n

Sample size n

· typical 1 to 20

The sample size (a count): the number of distinct items drawn. A larger sample finds more of the type and reduces the variance. Raising it by 1 (to 6) moves the result by +17.3 %, from 0.6171 to 0.7241.

Worked example with the values above

  1. Binomial part: n(K/N)(1 − K/N) = 0.672.
  2. Finite-population factor: (N − n)/(N − 1) = 0.91837.
  3. Var = 0.61714.

Assumptions and limits

  • Items are drawn at random without replacement from a finite lot, and every item is equally likely to be chosen.
  • N, K, n and x are whole numbers with 0 ≤ K, n ≤ N.

Common mistakes

  • Using the binomial formula for a large share of a small lot: the finite-population correction matters when n/N is above about 10 %.
  • Sampling convenient items instead of choosing at random.
  • Entering an x outside the possible range: the probability is then exactly zero.

Statistics and uncertainty

A mean, variance or percentile is calculated from fitted parameters, and the uncertainty in those parameters passes straight through. A distribution fitted to a small sample can have parameters that are far from the truth, especially in the tails and for the variance, so quote the result together with the sample size it rests on.

Where it is used

  • Acceptance sampling and inspection of finite lots.
  • Quality audits, card-style problems and capture–recapture estimates.

Maths you need

  • Combinations: ways of choosing items, C(n, k)
  • Sampling without replacement: draws that remove the item chosen

Related formulas

Practise this formula