Permutations & Combinations (nPr & nCr)

Determining possible grouping arrangements is fundamental across lottery probability analysis, experimental research design, sports tournament scheduling, and cryptographic security protocols. Analysts and students must distinguish between scenarios where the specific sequence of chosen elements creates unique outcomes versus scenarios where only overall group membership matters. You enter the total pool size n representing available distinct elements and the subset size r indicating how many items are drawn from that pool.

The results display the permutation count nPr, representing ordered sequences like podium finishes or passcode digit combinations, and the combination count nCr, representing unordered selections like poker hands or committee panels. Because combination mathematics divides out duplicate orderings among chosen items, nCr is consistently smaller than or equal to nPr. Keep in mind that these standard combinatorial formulas assume sampling without replacement; situations allowing repeated element selection require separate exponent-based calculation models and distinct formula structures.

Permutations are calculated by taking the factorial of pool size n divided by the factorial of n minus r, maintaining sequence distinction. Combinations take that permutation total and further divide by r factorial to eliminate duplicate orderings of identical selected subsets.