1 / 35

Developing Your Counting Muscles

Great Theoretical Ideas In Computer Science. Developing Your Counting Muscles. Lecture 8. CS 15-251. Addition Rule. Let A and B be two disjoint, finite sets. The size of A B is the sum of the size of A and the size of B. Correspondence Principle.

jakeem-barlow
Download Presentation

Developing Your Counting Muscles

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Great Theoretical Ideas In Computer Science Developing Your Counting Muscles Lecture 8 CS 15-251

  2. Addition Rule • Let A and B be two disjoint, finite sets. • The size of AB is the sum of the size of A and the size of B.

  3. Correspondence Principle • If two finite sets can be placed into 1-1 onto correspondence, then they have the same size.

  4. Product Rule • Suppose that all objects of a certain type can be constructed by a sequence of choices with P1 possibilities for the first choice, P2 for the second, and so on. • IF • 1) Each sequence of choices constructs some object • AND • 2) Each object has exactly one sequence that constructs it • THEN • there are P1P2P3…Pn objects of that type.

  5. The Sleuth’s Criterion • Condition (2) of the product rule: • For any object it should be possible to reconstruct the sequence of choices that lead to it.

  6. The number of subsets of size r that can be formed from an n-element set is:

  7. How many sequences of seven letters contain at least 2 of the same letter? • 267 – 26*25*24*23*22*21*20

  8. Counting Poker Hands…

  9. 52 Card Deck5 card hands • 4 possible suits: •  • 13 possible ranks: • 2,3,4,5,6,7,8,9,10,J,Q,K,A

  10. Question: • How many ways to rearrange the letters in the word “SYSTEMS”?

  11. SYSTEMS • 7 places to put the Y, 6 places to put the T, 5 places to put the E, 4 places to put the M, and the S’s are forced. 7 X 6 X 5 X 4 = 840 • 2)

  12. SYSTEMS • 3) Let’s pretend that the S’s are distinct: • S1YS2TEMS3 • There are 7! permutations of S1YS2TEMS3 • But when we stop pretending we see that we have counted each arrangement of SYSTEMS 3! times, once for each of 3! rearrangements of S1S2S3.

  13. Arrange n symbolsr1 of type 1, r2 of type 2, …, rk of type k

  14. CARNEGIEMELLON

  15. What is a closed form expression for ck?

  16. What is a closed for expression for cn? n times Before combining like terms, when we multiply things out we get 2n cross terms. There is a natural correspondence between sequences with k X’s and (n-k) 1’s and cross terms evaluating to Xk.

  17. The Binomial Formula Binomial Coefficients binomial expression

  18. The Binomial Formula 1 (1+X)0 = 1 + 1X (1+X)1 = 1 + 2X + 1X2 (1+X)2 = 1 + 3X + 3X2 + 1X3 (1+X)3 = 1 + 4X + 6X2 + 4X3 + 1X4 (1+X)4 =

  19. The Binomial Formula

  20. What is the coefficient of EMSTY in the expansion of (E + M + S + T + Y)5? 5!

  21. What is the coefficient of EMS3TY in the expansion of (E + M + S + T + Y)7? The number of ways to rearrange the letters in the word SYSTEMS.

  22. What is the coefficient of BA3N2 in the expansion of (B + A + N)6? The number of ways to rearrange the letters in the word BANANA.

  23. What is the coefficient of in the expansion of (X1+X2+X3+…+Xk)n?

  24. The Multinomial Formula

  25. Multinomial Coefficients

  26. 5 distinct pirates want to divide 20 identical, indivisible bars of gold How many different ways to divide up the loot?

  27. Sequences with 20 G’s and 4 /’s • GG/G//GGGGGGGGGGGGGGGGG/ • represents the following division among the pirates: 2, 1, 0, 17, 0 • In general, the ith pirate gets the number of G’s after / i-1 and before / i. This gives a correspondence between divisions of the gold and sequences with 20 G’s and 4 /’s.

  28. How many different ways to divide up the loot?Sequences with 20 G’s and 4 /’s

  29. How many different ways can n distinct pirates divide k identical, indivisible bars of gold?

  30. How many integer solutions to the following equations?

  31. How many integer solutions to the following equations?

  32. Counting with repetitions allowed Suppose that we roll seven dice. How many different outcomes are there? 67 What if order doesn’t matter? (E.g., Yahtzee)

  33. Counting with repetitions allowed How many ways are there of choosing k items from n items, where an item may be chosen more than once, but order doesn’t matter? E.g., the following are equivalent: 2 1 3 2 6 2 1, 1 3 2 1 2 2 6, 1 1 2 2 2 3 6 C C / C C C / C / / / C Place n-1 partitions / among k choices C

  34. Back to the pirates How many ways are there of choosing 20 pirates from a set of 5, with repetitions allowed?

More Related