<h3>
Answer: Choice D) </h3>
Work Shown:
We must require that 
and 
to avoid having 0 in the denominator. This is why choice D is the answer.
You could get 7 mangoes you would recive 38p in change
Answer:
<h2> (-1,1)</h2>
Step-by-step explanation:
Given system is
If we graph, the solution would be the interception point between these two lines, because each linear equation represents a line. The lines are attached.
In the graph, you can observe that the solution is the point (-1,1), that is x = -1 and y = 1.
Now, if we want to solve this system by another method, we can just sum both equations and solve for <em>x</em>
Then, we replace this value in one equation to find the other value
Therefore, the solution is (-1,1)
Answer:
a. 24
b. 2
c. 0.0833 = 8.33%
Step-by-step explanation:
a.
The first "slot" of person to arrive has 4 possibilities, then the second "slot" will have 3 possibilities, as one has already arrived, then the third "slot" has 2 possibilities, and the fourth "slot" has just 1 possibility.
So, multiplying all these combinations, we have 4*3*2*1 = 24 possible ways they can arrive
b.
If the first and the last person are already "locked", we just have possibilities for the second and third person. The second will have 2 possibilities (Sergio or Tyrone), and the third will have only 1 (the person that wasn't the second between Sergio and Tyrone). So, the number of possibilities is 2*1 = 2
c.
If we have 2 cases where Dawn is first and Jim is last, from a total of 24 possible cases, the probability is 2/24 = 1/12 = 0.0833 = 8.33%
The form is y=mx+b
3x=-2y+4 (add 2y)
3x+2y=4 (subtract 3x)
2y=-3x+4 (divide by 2)
y= -2/3x+2
