Toolbox
A formula sheet plus reference tools for calculator, equation solver, units, elements, graphs and molecules.
Permutations and binomials
Permutations, combinations, factorials and binomial expansion: coefficient table, general term and Pascal triangle, all in exact big integers.
n goes up to 60, or 20 for a binomial expansion; m cannot exceed n.
Pascal triangle (the highlighted row is the expansion)
- Symmetry
- C(10, 7) = 120
- Permutations over m factorial
- A(10, 3) / 3! = 720 / 6
- Row total
- 1 024
- 1Formula
A combination is a permutation divided by m factorial.
- 2Substitute
Choosing m of n is the same as leaving n−m behind.
- 3Solve
Substitute the numbers.
- 4Conclusion
A whole row sums to 2 to the n.
Concept
A permutation cares about order and a combination does not. Picking two people to queue is a permutation; picking two to sweep is a combination.
Entry k of row n in Pascal triangle is exactly C(n,k), and each entry is the sum of the two above it.
Going further
- Properties of binomial coefficients
- Each row is symmetric and peaks in the middle, its total is 2 to the n, and the odd and even entries each sum to 2 to the n−1.
Common mistakes
- Ask first whether order matters: yes means permutation, no means combination.
- Cancel before multiplying so the intermediate numbers stay small.
