Answer:
2 12/16, 2 18/25, and lastly 2.
Step-by-step explanation:
Since 2 is least, we can put that at the end. That leaves us with 2 18/25 and 2 12/16. Since 12/16 is greater, we will put that as the greatest. 2 18/25 is in the middle. Hope this helps!
Answer:
462 paths from A to B
Step-by-step explanation:
The question is incomplete. However, a possible question is to determine the number of possible paths on the grid map.
The first step is to represent the grid map itself. (See attachment 1)
From the question, we understand that:
- Only right movement is allowed in the horizontal direction
- Only up movement is allowed in the vertical direction
There are a several number of ways to navigate through. However, one possible way is in attachment 2
In attachment 2,
- R represents the right movement
- U represents the up movement
And we have:
and 
The number of possible paths (N) is then calculated as:

Substitute values for N and U





<em>Hence, there are 462 possible paths from A to B</em>
Answer:
im pretty sure B 7.5 units
Step-by-step explanation:
The answer is no, because the first two equations are right but the third equation equals -16 instead of -15. So the answer is no (2,-2,4) is not the solution to all the system of equations.
The two horizontal lines are parallel ( This is given by the red triangles)
Because the lines are parallel, the two angles 1 & 2 would be the same.
Set the two equations for the angle to equal each other and solve:
8y-6 = 7y
Add 6 to each side:
8y = 7y+6
Subtract 7y from each side:
y = 6
Now you have the value for y, solve for angle 2 by replacing y with 6:
Angle 2 = 7y = 7(6) = 42 degrees.