href="#fb3_img_img_db1fa3a5-6c3e-5a44-a12f-64f3902be128.png" alt="upper E"/> denote brown eyes.
1 The probability of having brown eyes or brown hair isNotice that and are not mutually exclusive. If we made a mistake and used the simple addition rule , we would mistakenly get
2 The complement of having neither brown eyes nor brown hair is having brown eyes or brown hair. Thus,
FIGURE 1.2: Venn diagram.
1.5 EQUALLY LIKELY OUTCOMES
The simplest probability model for a finite sample space is that all outcomes are equally likely. If
Computing probabilities for equally likely outcomes takes a fairly simple form. Suppose
In other words, probability with equally likely outcomes reduces to counting elements in
Example 1.9 A palindrome is a word that reads the same forward or backward. Examples include mom, civic, and rotator. Pick a three-letter “word” at random choosing from D, O, or G for each letter. What is the probability that the resulting word is a palindrome? (Words in this context do not need to be real words in English, e.g., is a palindrome.)There are 27 possible words (three possibilities for each of the three letters). List and count the palindromes: DDD, OOO, GGG, DOD, DGD, ODO, OGO, GDG, and GOG. The probability of getting a palindrome is
Example 1.10 A bowl has red balls and blue balls. A ball is drawn randomly from the bowl. What is the probability of selecting a red ball?The sample space consists of balls. The event has elements. Therefore, .
A model for equally likely outcomes assumes a finite sample space. Interestingly, it is impossible to have a probability model of equally likely outcomes on an infinite sample space. To see why, suppose
While equally likely outcomes are not possible in the infinite case, there are many ways to assign probabilities for an infinite sample space where outcomes are not equally likely. For instance, let
We introduce some basic counting principles in the next two sections because counting plays a fundamental role in probability when outcomes are equally likely.
1.6 COUNTING I
Counting sets is sometimes not as easy as
Multiplication principle
If there are
More generally—and more formally—consider an