离散数学7概要1.pptVIP

If I have 14 teeth on the top and 12 teeth on the bottom, how many teeth do I have in all? Addition of multiple disjoint sets: Let A1, A2, A3, …, An be disjoint, finite sets. Partition Method To count the elements of a finite set S, partition the elements into non-overlapping subsets A1, A2, A3, …, An .. |s| = Partition Method Partition Method A1 = the set of outcomes where the white die is 1. A2 = the set of outcomes where the white die is 2. A3 = the set of outcomes where the white die is 3. Partition Method Ai ? set of outcomes where black die says i and the white die says something else. f is 1-1 if and only if ?x,y?A, x 1 y T f(x) 1 f(y) f 1-1 onto means f^{-1) is uniquef is a way of pairing up elements Let S be a subset of {a1,…,an}. Define bk = 1 if ak in S and bk = 0 otherwise. Note that f(b1b2…bn) = S. A? A? A? A? K? “# of ways to pick r out of n elements” = “# of ways to choose the (n-r) elements to omit” Symmetry In The Formula n! r!(n-r)! = n n-r n r = 4 × 1176 = 4704 4 3 49 2 = 4 ways of picking 3 out of 4 aces = 1176 ways of picking 2 cards out of the remaining 49 cards How Many Hands Have at Least 3 As? = 1128 ways of picking 2 cards out of the 48 non-ace cards 4 × 1128 4512 4512 + 48 4560 How Many Hands Have at Least 3 As? How many hands have exactly 3 aces? = 4 ways of picking 3 out of 4 aces 4 3 48 2 How many hands have exactly 4 aces? = 1 way of picking 4 out of 4 aces 4 4 = 48 ways of picking 1 cards out of the 48 non-ace cards 48 1 4704 ? 4560 At least one of the two counting arguments is not correct! A? A? A? A? K? A? A? A? A? K? A? A? A? A? K? Four Different Sequences of Choices Produce the Same Hand = 4 ways of picking 3 out of 4 aces = 1176 ways of picking 2 cards out of the remaining 49 cards 4 3 49 2 Is the other argument correct? How do I avoid fallacious reasoning? REVERSIBILTY CHECK: For each object can I reverse engineer the unique sequence of choices that constructed it? A? A? A? A? K? A? A? A ? A?