I really need help on this problem!!
1 answer:
You might be interested in
Answer:
cosФ = , sinФ =
, tanФ = -8, secФ =
, cscФ =
, cotФ =
Step-by-step explanation:
If a point (x, y) lies on the terminal side of angle Ф in standard position, then the six trigonometry functions are:
- cosФ =
- sinФ =
- tanФ =
- secФ =
- cscФ =
- cotФ =
- Where r =
(the length of the terminal side from the origin to point (x, y)
- You should find the quadrant of (x, y) to adjust the sign of each function
∵ Point (1, -8) lies on the terminal side of angle Ф in standard position
∵ x is positive and y is negative
→ That means the point lies on the 4th quadrant
∴ Angle Ф is on the 4th quadrant
∵ In the 4th quadrant cosФ and secФ only have positive values
∴ sinФ, secФ, tanФ, and cotФ have negative values
→ let us find r
∵ r =
∵ x = 1 and y = -8
∴ r =
→ Use the rules above to find the six trigonometric functions of Ф
∵ cosФ =
∴ cosФ =
∵ sinФ =
∴ sinФ =
∵ tanФ =
∴ tanФ = = -8
∵ secФ =
∴ secФ = =
∵ cscФ =
∴ cscФ =
∵ cotФ =
∴ cotФ =
Answer: 1, 235, 520 different arrangements
Explanation: Since we want to arrange them, we care about the order in which they come in.
Let's firstly think about it in a diagrammatic way before diving into the permutations side of things.
We have 13 swimmers, let's name them from 1 to 13. Now, we want to arrange six of them in a line (hypothetically).
Thus, we can arrange the first six people:
1 2 3 4 5 6
1 2 3 4 6 5
1 2 3 6 5 4
1 2 3 6 4 5
...
In fact, we have 6! ways in arranging six objects into six places, which is 720 different ways.
Now, let's think about it in a bigger spectrum. If we have 13 people and we want to arrange them in 13 blocks, we would have 13! ways in arranging them:
Different permutations:
Ways in arranging 13 people into 13 different lanes is given by:
Now, we want to restrict that into 6 blocks, so we can only have 6 people in it
So, we would have (13 - 6)! ways in arranging them into 6 blocks.
So, our final number of arrangements is:
ways.
This is also the formula for the Permutation function represented by:
, where n is the number of objects (13) and r is the number of positions (6).
Explanation: Since we want to arrange them, we care about the order in which they come in.
Let's firstly think about it in a diagrammatic way before diving into the permutations side of things.
We have 13 swimmers, let's name them from 1 to 13. Now, we want to arrange six of them in a line (hypothetically).
Thus, we can arrange the first six people:
1 2 3 4 5 6
1 2 3 4 6 5
1 2 3 6 5 4
1 2 3 6 4 5
...
In fact, we have 6! ways in arranging six objects into six places, which is 720 different ways.
Now, let's think about it in a bigger spectrum. If we have 13 people and we want to arrange them in 13 blocks, we would have 13! ways in arranging them:
Different permutations:
Ways in arranging 13 people into 13 different lanes is given by:
Now, we want to restrict that into 6 blocks, so we can only have 6 people in it
So, we would have (13 - 6)! ways in arranging them into 6 blocks.
So, our final number of arrangements is:
This is also the formula for the Permutation function represented by: