PPT-Permutations, Combinations, and Counting Theory

AII12 The student will compute and distinguish between permutations and combinations and use technology for applications Fundamental Counting Principle The Meal Deal at Bananabees allows you to pick one appetizer one entrée and one dessert for 1099 How many different Meal Deals could you create if you have three appetizers six entrées and four desserts to choose from. Mr. Mark Anthony Garcia, M.S.. Mathematics Department. De La Salle University . Experiment: Definition. An . experiment . is a process that generates a set of data. .. Example 1: . Experiment. Tossing of a coin. Definition of Combination. An . arrangement. . of objects in which the . order. . of selection . does NOT matter. .. . Ex: You have to visit three out of your four friends houses: Andrew (A), Betty (B), Carlos (C), Dave (D). What are the different ways to select the 3 houses to visit?. Section 6.3. Section Summary. Permutations. Combinations. Combinatorial Proofs. Permutations. Definition. : A . permutation. of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement of r elements of a set is called an . Urn models. We are given set of n objects in an urn (don’t ask why it’s called an “. urn. ” - probably due to some statistician years ago) .. We are going to pick (select) r objects from the urn in. Objective. : . To find the counts of various combinations and permutations, as well as their corresponding probabilities. CHS Statistics. Warm-Up. Alfred . is trying to find an outfit to wear to take Beatrice on their first date to Burger King. How many different ways can he make an outfit out of this following clothes:. Section . 6.5. Permutations with Repetition. Theorem . 1. : The number of . r. -permutations of a set of . n. objects with repetition allowed is . n. r. .. . Example. : How many strings of length . Section 6.. 2. The Pigeonhole Principle. If a flock of . 20. pigeons roosts in a set of . 19 . pigeonholes, one of the pigeonholes must have more than . 1. pigeon.. Pigeonhole Principle. : If . Permutations with Repetition. Theorem 1: . The number of . r-permutations. of a set of . n. objects with repetition allowed is . n. r. . .. Example 1:. How many strings of length . r. can be formed from the English alphabet?. Evaluate the following. (7-3)! . 6! . MATH 110 Sec 12.3 Permutations and Combinations Practice Exercises . Evaluate the following. . = . . . = . . .  .  . . MATH 110 Sec 12.3 Permutations and Combinations Practice Exercises . Special Topics. Calculating Outcomes for Equally Likely Events. If a random phenomenon has equally likely outcomes, then the probability of event . A. . is:. How to Calculate “Odds”. Odds are different from probability, and don’t follow the rules for probability. They are often used, so they are included here.. Discrete Structures, Fall 2011. Permutation . vs. Combination. Permutations. Combinations. Ordering of elements from a set. Sequence does matter. 1 2 3 is not the same as 3 2 1. Collection of element from a set. Algebra 2. Chapter 10. This Slideshow was developed to accompany the textbook. Larson Algebra 2. By Larson. , R., Boswell, L., . Kanold. , T. D., & Stiff, L. . 2011 . Holt . McDougal. Some examples and diagrams are taken from the textbook.. Five different stuffed animals are to be placed on a circular display rack in a department store. In how many ways can this be done? .  . 0.07. 72. . 24. . Warm-Up . #. 6 Tuesday, 2/16. Find the number of uni. Permutations. Objectives. Use the Fundamental Counting Principle to count permutations.. Evaluate factorial expressions.. Use the permutation formula.. Find the number of permutations of duplicate items..