Presentation is loading. Please wait.

Presentation is loading. Please wait.

2. Combinatorial Methods p2. 2.1 Introduction If the sample space is finite and furthermore sample points are all equally likely, then P(A)=N(A)/N(S)

Similar presentations


Presentation on theme: "2. Combinatorial Methods p2. 2.1 Introduction If the sample space is finite and furthermore sample points are all equally likely, then P(A)=N(A)/N(S)"— Presentation transcript:

1

2 2. Combinatorial Methods

3 p2. 2.1 Introduction If the sample space is finite and furthermore sample points are all equally likely, then P(A)=N(A)/N(S) So we study combinatorial analysis here, which deals with methods of counting.

4 p3. 2.2 Counting principle Ex 2.1 How many outcomes are there if we throw 5 dice? Ex 2.2 In tossing 4 fair dice, P(at least one 3 among these 4 dice)=? Ex 2.3 Virginia wants to give her son, Brian, 14 different baseball cards within a 7-day period. If Virginia gives Brian cards no more than once a day, in how many way can this be done? Ex 2.6 (Standard Birthday Problem) P(at least two among n people have the same Bday)=?

5 p4. Counting principle Thm 2.3 A set with n elements has 2 n subsets. Ex 2.9 Mark has $4. He decides to bet $1 on the flip of a fair coin 4 times. What is the probability that (a) he breaks even; (b) he wins money?(use tree diagram)

6 p5. 2.3 Permutations Ex 2.10 3 people, Brown, Smith, and Jones, must be scheduled for job interviews. In how many different orders can this be done? Ex 2.11 2 anthropology, 4 computer science, 3 statistics, 3 biology, and 5 music books are put on a bookshelf with a random arrangement. What is the probability that the books of the same subject are together?

7 p6. Permutations Ex 2.12 If 5 boys and 5 girls sit in a row in a random order, P(no two children of the same sex sit together)=? Thm 2.4 The number of distinguishable permutations of n objects of k different types, where n 1 are alike, n 2 are alike, …, n k are alike and n=n 1 +n 2 +…+n k is

8 p7. Permutations Ex 2.13 How many different 10-letter codes can be made using 3 a’s, 4 b’s, and 3 c’s? Ex 2.14 In how many ways can we paint 11 offices so that 4 of them will be painted green, 3 yellow, 2 white, and the remaining 2 pink? Ex 2.15 A fair coin is flipped 10 times. P(exactly 3 heads)=?

9 p8. 2.4 Combinations Definition An unordered arrangement of r objects from a set A containing n objects (r  n) is called an r-element combination of A, or a combination of the elements of A taken r at a time. Notes :

10 p9. 2.4 Combinations Ex 2.16 In how many ways can 2 math and 3 biology books be selected from 8 math and 6 biology books? Ex 2.17 45 instructors were selected randomly to ask whether they are happy with their teaching loads. The response of 32 were negative. If Drs. Smith, Brown, and Jones were among those questioned. P(all 3 gave negative responses)=?

11 p10. Combinations Ex 2.18 In a small town, 11 of the 25 schoolteachers are against abortion, 8 are for abortion, and the rest are indifferent. A random sample of 5 schoolteachers is selected for an interview. (a)P(all 5 are for abortion)=? (b)P(all 5 have the same opinion)=? Ex 2.19 In Maryland’s lottery, player pick 6 integers between 1 and 49, order of selection being irrelevant. P(grand prize)=? P(2 nd prize)=? P(3 rd prize)=?

12 p11. Combinations Ex 2.20 7 cards are drawn from 52 without replacement. P(at least one of the cards is a king)=?

13 p12. E.g. 7 個人買食物, 有四種食物可選擇, 有幾種買法 ? first second third fourth xxxxxxx xx x x xxx xxxxxxx for x for Combinations with Repetition: Distributions

14 p13. In general, the number of selections, with repetitions, of r objects from n distinct objects are: Combinations with Repetition: Distributions

15 p14. E.g. Determine all integer solutions to the equation wherefor all select with repetition from7 times For example, ifis selected twice, then in the final solution. Therefore, C(4+7-1,7)=120 Combinations with Repetition: Distributions

16 p15. Equivalence of the following: (a) the number of integer solutions of the equation (b) the number of selections, with repetition, of size r from a collection of size n (c) the number of ways r identical objects can be distributed among n distinct containers Combinations with Repetition: Distributions

17 p16. E.g. How many nonnegative integer solutions are there to the inequality It is equivalent to which can be transformed to wherefo r an d C(7+9- 1,9)=5005 Combinations with Repetition: Distributions

18 p17. E.g. How many terms there are in the expansion of ? Each distinct term is of the form where for and Therefore, C(4+10-1,10)=286 Combinations with Repetition: Distributions

19 p18. Theorem 2.5 : Binomial Expansion For any integer n  0, Pf :

20 p19. Combinations Thm 2.5 (Binomial expansion) Ex 2.25 What is the coefficient of x 2 y 3 in the expansion of (2x+3y) 5 ? Ex 2.26 Evaluate the sum

21 p20. Combinations Ex 2.27 Evaluate the sum Ex 2.28 Prove that

22 p21. Combinations Thm 2.6 (Multinomial expansion).


Download ppt "2. Combinatorial Methods p2. 2.1 Introduction If the sample space is finite and furthermore sample points are all equally likely, then P(A)=N(A)/N(S)"

Similar presentations


Ads by Google