Counting without listing
Combinatorics answers “how many?” when listing every arrangement would be impossible. Three classic questions dominate introductory counting: permutations (order matters), combinations (order does not), and arrangements / partial permutations (order matters but you only fill k of n slots). Each question has a with-repetition and without-repetition variant.
A concrete starting point is combinations without repetitions—the binomial coefficient “n choose k”—then branch into ordered and repetition-allowed siblings as your problem requires.
Decision guide
Ask in order:
- Does order matter? If yes → permutations / arrangements. If no → combinations.
- May the same element appear more than once? If yes → “with repetitions” formulas. If no → “without repetitions.”
- Are you arranging all n items, or only k of them? Full permutations use n!; partial selections use falling factorials or n^k.
Misreading any of those three axes is the usual source of off-by-factor errors in homework and interview problems.
Family of calculators
- Permutations without repetitions — n! ordered arrangements of n distinct items.
- Permutations with repetitions — multiset permutations n! / (r₁! r₂! …) when identical copies exist.
- Combinations without repetitions — C(n, k) = n! / (k! (n − k)!) unordered k-subsets.
- Combinations with repetitions — C(n + k − 1, k) multisets of size k from n types.
- Arrangements without repetitions — P(n, k) = n! / (n − k)! ordered k-tuples without reuse.
- Arrangements with repetitions — n^k ordered k-tuples with reuse allowed.
Inputs are non-negative integers with the usual domain guards (k ≤ n when repetition is forbidden, etc.). Overflowing factorials surface as calculation errors rather than silent infinity.
Factorials as the common engine
Without-repetition formulas lean on n!—the product 1 × 2 × … × n, with 0! = 1 by convention. Combinations divide out the internal orders of each subset (k!) and sometimes the unused tail ((n − k)!). Partial permutations keep order, so they divide only by (n − k)!.
With-repetition combinations use the “stars and bars” identity C(n + k − 1, k). With-repetition arrangements are simpler still: each of k positions independently chooses one of n symbols → n^k.
Worked micro-examples
Deck of 52, hand of 5 (order irrelevant, no reuse): C(52, 5).
Race with 8 distinct runners, award gold/silver/bronze: P(8, 3) = 8 × 7 × 6.
PIN of 4 digits, digits may repeat: 10^4 = 10000.
Word arrangements of “BOOK”: 4! / 2! because of the two O’s—multiset permutation.
Buy 3 scoops from 5 flavors, repeats allowed, order ignored: C(5 + 3 − 1, 3).
Mapping a word problem onto the correct calculator is the skill; the arithmetic is secondary.
Relations that prevent mistakes
- P(n, k) = C(n, k) × k! — choose the set, then order it.
- n! = P(n, n) — full permutations are partial permutations with k = n.
- C(n, k) = C(n, n − k) — symmetry of binomial coefficients.
- Forbidding repetition when the story allows it undercounts; allowing it when the story forbids overcounts.
Where these counts appear
- Probability denominators (fair games, sampling)
- Password and identifier strength sketches (with clear threat-model caveats)
- Algorithm analysis (search spaces, state enumeration)
- Experimental design (treatment combinations)
- Sports “ways to finish” and similar ranking puzzles—as mathematics, not wagering advice
Large n grows faster than intuition. C(60, 6) is already millions; factorials beyond modest n overflow fixed-precision floats—hence dedicated helpers and big-integer libraries in production systems.
Teaching sequence
- Count permutations of small n by listing, then introduce n!.
- Introduce P(n, k) with podium examples.
- Show C(n, k) by dividing out order.
- Add repetition: n^k first (independent positions), then stars-and-bars.
- Only then introduce multiset permutations with repeated letters.
Jumping straight to six similar-looking formulas without the decision guide produces cargo-cult plugging.
Implementation notes
Computing C(n, k) via three full factorials is simple but overflows early. Multiplicative algorithms reduce intermediate size. This hub’s helpers use factorial division with finite-number guards suitable for interactive education—not for cryptographic-scale n. Reject non-integers and impossible (n, k) pairs with stable error reasons.
Common pitfalls
- Treating “committee of 5” as a permutation
- Using n^k for draws without replacement when order does not matter
- Forgetting to divide by identical-letter factorials in word problems
- Confusing combinations-with-repetition with combinations-without when shopping “up to k items”
Summary
This hub gathers six elementary counting tools: full and multiset permutations, combinations with and without repetition, and partial arrangements with and without repetition. Decide whether order and reuse apply, pick the matching formula, and sanity-check with a tiny listing. The calculators automate the arithmetic so you can focus on modeling the story correctly.