ENM 207 Lecture 5. FACTORIAL NOTATION The product of positive integers from 1 to n is denoted by the special symbol n! and read “n factorial”. n!=1.2.3….(n-2).(n-1).n.

Slides:



Advertisements
Similar presentations
4-1 Chapter 4 Counting Techniques.
Advertisements

1 Counting Techniques: Possibility Trees, Multiplication Rule, Permutations.
Mathematics Probability: Combinations Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund
Consider the possible arrangements of the letters a, b, and c. List the outcomes in the sample space. If the order is important, then each arrangement.
Statistics Review. Box-and-Whisker Plots The Parts of a Box and Whisker Plot Name the parts of a Box-and-Whisker Plot MedianUpper Quartile Lower.
How many possible outcomes can you make with the accessories?
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
Combinations We should use permutation where order matters
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Chapter 5 Section 5 Permutations and Combinations.
Copyright © Ed2Net Learning Inc.1. 2 Warm Up 1.List all combinations of Roshanda, Shelli, Toshi, and Hector, taken three at a time 2. In how many ways.
Lecture 07 Prof. Dr. M. Junaid Mughal
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Section 4.3: Permutations and Combinations Def: A permutation of a set of distinct objects is an ordered arrangement of these objects. Ex: {a, b, c, d}
COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Jessie Zhao Course page: 1.
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Number of Elements in a Finite Set. Notation : The number of the elements of the set A will be denoted by n(A) Examples (1): Let: Let: A = {a,b,c,d} B.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Mathematics. Permutation & Combination - 2 Session.
NO ONE CAN PREDICT TO WHAT HEIGHTS YOU CAN SOAR
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Permutations and Combinations
Unit 7 Permutation and Combination IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 7 Permutation and Combination.
Part 2 – Factorial and other Counting Rules
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
3. Suppose you take 4 different routes to Trenton, the 3 different routes to Philadelphia. How many different routes can you take for the trip to Philadelphia.
Counting CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.
The Pigeonhole Principle. The pigeonhole principle Suppose a flock of pigeons fly into a set of pigeonholes to roost If there are more pigeons than pigeonholes,
Counting Principles. Counting examples Ex 1: A small sandwich café has 4 different types of bread, 5 different types of meat and 3 different types of.
PERMUTATIONS AND COMBINATIONS BOTH PERMUTATIONS AND COMBINATIONS USE A COUNTING METHOD CALLED FACTORIAL.
Discrete Mathematics Lecture # 25 Permutation & Combination.
PERMUTATIONS and COMBINATIONS
Aim: What is the counting rule? Exam Tomorrow. Three Rules Sometimes we need to know all possible outcomes for a sequence of events – We use three rules.
Counting Principles Multiplication rule Permutations Combinations.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
What is a permutation? A permutation is when you take a group of objects or symbols and rearrange them into different orders Examples: Four friends get.
Lesson 0.4 (Counting Techniques)
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Mathematics Probability: Permutations Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund
Chapter 7 – Counting Techniques CSNB 143 Discrete Mathematical Structures.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Section 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.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Section 6.3. Section Summary Permutations Combinations.
The Multiplication Rule
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
CSNB 143 Discrete Mathematical Structures
combinaTorial Analysis
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
Chapter 7 Logic, Sets, and Counting
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
Bellwork Practice Packet 10.3 B side #3.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
Lecture 7: Permutations and Combinations
Presentation transcript:

ENM 207 Lecture 5

FACTORIAL NOTATION The product of positive integers from 1 to n is denoted by the special symbol n! and read “n factorial”. n!=1.2.3….(n-2).(n-1).n ex: 5!= =120

Some special factorial values We make the following mathamatical manipulation: Product and divide the left side of above equation by (n-r)! and obtain n!/(n-r)!

PERMUTATIONS Any ordered sequence of k objects taken from a set of n distinct obfects is called a permutation of size k of the objects. The number of permutations of size k is obtained from the general product rule as follows: The first element can be chosen in n ways, the second element can be chosen in n-1 ways, and so on ;

PERMUTATIONS Finally for each way of choosing the first k-1 elements, the k th element can be chosen in n-(k-1) = n-k+1 ways, thus The number of permutations of size k in n distinct object is denoted by

COMBINATIONS Given a set of n distinct objects any unordered subset of size k of the objects is called a combination. The number of combinations of size k that can be formed from n distinct objects will be denoted by

COMBINATIONS The number of combinations of size k from a particular set is smaller than the number of permutations because, when order is disregarded, a number of permutations correspond to the same combination.

COMBINATIONS Ex: consider the set {A,B,C,D,E} consisting of 5 elements. We know that there are 5!/(5-3)!=60 permutations of size 3 and 5!/ 3!(5-3)!= 10 combinations of size 3 Ex: find the number of permutations of size 3 consisting of the elements of A,B,C. 3! = 3 x 2 x 1 = 6 (A,B,C) (A,C,B) (B,A,C) (B,C,A) (C,A,B) and (C,B,A)

Ex: repititions are not permited How many 3 digit numbers can be formed from the six digits 2, 3, 5, 6,7 and 9? i) 654=120 numbers i) How many of these are less than 400? 254=40 numbers The box on the left can be filled in only two ways, by 2 or 3, since each number must be less than 400; The middle box can be filled in 5 ways. The box on the right can be filled in 4 ways.

repititions are not permited i) How many are even? Firs start filling from right side to provide condition. The box on the right can be filled in only 2 ways by 2 or 6, since the numbers must be even. The box on the left can be filled 5 ways. The box on the middle can be filled 4 ways 5 42

a) Theorem: Let A contain n elements and let n 1, n 2,,,,,, n r be positive integers with n 1 + n 2 + n 3 +,,,,,+ n r = n Lets A 1, A 2,...., A r are different partitions of A n 1 presents the number of elements in A 1 n 2 represents the number of elements in A 2 and so fort nr represents the number of elements in A r, then there exist different ordered partitions of A.

Ex: How many distinct permutations can be formed from all the letters of each word: them ii) unusual iii) sociological i) 4! = 24, since there are 4 letters and no repitations. ii) since there are 7 letters of which 3 are u iii) since there are 12 letters of which 3 are ‘o’, 2 are ‘c’, 2 are ‘i’, 2 are ‘l’

b) Theorem b) the number of permutation of set A which has n elements for a circle is equal (n-1)! N people can be sit around a table in (n-1)! different form.

Some special combinations