13 mental math shortcuts for combinations and permutations

Combinatorics often looks like a wall of factorials. If you are new to the terminology, a factorial is simply a number followed by an exclamation point, which tells you to multiply a sequence of descending integers. For example, $4!$ is just shorthand for $4 \times 3 \times 2 \times 1$. Staring at these strings of numbers can feel tedious, but you rarely have to write out the full mathematical formulas to solve a problem or check your work.

A few practical rules of thumb can help you quickly estimate answers, simplify mental math, and know exactly which formula applies to your specific scenario. In the standard formulas, $n$ represents the total number of available items, and $k$ represents the number of items you are actually choosing. Here are 13 shortcuts to make these calculations faster and more intuitive.

Deciding which formula to use

Before calculating anything, you have to know what you are looking at. The first and most important step is separating combinations from permutations.

1. The Committee vs. Podium test If swapping the selected items changes the final outcome, you are dealing with a permutation. If it doesn’t, it is a combination. Choosing three people to form a committee is a combination because the order they are picked does not matter—they are all equally on the committee. Choosing three people to stand on a podium for gold, silver, and bronze medals is a permutation. In that case, the order absolutely matters.

2. The No Replacement rule Standard combinations and permutations assume you cannot pick the exact same item twice. If you draw a card from a deck, you keep it in your hand. If your scenario allows for reuse—like a four-digit PIN where the number 7 can appear multiple times—you skip the permutation formulas entirely. Instead, you just multiply the total options available for each slot. For a standard PIN, that is $10 \times 10 \times 10 \times 10$.

3. The Multiplication rule (AND) If a problem asks you to choose a combination from Group A and a combination from Group B, calculate them separately and multiply the results. Say you need 2 managers from a pool of 5, and 3 associates from a pool of 10. You calculate $C(5,2)$, calculate $C(10,3)$, and multiply those two numbers together.

4. The Addition rule (OR) If a problem asks you to choose from Group A or Group B, calculate the combinations separately and add the results. If a restaurant special lets you pick 2 appetizers or 2 desserts, find the total combinations for the appetizers, find the total combinations for the desserts, and add them up.

Mental math shortcuts for combinations

Combinations divide out redundant arrangements, which keeps the final numbers much smaller than permutations. The standard formula is $C(n,k) = n! \div (k! \times (n−k)!)$.

5. The Symmetry rule Choosing items to keep is mathematically identical to choosing items to leave behind. Because of this, $C(n, k) = C(n, n−k)$. If you need to choose 98 items from 100, do not try to crunch the massive factorials for 98. Just calculate $C(100, 2)$. The answer is exactly the same, and the math takes seconds instead of minutes.

6. The Handshake rule To find out how many games are played in a round-robin tournament, or how many handshakes happen in a room if everyone shakes hands exactly once, you are simply pairing items up. This is always $C(n, 2)$, which simplifies to a clean mental math trick: $n \times (n−1) \div 2$. If there are 10 people in the room, it is $10 \times 9 \div 2$, giving you 45 handshakes.

7. The All But One rule If you are choosing all but one item from a group, the number of combinations is exactly $n$. For example, $C(10, 9) = 10$. You have exactly 10 different ways to leave one item out of a 10-item set.

8. The Peak rule For any given $n$, the number of combinations grows as you choose more items, peaks exactly in the middle, and then shrinks back down. $C(n, k)$ is always largest when $k$ is exactly half of $n$. If $n$ is an odd number, the peak is shared by the two integers closest to the halfway mark.

Mental math shortcuts for permutations

Permutations count every possible arrangement. Because order matters, the numbers grow extraordinarily fast. The formula is $P(n,k) = n! \div (n−k)!$.

9. The Divide by k! rule Permutations are always larger than combinations, unless $k$ is 0 or 1, where they are identical. If you already know the number of combinations, you can find the permutations by multiplying by $k!$. Working backward, $C(n,k) = P(n,k) \div k!$.

10. The Top-Two rule If you need to assign two distinct roles from a pool of candidates—like President and Vice President—you are solving $P(n, 2)$. The shortcut is just $n \times (n−1)$. Out of 10 people, there are $10 \times 9 = 90$ ways to fill the top two spots.

11. The Factorial explosion rule If you are arranging a large number of items where order matters, expect massive numbers. By the time $n$ reaches 20, $20!$ is so large that calculators switch to scientific notation. If a permutation problem involves a full deck of 52 cards, you will almost always be working with numbers in the millions or billions. If you need to double-check these figures, a standard factorial calculator can help you track the raw $n!$ value.

Universal rules for zero and one

Whether order matters or not, the math converges when you deal with the extremes of a set.

12. The Choose-One rule If you are selecting exactly one item from a group, there are exactly $n$ ways to do it. Both $C(n, 1) = n$ and $P(n, 1) = n$.

13. The Choose-None rule How many ways can you choose zero items from a set? Exactly one way: by doing nothing. In combinatorics, $C(n, 0) = 1$ and $P(n, 0) = 1$ for any $n ≥ 0$. Similarly, if you choose every single item in a combination, $C(n, n) = 1$, because there is only one way to grab the entire pile at once.

Ready to run your own numbers? Check out our Combinations and Permutations Calculator.