Skip to content
Technique

Selections with a fixed th smallest number

Algebra • Permutations and Combinations

Statement

The number of -element subsets of whose th smallest element is is .

How to use it

  1. 1Fix the given value in its place. The numbers below it fill the places before it; the numbers above it fill the places after.
  2. 2Several values fixed: each gap between fixed values is filled from the numbers in that gap only.

Worked example

numbers are chosen from to and written in ascending order. In how many selections is the middle one ?

Step-by-step

  1. 1
    One number below : from :
  2. 2
    One number above : from :
  3. 3

    Why: Multiplication principle.

Answer

Watch out

Choose only from the numbers on the correct side of the fixed value; using all the other numbers overcounts.

Builds on

Also known as

order statistics counting, kth smallest selection

Appears in past papers

2026 (II)