 Counting CSCA67 Fall, 2012 Nov. 12, 2012 TA: Yadi Zhao www.utsc.utoronto.ca/~09zhaoya.

Slides:



Advertisements
Similar presentations
Counting Principles Probability.
Advertisements

1/8 AND, OR and NOT b How many boys? b How many girls? b How many blue? b How many red?
Permutations and Combinations
Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
© 2010 Pearson Education, Inc. All rights reserved Chapter 9 9 Probability.
Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
12.1 Permutations When a question says ‘how many arrangment’..... Think BOXES For each space we have a box In the box write down how many options can go.
Counting and Probability The outcome of a random process is sure to occur, but impossible to predict. Examples: fair coin tossing, rolling a pair of dice,
Combinations We should use permutation where order matters
Recursive Definitions Rosen, 3.4 Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
Permutations and Combinations
COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.
Permutation and Combination
Counting and Probability Sets and Counting Permutations & Combinations Probability.
Combinatorics 3/15 and 3/ Counting A restaurant offers the following menu: Main CourseVegetablesBeverage BeefPotatoesMilk HamGreen BeansCoffee.
Dr. Fowler AFM Unit 7-7 Permutations and Combinations.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Aim: Combinations Course: Math Lit. Do Now: Aim: How do we determine the number of outcomes when order is not an issue? Ann, Barbara, Carol, and Dave.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 1.
Chapter 3 Permutations and combinations
Counting Techniques. Multiplication Rule of Counting If a task consists of a sequence of choices in which there are p selections for the first choice,
Permutation and Combination
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Part 2 – Factorial and other Counting Rules
Quiz 10-1, Which of these are an example of a “descrete” set of data? 2.Make a “tree diagram” showing all the ways the letters ‘x’, ‘y’, and ‘z’
Chapter 12 PROBABILITY Counting, Combinations, Permutations, Probability, Binomial Theorem.
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
CSNB143 – Discrete Structure
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
Thinking Mathematically
Discrete Mathematics Lecture # 25 Permutation & Combination.
Counting Principles Multiplication rule Permutations Combinations.
11.1C Finding the Number of Permutations….. with Repeats
7.3 Combinations Math A combination is a selection of a group of objects taken from a larger pool for which the kinds of objects selected is of.
More on Permutations. Permutation with Repetition Circular Permutations Bracelet Permutations Topics in this Section.
Algebra-2 Counting and Probability. Quiz 10-1, Which of these are an example of a “descrete” set of data? 2.Make a “tree diagram” showing all.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
5.5 Generalized Permutations and Combinations
Mr. Mark Anthony Garcia, M.S. Mathematics Department De La Salle University.
Copyright © Peter Cappello 2011 Simple Arrangements & Selections.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
CHAPTER 4 4-4:Counting Rules Instructor: Alaa saud Note: This PowerPoint is only a summary and your main source should be the book.
Permutations and Combinations. Fundamental Counting Principle If there are r ways of performing one operation, s ways of performing a second operation,
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
The Multiplication Rule
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
Permutations and Combinations
12.2 Permutations and Combinations
Chapter 5 Probability 5.5 Counting Techniques.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
Permutations and Combinations
Permutations.
Combinations.
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Permutations and Combinations
12.1 Permutations When a question says ‘how many arrangment’..... Think BOXES For each space we have a box In the box write down how many options can go.
Presentation transcript:

 Counting CSCA67 Fall, 2012 Nov. 12, 2012 TA: Yadi Zhao

Permutation An arrangement (or ordering) of a set of objects is called a permutation. (We can also arrange just part of the set of objects.) In a permutation, the order that we arrange the objects is important

Example 1 Consider arranging 3 letters: A, B, C. How many ways can this be done?

Theorem 1 n distinct objects can be arranged in n! ways

Example 2 In how many ways can 4 different students be arranged in a row?

Theorem 2 The number of permutations of n distinct objects taken r at a time, where repetitions are not allowed, is given by n!/(n-r)!

Example 3 In how many ways can a supermarket manager display 5 brands of cereals in 3 spaces on a shelf?

Example 4 How many different number-plates for cars can be made if each number-plate contains four of the digits 0 to 9 followed by a letter A to Z, assuming that (a) no repetition of digits is allowed? (b) repetition of digits is allowed?

Theorem 3 The number of different permutations of n objects of which n 1 are of one kind, n 2 are of a second kind,... n k are of a k-th kind is n! / (n 1 ! * n 2 ! *…n k !)

Example 5 In how many ways can the six letters of the word "mammal" be arranged in a row?

Theorem 4 There are (n − 1)! ways to arrange n distinct objects in a circle.

Example 6 In how many ways can 5 people be arranged in a circle?

Exercise 1 How many numbers greater than 1000 can be formed with the digits 3,4,6,8,9 if a digit cannot occur more than once in a number?

Exercise 2 How many different ways can 3 red, 4 yellow and 2 blue bulbs be arranged in a string of Christmas tree lights with 9 sockets?

Combination A combination of n objects taken r at a time is a selection which does not take into account the arrangement of the objects. That is, the order is not important.

Number of Combinations The number of ways (or combinations) in which r objects can be selected from a set of n objects, where repetition is not allowed, is denoted by: n! / (r!*(n-r)! )

Example 1 How many different sets of 4 different letters can be selected from the alphabet?

Example 2 Find the number of ways in which 3 components can be selected from a batch of 20 different components.

Example 3 In how many ways can a group of 4 boys be selected from 10 if (a) the eldest boy is included in each group? (b) the eldest boy is excluded? (c) What proportion of all possible groups contain the eldest boy?

Example 4 A class consists of 15 students of whom 5 are girls. How many committees of 8 can be formed if each consists of (a) exactly 2 girls? (b) at least 2 girls?

Example 5 Out of 5 mathematicians and 7 engineers, a committee consisting of 2 mathematicians and 3 engineers is to be formed. In how many ways can this be done if (a) any mathematician and any engineer can be included?

Example 5 Out of 5 mathematicians and 7 engineers, a committee consisting of 2 mathematicians and 3 engineers is to be formed. In how many ways can this be done if (b) one particular engineer must be in the committee?

Example 5 Out of 5 mathematicians and 7 engineers, a committee consisting of 2 mathematicians and 3 engineers is to be formed. In how many ways can this be done if (c) two particular mathematicians cannot be in the committee?