Answer:
39
Step-by-step explanation:
Given the function :
h(t) = t² + 2
From t = 5 to t = 8
when, t = 5
h(5) = 5² + 2
h(5) = 25 + 2
h(t) at t = 5 ; equals 27
when, t = 8
h(5) = 8² + 2
h(5) = 64 + 2
h(t) at t = 8 ; equals 66
Net Change :
h(8). - h(5)
66 - 27 = 39
Is skipped a number and that's not good
Answer:
B and D
Step-by-step explanation:
plug in the x and y for the x and y in the equation
if the two sides come out equal to eachother they satify the function
if they dont well they dont satisfy the function
hope this helps <3
I just did this a few seconds ago and the correct answer is 78. The check above the number is green which means its correct.
688,747,536 ways in which the people can take the seats.
<h3>
</h3><h3>
How many ways are there for everyone to do this so that at the end of the move, each seat is taken by exactly one person?</h3>
There is a 2 by 10 rectangular greed of seats with people. so there are 2 rows of 10 seats.
When the whistle blows, each person needs to change to an orthogonally adjacent seat.
(This means that the person can go to the seat in front, or the seats in the sides).
This means that, unless for the 4 ends that will have only two options, all the other people (the remaining 16) have 3 options to choose where to sit.
Now, if we take the options that each seat has, and we take the product, we will get:
P = (2)^4*(3)^16 = 688,747,536 ways in which the people can take the seats.
If you want to learn more about combinations:
brainly.com/question/11732255
#SPJ!
