22c:19 discrete math counting
DESCRIPTION
22C:19 Discrete Math Counting. Fall 2011 Sukumar Ghosh. The Product Rule. Example of Product Rule. Example of Product Rule. The Sum Rule. Example of Sum Rule. Example of Sum Rule. Wedding picture example. Counting subsets of a finite set. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/1.jpg)
22C:19 Discrete MathCounting
Fall 2011Sukumar Ghosh
![Page 2: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/2.jpg)
The Product Rule
![Page 3: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/3.jpg)
Example of Product Rule
![Page 4: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/4.jpg)
Example of Product Rule
![Page 5: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/5.jpg)
The Sum Rule
![Page 6: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/6.jpg)
Example of Sum Rule
![Page 7: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/7.jpg)
Example of Sum Rule
![Page 8: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/8.jpg)
Wedding picture example
![Page 9: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/9.jpg)
Counting subsets of a finite set
Let S be a finite set. Use product rule to show that the number of different subsets of S is 2|S|
![Page 10: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/10.jpg)
Counting loops
How many times will the following program loop iteratebefore the final solution is generated? What is the final value of K?
K:=0for i1: = 1 to n1
for i2 := 1 to n2for i3:= 1 to n3
K:= K+1
![Page 11: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/11.jpg)
The Inclusion-Exclusion Principle
![Page 12: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/12.jpg)
The Inclusion-Exclusion Principle
![Page 13: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/13.jpg)
Tree diagrams
![Page 14: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/14.jpg)
Tree diagrams
![Page 15: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/15.jpg)
Pigeonhole Principle
If 20 pigeons flies into 19 pigeonholes, then at least one of the pigeonholes must have at least two pigeons in it. Such observations lead to the pigeonhole principle.
THE PIGEONHOLE PRINCIPLE. Let k be a positive integer. Ifmore than k objects are placed into k boxes, then at leastone box will contain two or more objects.
![Page 16: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/16.jpg)
Application of Pigeonhole Principle
An exam is graded on a scale 0-100. How many students should be there in the class so that at least two studentsget the same score?
More than 101.
![Page 17: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/17.jpg)
Generalized Pigeonhole Principle
If N objects are placed in k boxes, then there is at leastone box containing at least N/k꜒ ˥objects.
Application 1. In a class of 73 students, there are at least 73/12꜒ ˥=7 who are born in the same month.Application 2.
![Page 18: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/18.jpg)
More applications of pigeonhole principle
![Page 19: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/19.jpg)
More applications of pigeonhole principle
![Page 20: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/20.jpg)
Permutation
![Page 21: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/21.jpg)
Permutation
Note that P (n,n) = n!
![Page 22: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/22.jpg)
Example of permutation
![Page 23: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/23.jpg)
Exercise
![Page 24: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/24.jpg)
Combination
In permutation, order matters.
![Page 25: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/25.jpg)
Example of combination
In how many bit strings of length 10, there are exactly four 1’s?
![Page 26: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/26.jpg)
Proof of combination formula
![Page 27: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/27.jpg)
Proof of combination formula
![Page 28: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/28.jpg)
Circular seating
![Page 29: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/29.jpg)
Other applications
![Page 30: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/30.jpg)
Book shelf problem
![Page 31: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/31.jpg)
Pascal’s Identity
If n, k are positive integers and n ≥ k , then
C(n+1, k) = C(n, k) + C(n, k-1)
![Page 32: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/32.jpg)
Binomial Theorem
![Page 33: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/33.jpg)
Proof of Binomial Theorem
![Page 34: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/34.jpg)
Proof of Binomial Theorem
![Page 35: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/35.jpg)
Proof of Binomial Theorem
![Page 36: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/36.jpg)
Proof of Binomial Theorem
![Page 37: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/37.jpg)
Example of Binomial Theorem
![Page 38: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/38.jpg)
Example of Binomial Theorem
![Page 39: 22C:19 Discrete Math Counting](https://reader035.vdocuments.site/reader035/viewer/2022062520/568161db550346895dd1e8e4/html5/thumbnails/39.jpg)
Example: Approximating (1+x)n
The number of terms to be included will depend on the desired accuracy.