Answer:
11,800 different four letter permutations can be formed using four letters out of the first 12 in the alphabet
Step-by-step explanation:
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
![P_{(n,x)} = \frac{n!}{(n-x)!}](https://tex.z-dn.net/?f=P_%7B%28n%2Cx%29%7D%20%3D%20%5Cfrac%7Bn%21%7D%7B%28n-x%29%21%7D)
In this question:
Permutations of four letters from a set of 12 letters. So
![P_{(12,4)} = \frac{12!}{(12-4)!} = 11800](https://tex.z-dn.net/?f=P_%7B%2812%2C4%29%7D%20%3D%20%5Cfrac%7B12%21%7D%7B%2812-4%29%21%7D%20%3D%2011800)
11,800 different four letter permutations can be formed using four letters out of the first 12 in the alphabet
You are a <em>regular </em>polygon. You may have any number of sides more than 3 .
By the way ... it's not necessary to say that all sides are congruent AND
all angles are too. If either condition is true, then the other one is true.
The width time the leg times to dimensions
Answer:
93
Step-by-step explanation:
(10+4)(7) - 45 / 9
= (14)(7) - 45 / 9
= 98 - 5
= 93
6.) -4/3x+4=y
7.) y=2
8.) Undefined