A row of distinct role markers beside an unordered group of tokens. Original AI-generated artwork produced for GreenCalc; not a measured diagram or empirical data display.
Rank only the positions the question asks for
Suppose twelve distinct entrants can occupy the first four finishing positions, with no ties. There are twelve choices for first, eleven for second, ten for third and nine for fourth. The partial ranking count is 12×11×10×9 = 11,880. You do not need to order the remaining eight entrants when the outcome stops at fourth place.
Why a full factorial overcounts
Using 12! would distinguish the 8! possible orders of the unreported finishers behind every top-four list. Dividing by 8! removes those irrelevant completions, leaving P(12,4). The same model applies to a ranked shortlist when each position is distinct and a person cannot occupy two positions.
Do not infer equally likely finishes
The count lists possible ordered outcomes. It does not assert that every entrant has the same ability or that every ranking has probability 1/11,880. Converting the count into such a probability requires a separate uniform-ranking model. Ties, withdrawals, qualification rules or position-specific eligibility can also change the allowed outcome set.
Use partial-permutation mode explicitly
Enter n = 12 and r = 4 in the Permutation Calculator without replacement. The existing subset-versus-sequence guide owns the broader decision about whether order matters. This page focuses on why a partial ranking divides out the unreported tail. Read fixed repeated items for the different case of indistinguishable copies.
Check the model behind your result
Use the Permutation Calculator for the supported calculation and review its stated assumptions before interpreting the output. Find related tools in the Statistics category, or browse the GreenCalc homepage for other calculation topics.
By GreenCalc Editorial Team · Updated 2026-10-26