The distance between Branch A and Branch B is given by the Pythagoras theorem
AB² = (Vertical Distance)² + (Horizontal Distance)²
AB² = (4-1)² + (1 - -3)²
AB² = 3² + 4²
AB² = 9 + 16
AB² = 25
AB = 5
BC² = (Vertical distance)² + (Horizontal distance)²
BC² = (-2 - 4)² + (5-1)²
BC² = (-6)² + (4)²
BC² = 36 + 16
BC² = 52
BC = 7.21
Half way of BC = 7.21 ÷ 2 = 3.6 miles
Total distance travelled from A to B and then halfway from B to C is 3.6+5 = 8.6 miles
Answer:
f(x) = x^2 is a classic example
f( 3 ) = 9 and
f( -3 ) = 9, but
f^(-1)[9] is undefined because the result can be 3 and -3
Answer:
30,240 ways, if I am restricted to using A, B, and C for letters
Step-by-step explanation:
This uses Combinatorics from Discrete Math.
so.
3 letters and 4 digits.
26 letters from alphabet, but you want to choose first letters. no repeats...
Does this mean only letters A, B, and C ?
digits from 10 digits...
I imagine 7 empty slots , and the number of ways they occur together is by the product of the number of choices each box has.
3*2*1 * 10*9*8*7 = 6 * 5040 = 30,240 ways
Answer:
2(n + m)
Step-by-step explanation:
