HERE WE GO GUYS...QUESTION ON THE FUNDAMENTAL COUNTING PRINCIPLE (FCP)
This is out of the Mickelson (hmm i always thought it was nickleson) book. pg 176.
There are 4 roads between cities A and B, and 3 roads between cities B and C.
a) How many ways can a person travel from A to C through city B??
(4)(3) = 12
b) How many ways can a person make a round trip from A to C and back to A, through city B?
(4)(3)(3)(4) = 144
c) How many ways can a person make a round trip from A to C and back to A through city B, without using any road twice?
(4)(3)(2)(3) = 72
Alright, hope that helped and you all do great
Tuesday, November 24, 2009
Subscribe to:
Post Comments (Atom)
"Nickleson", I find that quite humorous.
ReplyDelete