Counting Without Listing Them All Permutations and Combinations

Forgetting a 4-digit suitcase code, with each digit independently chosen from 0 through 9, means there are exactly 10 x 10 x 10 x 10 = 10,000 possible codes -- a number found instantly by multiplying the choices at each position, never by writing out a single one of them. This is the Fundamental Principle of Counting: if one choice can be made in m ways and a second, independent choice in n ways, then both choices together can be made in m times n ways, and this multiplying idea extends cleanly to any number of independent choices in a row.

A permutation is an arrangement where ORDER matters -- choosing and arranging r distinct items out of n available ones works out to n x (n-1) x (n-2) x ... down to (n-r+1) choices multiplied together, which simplifies neatly to n! divided by (n-r)!, written nPr. When some of the n items are actually identical (like repeated letters in a word), the count must be divided further, by the factorial of each repeated letter's own count, since swapping two identical letters doesn't create a genuinely new arrangement at all.

A combination is a selection where order genuinely doesn't matter -- picking a 3-person committee cares only about WHO is picked, not the order they were chosen in, unlike arranging 3 people in a line. Since every combination of r items can itself be internally arranged in r! different orders (all counted separately by nPr, but representing just ONE combination), dividing nPr by r! gives the combinations formula directly: nCr = n! divided by r! times (n-r)!.

Arranging all 11 letters of MISSISSIPPI (with M appearing once, I four times, S four times, and P twice) gives 11! divided by (4! times 4! times 2!), which works out to exactly 34,650 distinct arrangements -- a number nowhere close to the 11! that would apply if every letter were different. A separate but related identity, nCr plus nC(r-1) equals (n+1)Cr, connects combinations directly to Pascal's Triangle, foreshadowing the Binomial Theorem's own use of exactly these same combination values as coefficients.