Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Chapter 9.

Slides:



Advertisements
Similar presentations
22C:19 Discrete Math Sets and Functions Fall 2011 Sukumar Ghosh.
Advertisements

THE WELL ORDERING PROPERTY Definition: Let B be a set of integers. An integer m is called a least element of B if m is an element of B, and for every x.
Most-to-Least Legible Color Combinations for Viewing on Slide Shows Color and contrast are very important tools in communication. They can be used to enhance.
Counting Chapter 6 With Question/Answer Animations.
Chapter 4 Probability and Probability Distributions
Probability Dr. Deshi Ye Outline  Introduction  Sample space and events  Probability  Elementary Theorem.
Section 1.5 Events A and B are called independent events if and only if P(A  B) = P(A) P(B)  P(A) = P(A | B)  P(B) = P(B | A) Events A, B, and C are.
Chapter 9 Generating functions Yen-Liang Chen Dept of Information Management National Central University.
Chapter 6.1 Generating Functions
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 27, Wednesday, November 5.
Counting Techniques: r-combinations with
Distributions.
Tucker, Section 5.41 Section 5.4 Distributions By Colleen Raimondi.
Combinatorics Chapter 3 Section 3.3 Permutations Finite Mathematics – Stall.
Consecutive Numbers Algebra I.
Chapter Probability © 2010 Pearson Prentice Hall. All rights reserved 3 5.
College Algebra Fifth Edition
Moment Generating Functions 1/33. Contents Review of Continuous Distribution Functions 2/33.
Chapter 1 Fundamental principles of counting 陳彥良 中央大學資管系.
Chapter 6 The Inclusion-Exclusion Principle and Applications
Moment Generating Functions
Sequences & Summation Notation 8.1 JMerrill, 2007 Revised 2008.
Free Powerpoint Templates Page 1 Free Powerpoint Templates EQT 272 PROBABILITY AND STATISTICS SYAFAWATI AB. SAAD INSTITUTE FOR ENGINEERING MATHEMATICS.
What is a Line? A line is the set of points forming a straight path on a plane The slant (slope) between any two points on a line is always equal A line.
1 Relations and Functions Chapter 5 1 to many 1 to 1 many to many.
9.3 Addition Rule. The basic rule underlying the calculation of the number of elements in a union or difference or intersection is the addition rule.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
1 Chapter 7 Generating functions. 2 Summary Generating functions Recurrences and generating functions A geometry example Exponential generating functions.
1 Discrete and Combinatorial Mathematics R. P. Grimaldi, 5 th edition, 2004 Chapter 6 Generating Functions.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Chapter 3 Permutations and combinations
March 10, 2015Applied Discrete Mathematics Week 6: Counting 1 Permutations and Combinations How many different sets of 3 people can we pick from a group.
Chapter 7 Advance Counting Techniques. Content Recurrence relations Generating function The principle of inclusion-exclusion.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Chapter 5 The Binomial Coefficients
Copyright © 2011 Pearson Education, Inc. Combinations, Labeling, and the Binomial Theorem Section 8.5 Sequences, Series, and Probability.
King Saud University Women Students
Week 11 What is Probability? Quantification of uncertainty. Mathematical model for things that occur randomly. Random – not haphazard, don’t know what.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
EQT 272 PROBABILITY AND STATISTICS
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
Stats Probability Theory Summary. The sample Space, S The sample space, S, for a random phenomena is the set of all possible outcomes.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
The Pigeonhole Principle. The pigeonhole principle Suppose a flock of pigeons fly into a set of pigeonholes to roost If there are more pigeons than pigeonholes,
Discrete Mathematics Lecture # 25 Permutation & Combination.
1.8 Absolute Value Equations and Inequalities Warm-up (IN) Learning Objective: to write, solve and graph absolute value in math and in real-life situations.
Essential Question: How do you solve a system of inequalities by graphing?
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
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.
1 Chapter 5 DIFFERENCE EQUATIONS. 2 WHAT IS A DIFFERENCE EQUATION? A Difference Equation is a relation between the values y k of a function defined on.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
3/7/20161 Now it’s time to look at… Discrete Probability.
Distributions. Basic Model for Distributions of Distinct Objects The following problems are equivalent: Distributing n distinct objects into b distinct.
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Set Theory Two's company, three is none. Chapter 3.
Combinatorial Principles, Permutations, and Combinations
UNIT 5 Fundamental principles of counting
The Pigeonhole Principle
Sequences & Summation Notation
Consecutive Numbers Algebra I.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Chapter R Section 1.
CS100: Discrete structures
PROBABILITY AND STATISTICS
Section 5 – Locating Zeros of a Polynomial Function
Problem Solving: Consecutive Integers
Permutations and Combinations
Math 0332 Subsets Name ________________________
Chapter 3 Vocabulary 3.)Roster form 4.) Set-builder notation 5.) Empty set 6.) Universal set 7.) Complement of a set.
Presentation transcript:

Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Chapter 9

Discrete Math by R.S. Chang, Dept. CSIE, NDHU2 Chapter Introductory Examples Ex. 9.1 Find the number of integer solutions to

Discrete Math by R.S. Chang, Dept. CSIE, NDHU3 Chapter Introductory Examples Ex. 9.3 How many integer solutions are there for the equation

Discrete Math by R.S. Chang, Dept. CSIE, NDHU4 Chapter Definitions and Examples: Calculational Techniques

Discrete Math by R.S. Chang, Dept. CSIE, NDHU5 Chapter Definitions and Examples: Calculational Techniques

Discrete Math by R.S. Chang, Dept. CSIE, NDHU6 Chapter Definitions and Examples: Calculational Techniques Ex. 9.5 (continued)

Discrete Math by R.S. Chang, Dept. CSIE, NDHU7 Chapter Definitions and Examples: Calculational Techniques

Discrete Math by R.S. Chang, Dept. CSIE, NDHU8 Chapter Definitions and Examples: Calculational Techniques Extension of binomial coefficient

Discrete Math by R.S. Chang, Dept. CSIE, NDHU9 Chapter Definitions and Examples: Calculational Techniques

Discrete Math by R.S. Chang, Dept. CSIE, NDHU10 Chapter Definitions and Examples: Calculational Techniques Ex In how many ways can we select, with repetitions allowed, r objects from n distinct objects?

Discrete Math by R.S. Chang, Dept. CSIE, NDHU11 Chapter Definitions and Examples: Calculational Techniques

Discrete Math by R.S. Chang, Dept. CSIE, NDHU12 Chapter Definitions and Examples: Calculational Techniques

Discrete Math by R.S. Chang, Dept. CSIE, NDHU13 Chapter Definitions and Examples: Calculational Techniques Ex Use generating functions to determine how many four- element subsets of S={1,2,3,...,15} contain no consecutive integers.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU14 Chapter Definitions and Examples: Calculational Techniques

Discrete Math by R.S. Chang, Dept. CSIE, NDHU15 Chapter Partitions of Integers Partition a positive integer n into positive summands and seeking the number of such partitions, without regard to order. For example, p(1)=1: 1 p(2)=2: 2=1+1 p(3)=3: 3=2+1=1+1+1 p(4)=5: 4=3+1=2+2=2+1+1= p(5)=7: 5=4+1=3+2=3+1+1=2+2+1= = We should like to obtain p(n) for a given n without having to list all the partitions. We need a tool to keep track of the numbers of 1's, 2's,..., n's that are used as summands for n.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU16 Chapter Partitions of Integers

Discrete Math by R.S. Chang, Dept. CSIE, NDHU17 Chapter Partitions of Integers Ex Find the generating function for the number of ways an advertising agent can purchase n minutes of air time if time slots for commercials come in blocks of 30, 60, or 120 seconds.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU18 Chapter Partitions of Integers Ex Find the generating function for p d (n), the number of partitions of a positive integer n into distinct summands.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU19 Chapter Partitions of Integers Ex Partition into odd summands but each such odd summands must occur an odd number of times-or not at all. Ferrer's graph 14= = The number of partitions of an integer n into m summands is equal to the number of partitions where m is the largest summands.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU20 Chapter The Exponential Generating Function ordinary generating functions: selections (order is irrelevant)

Discrete Math by R.S. Chang, Dept. CSIE, NDHU21 Chapter The Exponential Generating Function Ex In how many ways can four of the letters in ENGINE be arranged?

Discrete Math by R.S. Chang, Dept. CSIE, NDHU22 Chapter The Exponential Generating Function Ex A ship carries 48 flags, 12 each of the colors red, white, blue, and black. Twelve of these flags are placed on a vertical pole in order to communicate a signal to other ships.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU23 Chapter The Exponential Generating Function Ex (continued) (a) How many of these signals use an even number of blue flags and odd number of black flags?

Discrete Math by R.S. Chang, Dept. CSIE, NDHU24 Chapter The Exponential Generating Function Ex (continued) (b) How many of these signals have at least three white flags or no white flags at all?

Discrete Math by R.S. Chang, Dept. CSIE, NDHU25 Chapter 9 Ex Assign 11 new employees to 4 subdivisions. Each subdivision will get at least one new employees.. the number of onto functions

Discrete Math by R.S. Chang, Dept. CSIE, NDHU26 Chapter The Summation Operator

Discrete Math by R.S. Chang, Dept. CSIE, NDHU27 Chapter The Summation Operator

Discrete Math by R.S. Chang, Dept. CSIE, NDHU28 Chapter 9 Summaries (m objects, n containers) Objects Containers Some Number Are Are Containers of Distinct Distinct May Be Empty Distributions Yes Yes Yes n m Yes Yes No n!S(m,n) Yes No Yes S(m,1)+S(m,2)+...+S(m,n) Yes No No S(m,n) No Yes Yes No Yes No No No Yes (1) p(m), for n=m No No No (2) p(m,1)+p(m,2)+...+p(m,n), n<m p(m,n) p(m.n):number of partitions of m into exactly n summands

Discrete Math by R.S. Chang, Dept. CSIE, NDHU29 Chapter 9 Exercise: P390: 6 P399: 18,20 P403: 9,10 P408: 6