Transcription of 35 Permutations, Combinations and Proba- bility
{{id}} {{{paragraph}}}
35 Permutations, Combinations and Proba- bilityThus far we have been able to list the elements of a sample space by drawinga tree diagram. For large sample spaces tree diagrams become very complexto construct. In this section we discuss counting techniques for finding thenumber of elements of a sample space or an event without having to list the following problem: In how many ways can 8 horses finish in arace (assuming there are no ties)? We can look at this problem as a decisionconsisting of 8 steps. The first step is the possibility of a horse to finishfirst in the race, the second step the horse finishes second.
How many ways are there to select a committee to develop a discrete mathe-matics course at a school if the committee is to consist of 3 faculty members from the mathematics department and 4 from the computer science depart-ment, if there are 9 faculty members of the math department and 11 of the CS department? Solution. There are C(9,3)·C(11,4 ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}