Four different roads from Town A to Town B, and three different roads run from Town B to Town C. Two roads also run from Town A
to Town C, bypassing Town B.
How many different round trips can you make from Town Ato Town Cand back?
81
182
196
1 answer:
Answer:
196
Step-by-step explanation:
To solve this, I broke it down into two parts.
A. Number of routes going to Town C
4 x 3 + 2 = 14
B. Number of routes going back to Town A
3 x 4 + 2 = 14
From here, it is easy to see what to do. Since there are 14 routes going to Town C and 14 routes going back, the answer is 14 x 14 = 196.
You might be interested in
the problem isnt that hard. you need to do the distributive property or FOIL with (m+3) four different times. The answer would be
M^4 + 12M^3 +54M^2 +108M +81
We know, sum of all the angles in a triangle is equal to 180 degree
So, 90 + 2x + 3x = 180
5x = 180-90
x = 90/5
x = 18
∠ANB = 2x = 2(18) = 36
∠BNC = 3x = 3(18) = 54
Hope this helps!
Answer:
Hi I'm learning the same thing and I just got it I think it's C=43.98cm
Answer:
12
Step-by-step explanation:
Answer:
always
Step-by-step explanation:
