Revision as of 20:15, 26 January 2009 by Mkburges (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


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.

Alumni Liaison

Ph.D. on Applied Mathematics in Aug 2007. Involved on applications of image super-resolution to electron microscopy

Francisco Blanco-Silva