Travel Routes.
Two roads connect cities A and B, four connect B and C, and five connect C and D. To drive form A to B, to C and then to D, find the number of possible routes.
Solution
Here we have a three-stage procedure. The first (A —> B) has 2 possibilities, the second (B —> C) has 4, and third (C —> D) has 5. The corresponding tree diagram is as follows.
By the fundamental principle of counting, the number of possible routes is 2 x 4 x 5 = 40.
It can be shown by tree diagram as follows :
Travel Routes. Two roads connect cities A and B, four connect B and C, and five connect C and D. To drive form A to B, to C and then to D, find the number of possible routes.Solution Here we have a three-stage procedure. The first (A —> B) has 2 possibilities, the second (B —> C) has 4, and third (C —> D) has 5. The corresponding tree diagram is as follows. By the fundamental principle of counting, the number of possible routes is 2 x 4 x 5 = 40. It can be shown by tree diagram as follows :
การแปล กรุณารอสักครู่..