91Ó°ÊÓ

The concept of a factorial is foundational to understanding many areas of mathematics, particularly in combinatorics, a branch that deals with counting and arranging of objects. When we talk about factorial, denoted as a number followed by an exclamation point, it means the product of all positive integers up to that number. For instance, the factorial of 4, written as 4!, is calculated as
\[ 4! = 4 \times 3 \times 2 \times 1 = 24. \]
Similarly, 3! is the product of the first three positive integers:
\[ 3! = 3 \times 2 \times 1 = 6. \]
In combinatorial problems, factorials are useful for determining the number of different ways objects can be arranged. Although calculating larger factorials by hand can be tedious, understanding the concept is crucial, and for larger numbers, a calculator or computer can be used to compute the factorial.

When it comes to selecting items from a set without regard to order, we use the combination formula. This differs from permutations, which are about arrangements where the order does matter.

The combination formula to choose 'r' elements from a set of 'n' is expressed as:\[ C(n, r) = \frac{n!}{r!(n-r)!} \]
What this formula tells us is that to find the number of combinations, we take the factorial of the total number of items 'n', and then divide it by the factorial of the number of items being chosen 'r', and the factorial of the difference between 'n' and 'r'. In the exercise
\[ C(4,3) \]
you are essentially asking: 'In how many different ways can I choose 3 items out of 4 without caring for the order?'. By substituting the appropriate factorial values into the formula, as shown in the solution provided, one can find that there are four such combinations.

Permutations and combinations are two fundamental ways of counting arrangements in precalculus. While they might seem similar, they serve different purposes.

Permutations are all about order. When you're counting permutations, you're counting the number of ways you can arrange a certain number of objects into an order. For example, if you have three books and you want to know in how many different ways you can organize them on a shelf, permutations give you that answer.
Combinations, on the other hand, don't consider the order of arrangement. They tell you how many ways you can choose a set number of items from a larger pool where the order doesn't matter. This is what the combination formula solves.

• In permutations, every detail matters. The arrangement 'AB' is different from 'BA'.
• In combinations, 'AB' and 'BA' are considered the same, since the same items are chosen.

Understanding when to use permutations or combinations is crucial in solving many statistical and probabilistic problems accurately.