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.
Answer:
12*56-56+11=12
Step-by-step explanation:
12 for 56
<h2>Answer:</h2><h2>47.25</h2><h2 /><h2>Hope this helps!!</h2>
Pairs, in this case, relates to a group of 2 or more. We have 6 friends. Let's call them A,B,C,D,E,F. This will allow us to make a [some sort of] combination tree:
1. ABC against DEF
2. ABD against CEF
3. ABE against CDF
4. ABF against CDE
5. ACD against BFE
6. ACE against BDF
7. ACF against BDE
8. ADE against BCF
9. ADF against BCE
10. AEF against BCD
I believe there are 12 combinations... I just can't think of the last 2 though.
Answer:
1333
Step-by-step explanation:
