91Ó°ÊÓ

The combination formula is a key concept in combinatorics used to determine the number of ways to choose a subset of items from a larger set, where the order of selection doesn't matter. It is especially handy when you want to know how many different groups of "r" items can be formed from a larger group of "n" items. The formula is given by:

• \[ C(n, r) = \frac{n!}{r!(n-r)!} \]

Here:

• \( n \) is the total number of items to choose from.
• \( r \) is the number of items to be chosen.
• The "!" symbol represents the factorial of a number, which is the product of all positive integers up to that number.

The combination formula is used when the order of selection does not matter, as opposed to permutations where the order does matter. In our original exercise, Molly is choosing 5 books from 300, so it's a perfect scenario for using the combination formula because we are interested in different sets of books, not the order they are chosen in.

Factorials play a foundational role in combinatorics, particularly with the combination formula. The factorial of a number, denoted as \( n! \), is the product of all positive integers less than or equal to \( n \). It’s a way of calculating products for sequences of decreasing natural numbers.
For example:

• \( 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \)
• \( 3! = 3 \times 2 \times 1 = 6 \)
• \( 0! = 1 \) (by definition)

Factorials grow very quickly, which can lead to some large numbers, e.g., \( 300! \) is incredibly large. In many applications like our example problem, it's often more practical to use simplifications based on cancellation in the formula rather than calculating \( n! \) directly. For permutations and combinations, we only compute the necessary portion of the factorial.

Permutations relate to arranging a subset of a larger set of items where the order does matter. It's different from combinations, where the order does not matter. In permutations, each possible arrangement of the items counts as a unique permutation.
The formula for permutations is:

• \[ P(n, r) = \frac{n!}{(n-r)!} \]

Here:

• \( n \) is the total number of items.
• \( r \) is the number of items to arrange.

Understanding permutations helps distinguish exercises where order is a crucial factor. For instance, if Molly needed to choose and arrange the books in a specific order on her shelf, permutations rather than combinations would be the appropriate tool. Unlike combinations, permutations give more importance to the specific sequence of selection or arrangement.