Combinations and permutations
Counting is simple except when there is a lot to be counted.
Combinations and permutations are such a case; they are about counting without replacement.
Suppose we want to count the number of possible results we can obtain from picking k numbers, without replacement, from an equal or larger set of numbers, that is, from n where k \leq n.
When the same set of numbers in different orders should be counted separately, then the count is called the number of permutations.
So, if we have some set of numbers and shuffle some numbers around, then we say that the numbers are permuted.
When the same set of numbers in different orders should be counted only once, then the count is called the number of combinations.
Which makes sense since it is only about the combination of numbers and not the order.