there are 9 different routese between citise A and B, and 8 different routes between cities B and C. How many different routese are there form city A to city C by way of city B socratic.org
1 answer:
Answer:
72 routes
Step-by-step explanation:
The total number of routes from city A to C by way of city B is determined as the product of picking one out 9 routes from A to B by picking one out of 8 routes from city B to C:
There are 72 different possible routes.
You might be interested in
Answer:
4x^2 + 4x + 1=9
4x^2 + 4x - 8=0
Dividing both sides by 4
x^2 + x -2=0
It can be written as
x^2 + 2x - x - 2=0
x(x+2) -1(x+2)=0
taking (x+2) as common on LHS
Then, (x+2)(x-1)=0
Now first equate x+2=0 ie x=-2
then x-1=0 ie x=1
Therefore, x has two values(roots)
that is -2,1
Answer:
I do not know. sorry I couldn't help
Answer:
A is your answer, my guy
Step-by-step explanation:
4x1=4
3x-1=-3
5x1=5
4+(-3)+5=6
6x1=6
8x-1=-8
6x1=6
6+(-8)+6=4
4x1=4
2x-1=-2
6x1=6
4+(-2)+6=8
Answer: A : decreasing B : constant C: increasing D: Constant
Step-by-step explanation:
Reflection across the x-axis followed by a reflection across the y-axis.