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:
(6,7) is a solution
Step-by-step explanation:
To determine if (6,7) is a solution, we substitute the point in and see if the inequality is true
15x+11y>12
15(6) + 11(7) >12
90+77 > 12
167>12
This is true so (6,7) is a solution
-2/3 ÷ 1/3
=(-2 × 3) / (1 × 3)
= -6/3
= -2/1
<span>= -2</span>
It would be 50 times because 15 divided by 3 is 5 and you just add your 0 back and get 50! hope this helps!
Answer:
heres the graph i don't rly understand this all but mabe it will help
Hope This Helps!!!
