Counting principle
If stage 1 has m choices and each permits n choices at stage 2, total m×n. Add counts only for mutually exclusive alternatives; multiply choices for sequential stages.
Factorials
For nonnegative integer n, n!=n(n−1)…2·1 and 0!=1. Cancel common factorial factors before computing to avoid huge intermediate products.
Permutations
An ordered selection of r distinct objects from n distinct available objects without repetition is nPr=n!/(n−r)!, for 0≤r≤n. Order matters, as in arranging digits or letters.
Combinations
An unordered selection of r distinct objects from n is nCr=n!/[r!(n−r)!]. A team or committee selection generally uses combinations; assigning distinct positions uses permutations.
Repetition allowed versus disallowed
For r independent positions and n available symbols with repetition allowed, count n^r, unless special position restrictions apply. Without repetition use nPr.
Repeated identical objects
If n positions contain p identical items of one type, q of another, etc., distinct arrangements equal n!/(p!q!…). For a word like MISSISSIPPI, account for all repeated letters.
Restrictions and casework
For even numbers fix final digit appropriately; for a multi-digit number the first digit cannot be 0. For vowels/consonants kept together, treat each group as one block and multiply by within-block arrangements.
At least/at most conditions
For 'at least k' add disjoint cases or use complement: all possibilities minus forbidden cases. For 'all or none' of a named subgroup count the two mutually exclusive scenarios.
Circular and ordered arrangements
Linear arrangements of n distinct objects have n! orders. For indistinguishable rotations of n distinct objects arranged on a circle, (n−1)! counts rotation-equivalent arrangements (reflection can require further conditions); apply only when problem specifies circular equivalence.