Answer:
Step-by-step explanation:
Turn the question around so it is easier to see.The open end is closest to n.
6n>48 Divide by 6
6n/6>48/6
n > 8
So all you have to do is choose 3 values greater than 8
How about 9,10,11
Rewrite the equations;
m+4n=8
m-n=-2
Eliminating m gives;
5n=10
n=2
Replacing for n in the first equation;
m+4(2)=8
m=8
Answer;
(0, 2)
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!
The answer would be C, Input Value because it is called the<span> independent variable and represents an input </span>value<span> from the domain.</span>
Answer:
1
Step-by-step explanation:
3/2 = 2/2 * 1/2
2/2 = 1
So 3/2 = 1
