Probability. Robert P. Dobrow
Чтение книги онлайн.

Читать онлайн книгу Probability - Robert P. Dobrow страница 19

Название: Probability

Автор: Robert P. Dobrow

Издательство: John Wiley & Sons Limited

Жанр: Математика

Серия:

isbn: 9781119692416

isbn:

СКАЧАТЬ plate of the form G-Z-N---. For the three blanks, there are 10 possibilities. Thus, the desired probability is

       Example 1.12 A DNA strand is a long polymer string made up of four nucleotides—adenine, cytosine, guanine, and thymine. It can be thought of as a sequence of As, Cs, Gs, and Ts. DNA is structured as a double helix with two paired strands running in opposite directions on the chromosome. Nucleotides always pair the same way: A with T and C with G. A palindromic sequence is equal to its “reverse complement.” For instance, the sequences CACGTG and TAGCTA are palindromic sequences (with reverse complements GTGCAC and ATCGAT, respectively), but TACCAT is not (reverse complement is ATGGTA). Such sequences play a significant role in molecular biology.Suppose the nucleotides on a DNA strand of length six are generated in such a way so that all strands are equally likely. What is the probability that the DNA sequence is a palindromic sequence?By the multiplication principle, the number of DNA strands is because there are four possibilities for each site. A palindromic sequence of length six is completely determined by the first three sites. There are palindromic sequences. The desired probability is

       Example 1.13 Logan is taking four final exams next week. His studying was erratic and all scores A, B, C, D, and F are equally likely for each exam. What is the probability that Logan will get at least one A?Take complements (often an effective strategy for “at least” problems). The complementary event of getting at least one A is getting no A's. As outcomes are equally likely, by the multiplication principle there are exam outcomes with no A's (four grade choices for each of four exams). And there are possible outcomes in all. The desired probability is

      1.6.1 Permutations

      Given a set of distinct objects, a permutation is an ordering of the elements of the set. For the set StartSet a comma b comma c EndSet, there are six permutations:

left-parenthesis a comma b comma c right-parenthesis comma left-parenthesis a comma c comma b right-parenthesis comma left-parenthesis b comma a comma c right-parenthesis comma left-parenthesis b comma c comma a right-parenthesis comma left-parenthesis c comma a comma b right-parenthesis comma and left-parenthesis c comma b comma a right-parenthesis period

      How many permutations are there of an n-element set? There are n possibilities for the first element of the permutation, n minus 1 for the second, and so on. The result follows by the multiplication principle.

      COUNTING PERMUTATIONS

      There are n times left-parenthesis n minus 1 right-parenthesis times midline-horizontal-ellipsis times 1 equals n factorial permutations of an n-element set.

      The factorial function n factorial grows very large very fast. In a classroom of 10 people with 10 chairs, there are 10 factorial equals 3,628,800 ways to seat the students. There are 52 factorial almost-equals 8 times 1 0 Superscript 67 orderings of a standard deck of cards, which is “almost” as big as the number of atoms in the observable universe, which is estimated to be about 1 0 Superscript 80 Baseline period

      Functions of the form c Superscript n, where c is a constant, are said to exhibit exponential growth. The factorial function n factorial grows like n Superscript n, which is sometimes called super-exponential growth.

      More precisely,

limit Underscript n right-arrow infinity Endscripts StartFraction n factorial Over n Superscript n Baseline e Superscript negative n Baseline StartRoot 2 pi n EndRoot EndFraction equals 1 period

      We say that n factorial “is asymptotic to” the function n Superscript n Baseline e Superscript negative n Baseline StartRoot 2 pi n EndRoot period

      How do we use permutations to solve problems? The following examples illustrate some applications.

       Example 1.14 Maria has three bookshelves in her dorm room and 15 books—5 are math books and 10 are novels. If each shelf holds exactly five books and books are placed randomly on the shelves (all orderings are equally likely), what is the probability that the bottom shelf contains all the math books?There are ways to permute all the books on the shelves. There are ways to put the math books on the bottom shelf and ways to put the remaining novels on the other two shelves. Thus, by the multiplication principle, the desired probability is

       Example 1.15 A bag contains six Scrabble tiles with the letters A-D-M-N-O-R. You reach into the bag and take out tiles one at a time. What is the probability that you will spell the word R-A-N-D-O-M?How many possible words can be formed? All the letters are distinct and a “word” is a permutation of the set of six letters. There are possible words. Only one of them spells R-A-N-D-O-M, so the desired probability is

       Example 1.16 Scrabble continued. Change the previous example. After you pick a tile from the bag, write down that letter and then return the tile to the bag. So every time you reach into the bag, it contains the six original letters. What is the СКАЧАТЬ