Heyall! I'm having a really hard time with my Statistics homework because I can't figure out how to solve this. Here's the problem:
"There are 2 roads between Town A and Town B, and 6 roads from Town B to Town C. In how many ways can you go from Town A to Town C though Town B without returning through the same road twice?"
2007-03-14 21:06:37 · 11 answers · asked by gonecrazy_backsoon 1 in Education & Reference ➔ Homework Help
~ It's all about location, location, location
2007-03-14 21:10:26 · answer #1 · answered by James N 4 · 0⤊ 3⤋
If what you mean is that it's a one-way trip from town A to C via town B, then there are 12 possible ways, utilizing either of the 2 paths from A to B (2), then any of 6 routes from B to C (6). 2 x 6 = 12
If you do mean a round-trip (i.e. A to B to C to B to A), then there are 10 possible ways to do it, since you can utilize the roads only once (2 x 5 now, not 2 x 6). I'm not very good at explaining mathematical technicalities, but I'm quite certain that my answers should be accurate, hope it helped!
2007-03-15 04:24:19 · answer #2 · answered by Marcao 3 · 0⤊ 0⤋
only 2 because town a only has 2 roads
2007-03-15 04:11:53 · answer #3 · answered by Waylon V 3 · 0⤊ 0⤋
6*2 = 12 different roads.
2007-03-15 04:12:24 · answer #4 · answered by Peter_Jackson_Fan 4 · 0⤊ 0⤋
twice, **** that was kinda hard, i had to write it out, math and me dont agree. . . . When i have to answer questions like these, I draw a picture, i had town A, B and C drawn out with the little roads, maybe if you try it the next time it would help you out, it takes a while longer to figure it out, but incase you have more that you're stumped on, and i see nothing wrong with writing it out :)
good luck!
2007-03-15 04:19:05 · answer #5 · answered by ♣Kellina♣ 5 · 0⤊ 0⤋
Sounds like 2
2007-03-15 04:08:44 · answer #6 · answered by Buff98216 2 · 0⤊ 0⤋
eleven
There are actually 2 x 6 combinations.
The first leg must take one road going and the other, coming back.
For the 6 roads, one must be omitted coming back.
so 12-1 = 11
2007-03-15 04:13:21 · answer #7 · answered by ignoramus 7 · 0⤊ 1⤋
It might be 12.But you said that it is not allowed to return through the same road twice.And there is only two road from A to B.so......
THE ANSWER IS 2
2007-03-15 04:18:04 · answer #8 · answered by mariz s 2 · 0⤊ 0⤋
the answer is 2C1 ways * 6C2
ie 2 * 6*5 =60
2007-03-15 05:02:52 · answer #9 · answered by ? 3 · 0⤊ 0⤋
I cant remember enough from stats to asnwer this, but I remember enought o know that all of the answers above mine are "rubbish" Sorry I couldn't be more helpful.
2007-03-15 04:19:46 · answer #10 · answered by CBJ 4 · 0⤊ 0⤋