Help me plz what is
2 answers:
You might be interested in
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:
b =
Step-by-step explanation:
Given
k = ← multiply both sides by (v - b)
k(v - b) = brt ← distribute left side
kv - kb = brt ( subtract brt from both sides )
kv - kb - brt = 0 ( subtract kv from both sides )
- kb - brt = - kv ( multiply through by - 1 to clear the negatives )
kb + brt = kv ← factor out b from each term on the left
b(k + rt ) = kv ← divide both sides by (k + rt )
b =