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>
The answer would be 0 solutions.
Here, we see <em>|</em><em />x+6<em>|</em><em /> = 2.
Oh wow! A foreign object!
|x+6|... two lines... what is that?
That is called absolute value. Whatever is inside the two lines, must have a positive answer!
Let's pretend we have a machine that has this absolute value function activated.
What we put in, we must get a positive answer out.
Let's put in -6.
-6 ==> BEEP BEEP ==> 6
Let's try 3.
3 ==> BEEP BEEP ==>3
Whatever we put in, if it is negative or positive, what comes out is always positive.
So, for how many values <em>x</em> is |x+6|=-2 true?
None, because the answer <em>must</em><em /> be positive!
-2 is not positive, <em>2</em><em /> is.
Answer:
use this
Step-by-step explanation:
velocity = distance / time…. So distance = velocity x time
Answer:
centriod
Step-by-step explanation:
of triiangle