Download presentation

Presentation is loading. Please wait.

Published byCindy Heckler Modified over 2 years ago

1
Main Menu Main Menu (Click on the topics below) Combinations Example Theorem Click on the picture

2
Combinations Sanjay Jain, Lecturer, School of Computing

3
Combinations Let n, r 0, be such that r n. Suppose A is a set of n elements. An r-combination of A, is a subset of A of size r. Pronounced: n choose r Denotes the number of different r-combinations of a set of size n. Some other notations commonly used are n C r, and C(n,r).

4
Combinations Combinations ---> unordered selection Permutation ---> ordered selection

5
END OF SEGMENT

6
Example There are 7 questions in an exam. You need to select 5 questions to answer. How many ways can you select the questions to answer? (order does not matter) Here 7 is the number of questions and 5 is the number of questions selected

7
END OF SEGMENT

8
Example In how many ways 52 cards can be distributed to N, S, E, W in a game of bridge. T 1 : give 13 cards to N T 2 : give 13 of the remaining cards to E T 3 : give 13 of the remaining cards to S T 4 : give 13 of the remaining cards to W

9
Example In how many ways 52 cards can be distributed to N, S, E, W in a game of bridge. T 1 : give 13 cards to N T 1 : can be done in ways.

10
Example In how many ways 52 cards can be distributed to N, S, E, W in a game of bridge. T 2 : give 13 of the remaining cards to E T 2 : can be done in ways.

11
Example In how many ways 52 cards can be distributed to N, S, E, W in a game of bridge. T 3 : give 13 of the remaining cards to S T 3 : can be done in ways.

12
Example In how many ways 52 cards can be distributed to N, S, E, W in a game of bridge. T 4 : give 13 of the remaining cards to W T 4 : can be done in ways.

13
Example In how many ways 52 cards can be distributed to N, S, E, W in a game of bridge. T 1 : give 13 cards to N T 2 : give 13 of the remaining cards to E T 3 : give 13 of the remaining cards to S T 4 : give 13 of the remaining cards to W Thus using the multiplication rule total number of ways in which cards can be distributed is

14
END OF SEGMENT

15
Example 70 faculty members. Need to choose two committees: A) Curriculum committee of size 4 B) Exam committee of size 3 How many ways can this be done if the committees are to be disjoint?

16
Example T 1 : Choose curriculum committee T 2 : Choose exam committee T1:T1: ways T2:T2: The selection of both comm can be done in * ways

17
END OF SEGMENT

18
Example From 300 students I need to select a president, secretary and 3 ordinary members of Executive committee. How many ways can this be done?

19
1st Method: T 1 : president---300 T 2 : secretary---299 T 3 : 3 ordinary members--- 298 C 3 2nd Method: T 1 : 5 members of the committee --- 300 C 5 T 2 : choose president among the members of the committee --- 5 T 3 : choose secretary among the members of the committee --- 4

20
END OF SEGMENT

21
Example From 300 students I need to select a football team of 11 players. Tom and Sam refuse to be in the team together. How many ways can the team be selected? Case 1: Tom is in the team. Case 2: Sam is in the team. Case 3: Neither Tom nor Sam is in the team.

22
Example Case 1: Tom is in the team. Need to select 10 out the remaining 298 students.

23
Example Case 2: Sam is in the team. Need to select 10 out the remaining 298 students.

24
Example Case 3: Both Tom and Sam are not in the team. Need to select 11 out the remaining 298 students.

25
Example From 300 students I need to select a football team of 11 players. Tom and Sam refuse to be in the team together. How many ways can the team be selected? Case 1: Tom is in the team. --- 298 C 10 Case 2: Sam is in the team. --- 298 C 10 Case 3: Neither Tom nor Sam is in the team. --- 298 C 11 Thus total number of possible ways to select the team is:

26
END OF SEGMENT

27
Example There are 6 boys and 5 girls. In how many ways can one form an executive committee of size 4 such that there is at least one member of each sex? Wrong method: T 1 : select one boy. --- 6 ways T 2 : select one girl. --- 5 ways T 3 : select 2 others. --- 9 C 2 ways 6*5* 9 C 2 ways to select the committee.

28
Example There are 6 boys and 5 girls. In how many ways can one form an executive committee of size 4 such that there is at least one member of each sex? Wrong method: B1 G1 G2, G3 B1 G2 G1, G3 B1 G3 G1, G2 Selection of B1, G1, G2, G3 is counted as:

29
END OF SEGMENT

30
Example There are 6 boys and 5 girls. In how many ways can one form an executive committee of size 4 such that there is at least one member of each sex?

31
Example Correct method: A: Choose 4 members of the committee (without restrictions) B: Choose 4 members of the committee without any boys. C: Choose 4 members of the committee without any girls. D: Choose 4 members of the committee with at least one boy and at least one girl. D=A-B-C

32
END OF SEGMENT

33
Theorem Proof: Choose k out of n elements Choose k out of n elements in order a) Choose k out of n elements. b) Put order P(n,k) Thus:

34
END OF SEGMENT

Similar presentations

OK

Fall 2002CMSC 203 - Discrete Structures1 One, two, three, we’re… Counting.

Fall 2002CMSC 203 - Discrete Structures1 One, two, three, we’re… Counting.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on search engines Free download ppt on sources of energy Ppt on water activity test Ppt on next generation 2-stroke engine compression Ppt on ethical hacking and cybercrime Ppt on childhood obesity in india Download ppt on biomass power plant Ppt on application of linear algebra in computer graphics Ppt on art of war author Free download ppt on forest and wildlife