counting...first rule of counting: generalized product rule •if s is a set of sequences of length...
TRANSCRIPT
![Page 1: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/1.jpg)
Counting
![Page 2: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/2.jpg)
First rule of counting:Product Rule
• If S is a set of sequences of length k for which there are– n1 choices for the first element of sequence– n2 choices for the second element given any particular choice for
first– n3 choices for third given any particular choice for first and
second.– …..
• Then |S| = n1 x n2 x .... x nk
52 card deck choose ordered
Seg of 5 cards
52.51 50.49 48 52152 5
![Page 3: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/3.jpg)
First rule of counting:Generalized Product Rule
• If S is a set of sequences of length k for which there are– n1 choices for the first element of sequence– n2 choices for the second element given any particular choice for
first– n3 choices for third given any particular choice for first and
second.– …..
• Then |S| = n1 x n2 x .... x nk
Application: Number of ways of choosing an ordered sequence of r items out of n distinct items: n!/(n-r)!
deh r
![Page 4: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/4.jpg)
Second rule of counting:
• If order doesn’t matter, count ordered objects and then divide by the number of orderings.
ordered objects unoffejedaunordered objects
orderedobjects39
![Page 5: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/5.jpg)
Second rule of counting:
• If order doesn’t matter, count ordered objects and then divide by the number of orderings.
• Example: how many 5 card poker hands?5 ordered 5 unordered
East weorderedobjects unordered 52objects
a 35 52 5
52unordered Sf
![Page 6: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/6.jpg)
Combinations• Number of ways to choose r unordered objects
out of n distinct objects– A: set of ordered lists of r out of n objects– B: set of unordered lists of r out of n objects– Each ordered list maps to one unordered list.– Each unordered list has r! ordered lists that map to it.– |A| = r! |B|
Called “n choose r”
![Page 7: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/7.jpg)
quick review of cards
• 52 total cards• 13 different ranks: 2,3,4,5,6,7,8,9,10,J,Q,K,A• 4 different suits: Hearts, Clubs, Diamonds, Spades
![Page 8: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/8.jpg)
counting cards
• How many possible 5 card hands?
• A “straight” is five consecutive rank cards of any suit. How many possible straights?
• How many flushes are there?
chooserankoflowestcard Smtforbust sufferhighest5
to 4 510 4
choose suit choose unordered
setys cardsof that suit
4 Bsg
![Page 9: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/9.jpg)
counting cards
• How many possible 5 card hands?
• A “straight” is five consecutive rank cards of any suit. How many possible straights?
• How many flushes are there?
![Page 10: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/10.jpg)
counting paths
How many ways to walk from 1st and Spring to 5th and Pine only going North and East?
Pine
Pike
Union
Spring1st 2nd 3rd 4th 5th
Instead of tracing paths on the grid above, list choices. You walk 7 blocks; at each intersection choose N or E; must
choose N exactly 3 times.
fu
![Page 11: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/11.jpg)
counting paths
How many ways to walk from 1st and Spring to 5th and Pine only going North and East, if I want to stop at Starbucks on the way?
Pine
Pike
Union
Spring1st 2nd 3rd 4th 5th
tallE E r
![Page 12: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/12.jpg)
the sleuth’s criterion (Rudich)
For each object constructed it should be possible to reconstruct the unique sequence of choices that led to it!
choice 1 choice 2 choice k
h Mz Nk
![Page 13: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/13.jpg)
the sleuth’s criterion (Rudich)
For each object constructed it should be possible to reconstruct the unique sequence of choices that led to it!
Example: How many ways are there to choose a 5 card hand that contains at least 3 aces?
Choose 3 aces, then choose 2 cards from remaining 49.
to fix subtractAO K A A A
3 IFunnies
![Page 14: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/14.jpg)
the sleuth’s criterion (Rudich)
For each object constructed it should be possible to reconstruct the unique sequence of choices that led to it!
Example: How many ways are there to choose a 5 card hand that contains at least 3 aces?
Choose 3 aces, then choose 2 cards from remaining 49.
When in doubt break set up into disjoint sets you know
how to count!
c
![Page 15: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/15.jpg)
combinations
Combinations: Number of ways to choose r things from n things
Pronounced “n choose r” aka “binomial coefficients”
Many id
entities
:
E.g.,
of Sher
![Page 16: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/16.jpg)
subsetsVthIt subsets of sirencontainelts that damftfontain Y
TH
riff n III ghoorsepatgini.grB captainSarthe
team
![Page 17: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/17.jpg)
Combinatorial proof
• Let S be a set of objects.• Show how to count the set one way => N• Show how to count the set another way => M
• Therefore N=M
![Page 18: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/18.jpg)
combinations
Combinations: Number of ways to choose r things from n things
Pronounced “n choose r” aka “binomial coefficients”
Many id
entities
:
E.g.,
← by symmetry of definition
← 1st object either in or out
← team + captain
![Page 19: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/19.jpg)
the binomial theorem
Proof 1: Induction …
Proof 2: Counting
Pick either x or y from first factorPick either x or y from second factor…Pick either x or y from nth factor
How many ways to get exactly k x’s?
(x+y) • (x+y) • (x+y) • ... • (x+y)
fxisn
n o
x2yh2
t.iaiixi.inx5t3xIyt3xy7y38 y't 3 x'y2 x'y tf
x3
![Page 20: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/20.jpg)
an identity with binomial coefficients
Proof:
l s
E xgn a
![Page 21: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/21.jpg)
inclusion/exclusion principle
AB
AB C
|A∪B∪C| = |A| + |B| + |C| -|A∩B|-|A∩C|-|B∩C|
+ |A∩B∩C|
|A∪B| =|A|+|B|-|A∩B|
General: + singles - pairs + triples - quads + ...
7 mastpas
7 in2ndpg9 9 8
10 LO LO
Oto gdigit If's that have 7 in 1stposition or in 2ndposition
EE
![Page 22: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/22.jpg)
pigeonhole principle
If there are n pigeons in k holes and n > k, thensome hole contains more than one pigeon.
![Page 23: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/23.jpg)
pigeonhole principle
If there are n pigeons in k holes and n > k, thensome hole contains more than one pigeon.
More precisely, some hole contains at least pigeons.
To solve a PHP problem:1. Define the pigeons2. Define the pigeonholes3. Define the mapping of pigeons to pigeonholes
![Page 24: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/24.jpg)
pigeonhole principle
If there are n pigeons in k holes and n > k, thensome hole contains more than one pigeon.
More precisely, some hole contains at least pigeons.
Pigeons:Pigeonholes:Rule for assigning pigeon to pigeonhole:
Use the PHP to prove that n a room of 500 people, there are two people who share a birthday.
![Page 25: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/25.jpg)
Use Pigeonhole Principle to show that…
• In every set of 100 numbers, there are two whose difference is a multiple of 37.
Pigeons:Pigeonholes:Rule for assigning pigeon to pigeonhole:
![Page 26: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/26.jpg)
So far
• Product Rule• Sum Rule• Inclusion-exclusion• Permutations/combinations• Binomial Theorem• Combinatorial proofs• Pigeonhole principle
![Page 27: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/27.jpg)
Doughnuts• You go to Top Pot to buy a dozen doughnuts. Your
choices today are– Chocolate– Lemon-filled– Sugar– Glazed– Plain
• How many ways to choose a dozen doughnuts when doughnuts of the same type are indistinguishable?
![Page 28: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/28.jpg)
Bijection Rule• Count one set by counting another.• Example:
– A: all ways to select a dozen doughuts when five varieties are available.
– B: all 16 bit sequences with exactly 4 ones
![Page 29: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/29.jpg)
Bijection between A and B– A: all ways to select a dozen doughuts when
five varieties are available.– B: all 16 bit sequences with exactly 4 ones
![Page 30: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/30.jpg)
Bijection between A and B– A: all ways to select a dozen doughuts when
five varieties are available.– B: all 16 bit sequences with exactly 4 ones
![Page 31: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/31.jpg)
Mapping from doughnuts to bit strings
![Page 32: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/32.jpg)
Other problems
# of 7 digit numbers (decimal) with at least one repeating digit? (allowed to have leading zeros).
# of 3 character password with at least one digit each character either digit 0-9 or letter a-z.
10 36 36 + 36 10 36 + 36 36 10
![Page 33: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/33.jpg)
8 by 8 chessboard
• How many ways to place a pawn, bishop and knight so that none are in same row or column?
![Page 34: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/34.jpg)
Rooks on Chessboard
• Number of ways to place 2 identical rooks on a chessboard so that they don’t share a row or column.
![Page 35: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/35.jpg)
Buying 2 dozen bagels
• Choosing from 3 varieties:– Plain– Garlic– Pumpernickel
• How many ways to grab 2 dozen if you want at least 3 of each type and bagels of the same type are indistinguishable.
![Page 36: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/36.jpg)
• Must get 3 of each type, so have 15 left over to choose.
• Bijection with bit strings of length 17 with 2 1s.
![Page 37: Counting...First rule of counting: Generalized Product Rule •If S is a set of sequences of length k for which there are –n 1 choices for the first element of sequence –n 2 choices](https://reader036.vdocument.in/reader036/viewer/2022063002/5f2b7fb3e0f20d1e731f3f89/html5/thumbnails/37.jpg)
Lessons• Solve the same problem in different ways!• If needed, break sets up into disjoint subsets that
you know for sure how to count.• Have in mind a sequence of choices that produces
the objects you are trying to count. (Usually there are many possibilities.)
• Once you specify the sequence of choices you are making to construct the objects, make sure that given the result, you can tell exactly what choice was made at each step!