What Remains After Two Things Are Fixed?
When should both the available population and the remaining choices decrease by two?
How this lesson unfolds.
Begin with How do you distinguish between pre-selected items inside an unordered sample versus specific items occupying ordered slots? The sequence then connects Two named units leave N minus 2 available and builds toward Subtract every genuinely fixed unit.
How do you distinguish between pre-selected items inside an unordered sample versus specific items occupying ordered slots?
Selecting specific individuals to be included in a committee fixes membership regardless of order, while assigning them to specific chairs fixes sequential positions.
- $$N(\text{combinations}) = \binom{N-2}{n-2} \quad \text{vs.} \quad P(\text{positions}) = \frac{1}{N(N-1)}$$
- Learning goalClassify combinatorial problems between fixed subset membership and ordered positional constraints.
- Helpful foundationsCombinations and Permutations · Factorials · Set Cardinality · Introduction to Mathematical Thinking (Keith Devlin, Stanford) · Essence of Linear Algebra (3Blue1Brown)
- Common trapConfusing unordered subset inclusion C(N-2, n-2) with ordered slot assignment P(N-2, n-2).
- Next connectionTrack how fixing two units reduces the available pool to N-2.
More context & mechanics
When counting arrangements under constraints, the first question is always: What is fixed—the identity of the items, or their sequence in order?
If an audit committee of n people from a pool of N must include Alice and Bob, their identities are locked into the set regardless of arrival order. But if Alice must sit in Seat 1 and Bob in Seat 2, order is strictly enforced. In set-based sampling, elements inside the collection have no internal rank.
In Distributed Consensus Protocols (such as Raft and Paxos in cloud databases), leader election requires forming a quorum where certain seed validator nodes are pre-designated. Combinatorial counting of quorum subsets determines fault-tolerance thresholds without double-counting static nodes.
Blaise Pascal and Pierre de Fermat laid the foundations of combinatorics in their famous 1654 correspondence on the "Problem of Points," demonstrating that properly identifying fixed versus undecided outcomes is the foundation of probability.
Rule: "Bag vs. Line."
If items go into a bag (unordered), lock elements. If items stand in a line (ordered), lock slots.
When two specific units are guaranteed to be in your sample, why does the available choice pool drop strictly to N-2?
Once two specific members are guaranteed a spot, both the total population pool and the number of open slots shrink by two before any random choice occurs.
- $$U_{\text{remaining}} = U \setminus \{u_1, u_2\}, \quad |U_{\text{remaining}}| = N - 2$$
- Learning goalDetermine the reduced candidate universe size after fixing pre-selected items.
- Helpful foundationsSet Difference · Sampling Without Replacement · Combinations · Introduction to Mathematical Thinking (Keith Devlin, Stanford) · Essence of Linear Algebra (3Blue1Brown)
- Common trapReducing the sample quota n while forgetting to decrement source pool N.
- Next connectionDetermine the remaining spots needed to complete sample size n.
More context & mechanics
Suppose you are selecting a team of n=5 researchers from an engineering pool of N=20. If Alice and Bob are mandatory picks, they are already taken from the pool. You cannot select Alice again; she is no longer available in the candidate pool. The available reservoir of candidates drops from N to N-2 = 18.
In Quality Assurance and Hardware Chip Testing, automated test runners pick batches of chips. If two reference control chips are permanently included in every run, the automated sampler draws the rest from N-2 batch units to benchmark defect rates.
Jakob Bernoulli formalized combinatorial choices in his landmark 1713 treatise Ars Conjectandi, showing how removing known outcomes partitions the universe into fixed givens and variable possibilities.
Mnemonic: "Taken off the shelf."
If 2 items are already in your cart, there are 2 fewer items left on the shelf: N → N-2.
How does pre-committing two elements into your sample alter your remaining selection quota?
The remaining open slots must be filled strictly from the unchosen candidates, transforming the combinatorial selection into picking n-2 items from N-2.
- $$k_{\text{needed}} = n - 2 \implies \text{Total ways} = \binom{N-2}{n-2}$$
- Learning goalDecrement both population size and sample quota simultaneously for pre-selected elements.
- Helpful foundationsBinomial Coefficients · Combinatorial Subsets · Counting Principles · Introduction to Mathematical Thinking (Keith Devlin, Stanford) · Essence of Linear Algebra (3Blue1Brown)
- Common trapChoosing n items from remaining N-2, accidentally generating an oversized sample of n+2.
- Next connectionGeneralize the reduction formula to any arbitrary number of fixed units k.
More context & mechanics
Your team has a fixed quota of n spots. If two spots are reserved by Alice and Bob, you do not need 5 new teammates—you only need 5 - 2 = 3. The entire combinatorial problem collapses to filling those remaining n-2 vacant slots from the N-2 remaining candidates: C(N-2, n-2).
In Machine Learning Hyperparameter Tuning (Random Search vs Grid Search), an engineer may fix learning rate and batch size based on domain knowledge, leaving only n-k hyperparameters to be sampled randomly across configurations.
Leonhard Euler utilized this dual-reduction property in 1753 to solve partition problems and develop generating functions, observing that fixing components reduces both the container capacity and the source integer.
Mnemonic: "Subtract top AND bottom."
C(N, n) ⟶ C(N-2, n-2). Both the pool (top) and the basket (bottom) shrink by 2!
What is the universal formula for sampling without replacement when k specific units are unconditionally locked into the sample?
Generalizing to k fixed units, every pre-determined item systematically steps down both the numerator and denominator of the selection probability.
- $$\binom{N-k}{n-k} = \frac{(N-k)!}{(n-k)! \, (N-n)!}, \quad \pi_{1\dots k} = \frac{\binom{N-k}{n-k}}{\binom{N}{n}} = \prod_{j=0}^{k-1} \frac{n-j}{N-j}$$
- $$Pre-determining $k$ units reduces selections to $\binom{N-k}{n-k}$, giving joint inclusion probability $\prod_{j=0}^{k-1} \frac{n-j}{N-j}$.$$
- Learning goalApply general fixed-unit formula C(N-k, n-k) to compute joint inclusion probabilities.
- Helpful foundationsBinomial Identity · Joint Inclusion Probability · Hypergeometric Distribution
- Common trapMultiplying by k! when internal order inside the sampled subset does not matter.
- Next connectionApply combinatorial reduction rules to constrained circular graphs and number wheels.
More context & mechanics
The general fixed-unit principle states that if k distinct units must be included in an unordered sample of size n from population N:
- Pool drops from N to N - k.
- Sample demand drops from n to n - k.
The number of ways to complete the sample is C(N-k, n-k). Furthermore, dividing by total unrestricted samples C(N, n) gives the exact joint inclusion probability π_(1ṡ k) = (n(n-1)ṡ(n-k+1)) / (N(N-1)ṡ(N-k+1)).
In Cryptography and Threshold Secret Sharing (such as Shamir's (k, n) scheme), a secret is split into N pieces where any k pieces reconstruct the secret. Combinatorial calculations of fixed share combinations prove cryptographic information-theoretic security.
Abraham de Moivre derived these generalized hypergeometric selections in his 1718 work The Doctrine of Chances, setting the standard for actuarial science and probability theory.
Golden Rule: "Fixed k ⟹ Deduct k Everywhere."
Total combinations: C(N-k, n-k). Clean, exact, and symmetric.