91Ó°ÊÓ

Factorial is a fundamental concept in combinatorics, used extensively in counting problems. The factorial of a number \( n \), denoted as \( n! \), is the product of all positive integers less than or equal to \( n \). For example, \( 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \). The concept of factorial is useful in situations where you need to arrange or select objects in specific orders or groups.
Factorials grow rapidly with larger \( n \), so it is often encouraged to look for common terms and simplify them whenever possible, as seen in our exercise where \( 9! \) was canceled from both the numerator and denominator. The factorial of zero, \( 0! \), is defined to be 1, which may seem surprising, but it is convenient when calculating combinations and permutations.

Combinations are a key part of combinatorics, focusing on selecting items without regard to order. When choosing \( r \) objects from \( n \) options, we use the combination formula: \[ C(n, r) = \frac{n!}{r!(n-r)!} \].
This formula helps to find the number of possible combinations where the sequence does not matter. For instance, in our problem, selecting 3 sites from 12 doesn't depend on the sequence of selection, because choosing Site A, B, and C is the same as choosing Site B, A, and C. This is why combinations differ from permutations, which consider order.
By applying the combination formula, you can solve a variety of selection problems efficiently, helping you to focus on the essence of the problem: choosing the right number of selections from available options.

Permutations are an extension of the factorial concept, focusing on arranging objects where order is important. The formula for permutations when choosing \( r \) items from \( n \) is given by:\[ P(n, r) = \frac{n!}{(n-r)!} \].
In permutations, the arrangement of the chosen items matters. For instance, if our task was to arrange 3 sites in a specific order out of 12, permutations would apply instead of combinations.
It's crucial to distinguish between permutations and combinations. If the sequence matters, permutations are used. If not, combinations are the way to go. It's also worth noting that permutations always equal or exceed combinations in count because they account for every possible sequence of the chosen items.

Selection problems in combinatorics deal with the process of choosing items from a larger set. The two primary methods for tackling selection problems are combinations and permutations.
In our example, the problem was a classic case of a selection problem where only the items selected matter, not the order of selection, directing it to a combination problem. These types of selection problems often arise in situations like team selection, lottery draws, and product choices.
To approach selection problems, first identify whether order is a consideration. Then, utilize the respective formula—either the combination formula for unordered selection or the permutation formula if order is important. This ensures that you are calculating the selections correctly. Importantly, when practicing these problems, always look for opportunities to simplify using the factorial calculations, reducing computational complexity.