1 / 19

10.1 – Counting by Systematic Listing

10.1 – Counting by Systematic Listing. One-Part Tasks. The results for simple, one-part tasks can often be listed easily. Tossing a fair coin:. Heads or tails. Rolling a single fair die. 1, 2, 3, 4, 5, 6. Consider a club N with four members:.

zaynah
Download Presentation

10.1 – Counting by Systematic Listing

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. 10.1 – Counting by Systematic Listing One-Part Tasks The results for simple, one-part tasks can often be listed easily. Tossing a fair coin: Heads or tails Rolling a single fair die 1, 2, 3, 4, 5, 6 Consider a club N with four members: N = {Mike, Adam, Ted, Helen} or N = {M, A, T, H} In how many ways can this group select a president? There are four possible results: M, A, T, and H.

  2. 10.1 – Counting by Systematic Listing Product Tables for Two-Part Tasks Determine the number of two-digit numbers that can be written using the digits from the set {2, 4, 6}. The task consists of two parts: 1. Choose a first digit 2. Choose a second digit The results for a two-part task can be pictured in a product table. 2 4 6 2 26 24 22 4 9 possible numbers 42 44 46 6 62 64 66

  3. 10.1 – Counting by Systematic Listing Product Tables for Two-Part Tasks What are the possible outcomes of rolling two fair die?

  4. 10.1 – Counting by Systematic Listing Product Tables for Two-Part Tasks Find the number of ways club N can elect a president and secretary. N = {Mike, Adam, Ted, Helen} or N = {M, A, T, H} The task consists of two parts: 1. Choose a president 2. Choose a secretary MA MM MT MH 12 outcomes AA AT AM AH TH TM TA TT HM HA HT HH

  5. 10.1 – Counting by Systematic Listing Product Tables for Two-Part Tasks Find the number of ways club N can elect a two member committee. N = {Mike, Adam, Ted, Helen} or N = {M, A, T, H} 6 committees MA MM MT MH AA AT AH AM TM TA TH TT HM HA HT HH

  6. 10.1 – Counting by Systematic Listing Tree Diagrams for Multiple-Part Tasks A task that has more than two parts is not easy to analyze with a product table. Another helpful device is a tree diagram. Find the number of three digit numbers that can be written using the digits from the set {2, 4, 6} assuming repeated digits are not allowed. A product table will not work for more than two digits. Generating a list could be time consuming and disorganized.

  7. 10.1 – Counting by Systematic Listing Tree Diagrams for Multiple-Part Tasks Find the number of three digit numbers that can be written using the digits from the set {2, 4, 6} assuming repeated digits are not allowed. 1st # 2nd # 3rd # 246 4 6 2 6 4 264 2 6 426 6 possibilities 4 6 2 462 2 4 624 6 4 2 642

  8. 10.1 – Counting by Systematic Listing Other Systematic Listing Methods There are additional systematic ways to produce complete listings of possible results besides product tables and tree diagrams. How many triangles (of any size) are in the figure below? D One systematic approach is begin with A, and proceed in alphabetical order to write all 3-letter combinations (like ABC, ABD, …), then cross out ones that are not triangles and those that repeat. E C F B A Another approach is to “chunk” the figure to smaller, more manageable figures. There are 12 triangles.

  9. 10.2 – Using the Fundamental Counting Principle Uniformity Criterion for Multiple-Part Tasks: A multiple part task is said to satisfy the uniformity criterion if the number of choices for any particular part is the same no matter which choices were selected for previous parts. Uniformity exists: Find the number of three letter combinations that can be written using the letters from the set {a, b, c} assuming repeated letters are not allowed. 2 dimes and one six-sided die numbered from 1 to 6 are tossed. Generate a list of the possible outcomes by drawing a tree diagram. Uniformity does not exists: A computer printer allows for optional settings with a panel of five on-off switches. Set up a tree diagram that will show how many setting are possible so that no two adjacent switches can be on?

  10. 10.2 – Using the Fundamental Counting Principle Uniformity Find the number of three letter combinations that can be written using the letters from the set {a, b, c} assuming repeated letters are not allowed. 1st letter 2nd letter 3rd letter abc b c a c b acb a c bac 6 possibilities b c a bca a b cab c b a cba

  11. 10.2 – Using the Fundamental Counting Principle Uniformity 2 dimes and one six-sided die numbered from 1 to 6 are tossed. Generate a list of the possible outcomes by drawing a tree diagram. Die # Dime 1 d1 d1 d1 d1 d1 d1 d1 1 1 d2 d2 d2 d2 d2 d2 d2 2 d1 2 2 d2 3 d1 3 3 d2 12 possibilities 4 d1 4 4 d2 5 d1 5 5d2 6 d1 6 6 d2

  12. 10.2 – Using the Fundamental Counting Principle Uniformity does not exist A computer printer is designed for optional settings with a panel of three on-off switches. Set up a tree diagram that will show how many setting are possible so that no two adjacent switches can be on? (o = on, f = off) 1st switch 2nd switch 3rd switch o o f o o f f o o f f o f f

  13. 10.2 – Using the Fundamental Counting Principle Fundamental Counting Principle The principle which states that all possible outcomes in a sample space can be found by multiplying the number of ways each event can occur. Example: At a firehouse fundraiser dinner, one can choose from 2 proteins (beef and fish), 4 vegetables (beans, broccoli, carrots, and corn), and 2 breads (rolls and biscuits). How many different protein-vegetable-bread selections can she make for dinner? Proteins Vegetables Breads 2  4  2 = 16 possible selections

  14. 10.2 – Using the Fundamental Counting Principle Example At the local sub shop, customers have a choice of the following: 3 breads (white, wheat, rye), 4 meats (turkey, ham, chicken, bologna), 6 condiments (none, brown mustard, spicy mustard, honey mustard, ketchup, mayo), and 3 cheeses (none, Swiss, American). How many different sandwiches are possible? Breads Meats Condiments Cheeses  6  3 3  4 = 216 possible sandwiches

  15. 10.2 – Using the Fundamental Counting Principle Example: Consider the set of digits: {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}. (a) How many two digit numbers can be formed if repetitions are allowed? 1st digit 2nd digit 10 90 9  = (b) How many two digit numbers can be formed if no repetitions are allowed? 1st digit 2nd digit 9 81 9  = (c) How many three digit numbers can be formed if no repetitions are allowed? 1st digit 2nd digit 3rd digit 9  9  8 = 648

  16. 10.2 – Using the Fundamental Counting Principle Example: (a) How many five-digit codes are possible if the first two digits are letters and the last three digits are numerical? 1st digit 2nd digit 3rd digit 4th digit 5th digit  26 10 10 26    10 676000 possible five-digit codes (a) How many five-digit codes are possible if the first two digits are letters and the last three digits are numerical and repeats are not permitted? 1st digit 2nd digit 3rd digit 4th digit 5th digit  25 10 9 26    8 468000 possible five-digit codes

  17. 10.2 – Using the Fundamental Counting Principle Factorials For any counting number n, the product of all counting numbers from n down through 1 is called n factorial, and is denoted n!. For any counting number n, the quantity n factorial is calculated by: n! = n(n – 1)(n – 2)…(2)(1). Definition of Zero Factorial: 0! = 1 Examples: b) (4 – 1)! a) 4! c) 3! 4321 321 20 = 24 = 54 6

  18. 10.2 – Using the Fundamental Counting Principle Arrangements of Objects Factorials are used when finding the total number of ways to arrange a given number of distinct objects. The total number of different ways to arrange n distinct objects is n!. Example: How many ways can you line up 6 different books on a shelf?   1 5 4 3 6    2 720 possible arrangements

  19. 10.2 – Using the Fundamental Counting Principle Arrangements of n Objects Containing Look-Alikes The number of distinguishable arrangements of n objects, where one or more subsets consist of look-alikes (say n1 are of one kind, n2 are of another kind, …, and nk are of yet another kind), is given by Example: Determine the number of distinguishable arrangements of the letters of the word INITIALLY. 9 letters with 3 I’s and 2 L’s 9! 30240 possible arrangements  3! 2!

More Related