91Ó°ÊÓ

In combinatorics, a permutation is an arrangement of all or part of a set of objects, with regard to the order of the arrangement.
When we say 'arrangement', we are concerned with the different ways in which we can order these objects.

For example, if we have a group of 50 people and want to select 4 different people to fill the roles of chairperson, vice-chairperson, secretary, and treasurer, the order in which we select them matters.
This is because each person will have a different role depending on when they are chosen. This scenario is a classic example of a permutation, not a combination.

In general, if we have a set of 'n' elements and want to pick 'k' elements to arrange, the number of permutations is represented by the formula:
\[ P(n, k) = \frac{n!}{(n - k)!} \]
Here, '!' denotes a factorial, which will be discussed in the next section.

A factorial is a mathematical operation where we multiply a series of descending natural numbers. It is denoted by an exclamation point (!).

For instance, the factorial of 5 (written as 5!) is calculated as:
\[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \]
This concept plays a crucial role in permutations and combinations.

In the exercise above, we used factorials implicitly to calculate the number of ways to arrange 50 people into 4 positions.
Multiplying 50 \times 49 \times 48 \times 47 can be thought of as a part of the factorial 50!, where we omitted all numbers from 46 down to 1.
Essentially, we performed a division in our formula:
\[ P(50, 4) = \frac{50!}{(50 - 4)!} = \frac{50!}{46!} \]
This canceled out all terms in the factorial below 47, simplifying our work to the product of just the first four terms.

Probability is the measure of the likelihood that an event will occur.
Presented as a number between 0 and 1, where 0 indicates impossibility and 1 indicates certainty.

When dealing with events like selecting committee leaders, we're dealing with discrete probability, where the outcomes are finite and countable.
In our exercise, we did not calculate a probability directly, but rather the number of possible outcomes (leadership structures).

To find the actual probability of a specific leadership structure being selected randomly from all possible structures, we would use:
\[ P(\text{{specific outcome}}) = \frac{1}{\text{{total number of outcomes}}} \]
Given our calculation showed there are 11,037,600 possible leadership structures, the probability of any one specific structure being chosen randomly is very small:
\[ P(\text{{specific structure}}) = \frac{1}{11037600} \]
This demonstrates the vast number of possible permutations in our example.