What is probabilty什么是概率.pptVIP

Probability Counting Chapter 8 Permutation Permutation is to arrange object in a linear order. If we have numbers 1, 2, 3. Then the all possible permutations are 123, 132, 213, 231, 312, 321 Question: If we have n objects, how many ways to arrange them in a linear order? Solution: How many possible choices in the first position? It is n. After choosing the first object, how many possible choices in the second position? It is (n-1). Similarly, after choosing the first two object, we have (n-2) possible choices in the third object. Therefore the total possible ways is number n(n-1)(n-2) · · · · 3·2 ·1 Definition 1: For positive integer n, the number n(n-1)(n-2) · · · · 3·2 ·1 is called the factorial product and written as n! = n(n-1)(n-2) · · · · 3·2 ·1 For examples 1! = 1, 2! =2 · 1 = 2, 3! = 3·2 ·1 =6 4! = 4 ·3 ·2 ·1= 24, 5! = 5 · 4 ·3 ·2 ·1=120 6! = 6 · 5 · 4 ·3 ·2 ·1= 720 Definition 2: 0! = 1 Theorem: The all possible permutations to arrange n objects in a linear order is n! Question: How many ways to choose r objects from n objects and arrange them in a linear order? Here r ≤ n. Solution: How many possible choices in the first position? It is n. After choosing the first object, how many possible choices in the second position? It is (n-1). Similarly, after choosing the first two object, we have (n-2) possible choices in the third object. Continuing this way, in the last position we have (n- r +1)possible Choices. Therefore total ways is product of r numbers n(n-1)(n-2) · · · · (n- r +1) We re-write this number as the following: Permutation Rule Examples Combination Combination is to choose objects without ordering arrangement. For example: A school basketball team has 12 players. Now we want to choose 5 player as starters. Then the outcome has no Ordering. For a player, the matter is to be chosen or