<< Chapter < Page | Chapter >> Page > |
The existence and uniqueness of the expansion is made plausible by simple examples utilizing minterm maps to determine graphically the minterm content of various Boolean combinations.Using the arrangement and numbering system introduced above, we let M i represent the i th minterm (numbering from zero) and let represent the probability of that minterm. When we deal with a union of minterms in a minterm expansion, it is convenient toutilize the shorthand illustrated in the following.
Consider the following simple example.
Suppose . Examination of the minterm map in [link] shows that consists of the union of minterms , which we designate . The combination , so that its complement . This leaves the common part . Hence, . Similarly, .
A key to establishing the expansion is to note that each minterm is either a subset of the combination or is disjoint from it. The expansion is thus the union of thoseminterms included in the combination. A general verification using indicator functions is sketched in the last section of this module.
A typical problem seeks the probability of certain Boolean combinations of a class of events when the probabilities of various other combinations is given.We consider several simple examples and illustrate the use of minterm maps in formulation and solution.
Statistical data are taken for a certain student population with personal computers. An individual is selected at random. Let the event the person selected has word processing, the event he or she has a spread sheet program, and the event the person has a data base program. The data imply
Several questions arise:
SOLUTION
The data, expressed in terms of minterm probabilities, are:
; hence
; hence
; hence
Notification Switch
Would you like to follow the 'Applied probability' conversation and receive update notifications?