Answer:
I'm not sure the answer to this
Answer:
4
Step-by-step explanation:
<u><em>Answer:</em></u>
168
<u><em>Explanation:</em></u>
<u>Before we begin, remember the following:</u>
+ve * +ve = +ve -ve * -ve = +ve
+ve * -ve = -ve -ve * +ve = +ve
<u>Now, for the given problem we have:</u>
(-4) * (6) * (-7)
<u>Let's take the first two terms:</u>
(-4) * (6)
Based on the above rules, the product will be negative
<u>Therefore, </u>
(-4) * (6) = -24
<u>Now, the expression became:</u>
(-24) * (-7)
Again, based on the above rule, the product here will be positive
<u>Therefore,</u>
(-24) * (-7) = 168
Hope this helps :)
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:
160
Step-by-step explanation:
226
-160
____
66
-64 (4 in the quotient)
____
2
