MAT 2720 Discrete Mathematics

Slides:



Advertisements
Similar presentations
5.3 Permutations and Combinations
Advertisements

Counting. Counting = Determining the number of elements of a finite set.
Exam 1 Review
Recursively Defined Functions
Section 4.1: The Basics of Counting As we have seen, one way to count the number of objects in a finite set S is to produce a one-to-one correspondence.
College of Information Technology & Design
CSE115/ENGR160 Discrete Mathematics 04/17/12
CSE 321 Discrete Structures Winter 2008 Lecture 16 Counting.
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Counting and Probability Sets and Counting Permutations & Combinations Probability.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Sequences and Series. Quick Review.
MAT 2720 Discrete Mathematics Section 6.1 Basic Counting Principles
Introduction to Counting Discrete Structures. A Multiplication Principle.
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Counting. Techniques for counting Rule 1 Suppose we carry out have a sets A 1, A 2, A 3, … and that any pair are mutually exclusive (i.e. A 1  A 2 =
1/31/2007 Pre-Calculus Chapter 9 Review a n = a 1 + (n – 1)d a n = a 1 r (n – 1)
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Section 2.6: Probability and Expectation Practice HW (not to hand in) From Barr Text p. 130 # 1, 2, 4-12.
1 Lecture 4 (part 1) Combinatorics Reading: Epp Chp 6.
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
The Basics of Counting Section 6.1.
Quiz Plot the point: (-4, 2, -3) in the Cartesian space. Find the midpoint between the 2 points: P(1, 5, -7) and Q(-5, 3, -3) 3. Find the distance.
CSNB143 – Discrete Structure
A Brief Summary for Exam 2 Subject Topics Number theory (sections ) –Prime numbers Definition Relative prime Fundamental theorem of arithmetic.
Permutations and Combinations Review: Counting Principle 1.) Carol has 4 skirts, 3 shirts, and 3 pairs of shoes. How many different outfits are possible?
Menu Traditional Menu Other Menu Nasi LemakBeef Burger Roti Canai Potatoes Chip Capati French Bread Mee Goreng Drink : Coffee, Tea, Coke and Pepsi.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
Counting Techniques. Multiplication Principle (also called the Fundamental Counting Principle) Combinations Permutations Number of subsets of a given.
MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
CS 104: Discrete Mathematics
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
Quiz: Draw the unit circle: Include: (1)All “nice” angles in degrees (2) All “nice” angles in radians (3) The (x, y) pairs for each point on the unit circle.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Section 6.3. Section Summary Permutations Combinations.
EXAMPLE 1 Count permutations
Counting, Permutations, & Combinations
Chapter 10 Counting Methods.
Counting, Permutations, & Combinations
MATH 2311 Section 2.1.
CSE15 Discrete Mathematics 04/19/17
ICS 253: Discrete Structures I
Chapter 5, Section 5.1 The Basics of Counting
Counting, Permutations, & Combinations
COCS DISCRETE STRUCTURES
12.2 Permutations and Combinations
Counting, Permutations, & Combinations
Ronald Hui Tak Sun Secondary School
CS 2210 Discrete Structures Counting
Recursively Defined Functions
Lecture 08 Counting Profs. Koike and Yukita
Counting, Permutations, & Combinations
CS100: Discrete structures
A Brief Summary for Exam 2
Counting, Permutations, & Combinations
Counting, Permutations, & Combinations
Basic Counting.
Combinatorics.
CSE 321 Discrete Structures
CSE 321 Discrete Structures
Permutations.
MATH 2311 Section 2.1.
Chapter 11: Further Topics in Algebra
Chapter 3. Sets & Combinatorics
9.1 Basic Combinatorics.
MATH 2311 Section 2.1.
Presentation transcript:

MAT 2720 Discrete Mathematics Section 6.1 Basic Counting Principles http://myhome.spu.edu/lauw

General Goals Develop counting techniques. Set up a framework for solving counting problems. The key is not (just) the correct answers. The key is to explain to your audiences how to get to the correct answers (communications).

Goals Basics of Counting Multiplication Principle Addition Principle Inclusion-Exclusion Principle

Example 1 License Plate # of possible plates = ? LLL-DDD

LLL-DDD Analysis License Plate # of possible plates = ? Procedure: Step 1: Step 4: Step 2: Step 5: Step 3: Step 6: LLL-DDD

Multiplication Principle Suppose a procedure can be constructed by a series of steps Number of possible ways to complete the procedure is

Example 2(a) Form a string of length 4 from the letters A, B, C , D, E without repetitions. How many possible strings?

Example 2(b) Form a string of length 4 from the letters A, B, C , D, E without repetitions. How many possible strings begin with B?

Example 3 Pick a person to joint a university committee. # of possible ways = ?

Analysis Pick a person to joint a university committee. # of possible ways = ? The 2 sets: :

Addition Principle Number of possible element that can be selected from X1 or X2 or …or Xk is OR

Example 4 A 6-person committee composed of A, B, C , D, E, and F is to select a chairperson, secretary, and treasurer.

Example 4 (a) In how many ways can this be done?

Example 4 (b) In how many ways can this be done if either A or B must be chairperson?

Example 4 (c) In how many ways can this be done if E must hold one of the offices?

Example 4 (d) In how many ways can this be done if both A and D must hold office?

Recall: Intersection of Sets (1.1) The intersection of X and Y is defined as the set

Recall: Intersection of Sets (1.1) The intersection of X and Y is defined as the set

Example 5 What is the relationship between

Inclusion-Exclusion Principle

Example 4(e) How many selections are there in which either A or D or both are officers?.

Remarks on Presentations Some explanations in words are required. In particular, when using the Multiplication Principle, use the “steps” to explain your calculations A conceptual diagram may be helpful.

MAT 2720 Discrete Mathematics Section 6.2 Permutations and Combinations Part I http://myhome.spu.edu/lauw

Goals Permutations and Combinations Definitions Formulas Binomial Coefficients

Example 1 6 persons are competing for 4 prizes. How many different outcomes are possible? Step 1: Step 2: Step 3: Step 4:

r-permutations A r-permutation of n distinct objects is an ordering of an r-element subset of

r-permutations A r-permutation of n distinct objects is an ordering of an r-element subset of The number of all possible ordering:

Example 1 6 persons are competing for 4 prizes. How many different outcomes are possible?

Theorem

Example 2 100 persons enter into a contest. How many possible ways to select the 1st, 2nd, and 3rd prize winner?

Example 3(a) How many 3-permutations of the letters A, B, C , D, E, and F are possible?

Example 3(b) How many permutations of the letters A, B, C , D, E, and F are possible. Note that, “permutations” means “6-permutations”.

Example 3(c) How many permutations of the letters A, B, C , D, E, and F contains the substring DEF?

Example 3(d) How many permutations of the letters A, B, C , D, E, and F contains the letters D, E, and F together in any order?