Ula for a Variable
1 answer:
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>
1. Given any triangle ABC with sides BC=a, AC=b and AB=c, the following are true :
i) the larger the angle, the larger the side in front of it, and the other way around as well. (Sine Law) Let a=20 in, then the largest angle is angle A.
ii) Given the measures of the sides of a triangle. Then the cosines of any of the angles can be found by the following formula:
2.
3. m(A) = Arccos(-0.641)≈130°,
4. Remark: We calculate Arccos with a scientific calculator or computer software unless it is one of the well known values, ex Arccos(0.5)=60°, Arccos(-0.5)=120° etc
i) the larger the angle, the larger the side in front of it, and the other way around as well. (Sine Law) Let a=20 in, then the largest angle is angle A.
ii) Given the measures of the sides of a triangle. Then the cosines of any of the angles can be found by the following formula:
2.
3. m(A) = Arccos(-0.641)≈130°,
4. Remark: We calculate Arccos with a scientific calculator or computer software unless it is one of the well known values, ex Arccos(0.5)=60°, Arccos(-0.5)=120° etc