4. [5 pts] describe how and why the formula for permutations differs from the formula for combinations.

They are different because of the order in the permutation matters. In combination, the order doesn't matter. In other words in a permutation 123 and 132 are different but in a combination are the same group (they have the same digits 1,2, and 3).

Step-by-step explanation:

The formula of the permutation is , when you are performing a permutation you pick r objects from a total of n, for the first pick you can choose from n, but for the second you have n-1, and this continues to your  pick number r in which you will choose from n-r+1, and the total of permutation is the multiplicación of this number of choices for each pick, like this:

If and

The factor equals above and under cancel each other.

In combination, the order of the element isn't important, so from the total of permutation you have to eliminate the ones with the same objects with different order and counting just once each group, when choosing r objects the total of permutation for a single group of r objects is: . If you divide the total of permutations of n taking r by r! you get the combinations (where the order is not important). The formula of the combination is .

sas (side angle side)

aa(angle angle)

sss(side side side)

sas you have to find two sides with an angle in between

aa you find two angles because it will always add up to 180

sss find all sides

step-by-step explanation:

idk

step-by-step explanation: