Skip to content

Mathematics and Statistics · Ch 10 — Partition Values

Partition Values for a Discrete Frequency Distribution

3

Partition Values for a Discrete Frequency Distribution

When data are given as distinct values with frequencies (a discrete frequency distribution), the observations are not listed one by one, so we locate a partition value through the less-than cumulative frequency column.

Method.

  1. Arrange the values xx in ascending order and write the frequencies ff.
  2. Build the less-than cumulative frequency (cfcf) column and find N=∑fN = \sum f (the total frequency).
  3. Compute the required position, using (N+1)(N+1) exactly as for raw data:
Note

Position Formulas (Discrete Frequency Distribution)

Qi: i(N+1)4,Dj: j(N+1)10,Pk: k(N+1)100.Q_i:\ \frac{i(N+1)}{4}, \qquad D_j:\ \frac{j(N+1)}{10}, \qquad P_k:\ \frac{k(N+1)}{100}.

  1. Read down the cfcf column: the partition value is the value of xx whose cumulative frequency first reaches (or exceeds) that position.

Worked illustration. For x=10,20,30,40,50x = 10, 20, 30, 40, 50 with f=4,7,12,9,3f = 4, 7, 12, 9, 3:

xxffless-than cfcf
1044
20711
301223
40932
50335

Here N=35N = 35, so N+1=36N + 1 = 36. The Q1Q_1 position is 1(36)4=9\tfrac{1(36)}{4} = 9; the first cf≥9cf \ge 9 is 1111, against x=20x = 20, so Q1=20Q_1 = 20. The full working for Q1,Q2,Q3Q_1, Q_2, Q_3 is in the Worked Examples.

Important

Discrete Uses (N+1)(N+1), Not NN …

Definition 5Less-than cumulative frequency (cf)

A running total of frequencies from the smallest value upward; the cfcf against a value xx is the number of observations les …

Definition 6Locating a partition value in a discrete distribution

Compute the position (i(N+1)4\frac{i(N+1)}{4} for QiQ_i, etc.); the partition value is the xx whose less-than cfcf first reaches or exceeds that pos …