m (New page: '''Isaac's Webpage''' Math 375) |
|||
| (7 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
| − | + | [[Category:MA375Spring2009Walther]] | |
| − | + | ||
| + | So the problem states that there are four ways from Boston to Detroit and then six ways from Detroit to L.A., so because you can pair each trip from one town with any trip to the other, there are 4*6 ways you can take this trip. | ||
Latest revision as of 19:15, 26 January 2009
So the problem states that there are four ways from Boston to Detroit and then six ways from Detroit to L.A., so because you can pair each trip from one town with any trip to the other, there are 4*6 ways you can take this trip.
