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!
Answer:
If the third term of an arithmetic sequence is-21and the sixth term is-6 find the first and eighth term of the sequence
Step-by-step explanation:
Step-by-step explanation:
Let the two numbers be x and y
x+y =5 ---1
x-y =-3 ---2
Rearrange equation 1
x =5-y
Substitute x in the second equation
(5-y)-y =-3
5-y-y =-3
5-2y =-3
Collect like terms
5+3 = 2y
8 = 2y
Divide both sides by the coefficient of y (2)
8/2 = 2y/2
4 = y
y= 4
Substitute y in equation 1
x+4 =5
Subtract 4 from both sides
x+4-4 = 5-4
x+0 = 1
x= 1
The two numbers are 1 and 4
Answer:
The way you would sketch the graph is slowly increasing, staying about the same, and then go up a little bit.
Good luck!