12/13/2015MATH 106, Section 41 Section 4 Permutations Questions about homework? Submit homework!

Slides:



Advertisements
Similar presentations
Math 221 Integrated Learning System Week 2, Lecture 1
Advertisements

5.4 Counting Methods Objectives: By the end of this section, I will be able to… 1) Apply the Multiplication Rule for Counting to solve certain counting.
How many possible outcomes can you make with the accessories?
Counting (Combinatorics) 1.
PERMUTATIONS AND COMBINATIONS M408 – Probability Unit.
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,
Chapter 2 Section 2.4 Permutations and Combinations.
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
Chapter 5 Section 5 Permutations and Combinations.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
College Algebra Fifth Edition
3.4 Counting Principles Statistics Mrs. Spitz Fall 2008.
Counting Unit Review Sheet. 1. There are five choices of ice cream AND three choices of cookies. a)How many different desserts are there if you have one.
Do Now: Make a tree diagram that shows the number of different objects that can be created. T-shirts: Sizes: S, M, L and T-shirts: Sizes: S, M, L and Type:
Aim: What are the permutation and combination? Do Now: 2. If four students are scheduled to give a report in class, in how many ways can the students.
Introduction to Counting Discrete Structures. A Multiplication Principle.
The Fundamental Counting Principle and Permutations
Permutations and Combinations
Algebra II 10.2: Use Combinations Quiz : Friday, 12/13.
Counting Techniques 0.4.
Permutations and Combinations
Do Now: Review 10.4 Multiple Choice 1.) What does mean? a.) b.) c.) Short Answer 2.) Find the number of arrangements of 3 #’s for a locker with a total.
1 Combinations. 2 Permutations-Recall from yesterday The number of possible arrangements (order matters) of a specific size from a group of objects is.
Chapter  Determine how many different possibilities are possible:  1. There are 3 different ice cream flavors and 5 different toppings. You.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
Math 106 – Exam #1 - Review Problems 1. (a) (b) (c) (d) (e) Evaluate each of the expressions displayed, and write each answer as a single numerical value.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Permutations and Combinations Advanced Math Topics.
Permutations and Combinations
Discrete Mathematics Lecture # 25 Permutation & Combination.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Warm Up May 7 1. A card is drawn from a well-shuffled deck of 52 cards. Find the probability that the card is: a) A 7 b) Red c) A red 8 d) A spade e) A.
Honors PreCalculus: Section 9.1 Basic Combinatorics.
Lesson 0.4 (Counting Techniques)
MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutations and Combinations
Combinations 0.4. Combinations: a selection of r objects from a group on n objects where the order is not important.
6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Sample Spaces and Probability Addition Rules Multiplication Rules and Conditional Probability Counting Rules Probability and Counting Rules
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Counting Techniques. Fundamental Counting Principal Two Events: If one event can occur in m ways and another event can occur in n ways, then the number.
Permutations and Combinations
MATH 2311 Section 2.1.
Permutations and Combinations
Algebra 2/Trig Name: ________________________
Section 16 Inclusion/Exclusion
Section 8.1 When Does Order Matter?
1. In how many ways can six people sit in a six-passenger car?
Math 106 – Exam #1 - Review Problems
Chapter 10: Counting Methods
Permutations and Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutation & COmbination
Permutations and Combinations
Probability Section 19 NOTE: We are skipping Section 18. 2/21/2019
MATH 2311 Section 2.1.
Counting Principle.
Permutations and Combinations
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Day 2 - Combinations.
Permutations and Combinations
Permutations and Combinations
pencil, highlighter, GP notebook, textbook, calculator
Permutations and Combinations
Presentation transcript:

12/13/2015MATH 106, Section 41 Section 4 Permutations Questions about homework? Submit homework!

12/13/2015MATH 106, Section 42 What are permutations? Many of the problems we will be interested in are concerned with arranging objects in some order. Such ordered arrangements are called permutations. Nine people form a baseball team. How many ways can they “take the field”? (Note: There are nine positions on the field to occupy.) RECIPE: Choose the team member to take first base and then choose the team member to take second base and then choose the team member to take third base and then choose … and then choose the team member to take short stop and then choose the team member to be catcher. 9  8  7  6  5  4  3  2  1 = 362,880 Shortcut notation: 9! (“9 factorial”) #1

12/13/2015MATH 106, Section 43 n factorial In general, n! (“n factorial”) is the product n  (n – 1)  (n – 2)  …  3  2  1 By definition 0! = 1 NOTE: n! = n  (n – 1)! NOTE: n! = n  (n – 1)! So we have … 0! = 1 1! = 1 = 1 2! = 2  1 = 2 3! = 3  2  1 = 6 4! = 4  3  2  1 = 24 … See page 31 of the textbook

12/13/2015MATH 106, Section 44 Let’s work with factorial a little bit … Simplify the following: 5! — 4! 5 6! — 4! 30 8! —— 5! 3! 56 Twelve people form a baseball team. How many ways can they “take the field”? (Note: There are nine positions on the field to occupy.) 12  11  10  9  8  7  6  5  4 = 79,833,600 12! = ——— (12 – 9)! (Same recipe as in #1) #2

12/13/2015MATH 106, Section 45 Seventeen people form a baseball team. How many ways can they “take the field”? (Note: There are nine positions on the field to occupy.) 17  16  15  14  13  12  11  10  9 = 8,821,612,800 17! = ——— (17 – 9)! In general, when we are given n things, but only taking k of them where the order we take them matters, we have what is called the permutation of n things taken k at a time. The number of such permutations and is denoted as P(n, k), and (Same recipe as before!) #3

12/13/2015MATH 106, Section 46 Nine people form a baseball team. How many ways can they “take the field”? (Note: There are nine positions on the field to occupy.) Let’s rework those examples … P(9, 9) Twelve people form a baseball team. How many ways can they “take the field”? (Note: There are nine positions on the field to occupy.) P(12, 9) Seventeen people form a baseball team. How many ways can they “take the field”? (Note: There are nine positions on the field to occupy.) P(17, 9) #1 #2 #3

12/13/2015MATH 106, Section 47 How many ways are there to arrange the letters in “victory”? How many 4-letter arrangements can you form? P(7, 7) = 7! = 5040 How many ways can you choose the class officers of president, vice-president, secretary, and treasurer from a class of 35? P(35, 4) = P(7, 4) = 7! ——— = 840 (7 – 4)! 35! ———– = 1,256,640 (35 – 4)! When we recognize a permutation, we may find it unnecessary to write a recipe. #4 #5 Complete the handout problems we do not finish here in class as part of the homework for next class…

12/13/2015MATH 106, Section 48 Suppose 24 students are to be seated in 24 chairs, and 8 of the students are seniors, 7 are juniors, 5 are sophomores, and 4 are freshmen. How many seating arrangements can you make? How many seating arrangements can you make, if we want all of the seniors first, then all of the juniors, then sophomores, and then freshmen? How many seating arrangements can you make, if we want to keep all students in the same class together, but we don’t care about the order of the classes? P(24, 24) = 24! P(8, 8)  P(7, 7)  P(5, 5)  P(4, 4) = 8!  7!  5!  4! = 585,252,864,000 RECIPE: Seat the seniors and then seat the juniors and then seat the sophomores and then seat the freshmen. #6

12/13/2015MATH 106, Section 49 Suppose 24 students are to be seated in 24 chairs, and 8 of the students are seniors, 7 are juniors, 5 are sophomores, and 4 are freshmen. How many seating arrangements can you make? How many seating arrangements can you make, if we want all of the seniors first, then all of the juniors, then sophomores, and then freshmen? How many seating arrangements can you make, if we want to keep all students in the same class together, but we don’t care about the order of the classes? P(24, 24) = 24! P(8, 8)  P(7, 7)  P(5, 5)  P(4, 4) = 8!  7!  5!  4! = 585,252,864,000 4!  P(8, 8)  P(7, 7)  P(5, 5)  P(4, 4) = 4!  8!  7!  5!  4! = 14,046,068,740,000 RECIPE: Seat the seniors and then seat the juniors and then seat the sophomores and then seat the freshmen. RECIPE: Decide the class seating order and then seat the seniors and then seat the juniors and then seat the sophomores and then seat the freshmen.

12/13/2015MATH 106, Section 410 Consider a standard deck of 52 cards. How many ways can you select 5 cards from the deck and place them in order on a table? How many ordered arrangements can you form selecting 5 cards from the deck, if you allow repeated selections of the same card by placing each selected card back into the deck before the next selection? P(52, 5) = 52! ———– = 311,875,200 (52 – 5)! #7 NOTE: A standard deck of 52 cards consists of 13 cards in each of 4 suits named clubs, diamonds, hearts, and spades. The 13 cards in each suit consists of denominations ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, jack, queen, king.

12/13/2015MATH 106, Section 411 Consider a standard deck of 52 cards. How many ways can you select 5 cards from the deck and place them in order on a table? How many ordered arrangements can you form selecting 5 cards from the deck, if you allow repeated selections of the same card by placing each selected card back into the deck before the next selection? P(52, 5) = 52  52  52  52  52 = 52! ———– = 311,875,200 (52 – 5)! 52 5 = 380,204,032 #7

12/13/2015MATH 106, Section 412 How many 8-symbol computer passwords are there if you can have letters or digits with no repetitions? letters or digits with no repetitions but it must start with a letter? letters or digits with repetitions allowed? letters or digits with repetitions allowed but it must start with a letter? P(36, 8) = 36  36  …  36  36 = 36! ———– (36 – 8)!  P(35, 7) = 35! 26  ———– (35 – 7)! 26  36  …  36  36 = 26  36 7 #8 Just set up these calculations without actually calculating.

12/13/2015MATH 106, Section 413 How many computer passwords are there which can have at most 4 symbols if you can have letters or digits but no repetitions? P(36, 1) + P(36, 2) + P(36, 3) + P(36, 4) = , ,413,720 = 1,457,856 You have 6 men and 6 women to seat in a row of 12 seats. How many seating arrangements are possible if you alternate men and women? 2  P(6,6)  P(6,6) =1,036,800 RECIPE: Choose a computer word with one symbol or choose a computer word with two symbols or choose a computer word with three symbols or choose a computer word with four symbols. RECIPE: Choose which sex will sit in the first seat and then assign seats for men and then assign seats for women. #9

12/13/2015MATH 106, Section 414 Signals are made by running three colored flags up a mast. There is an unlimited supply of flags in seven different colors. How many signals are possible with no repetitions of color allowed? How many signals are possible with repetitions of color allowed? How many signals are possible if no two adjacent flags are allowed to be the same color? P(7, 3) = 7  7! ———– = 210 (7 – 3)! 7  7  7 = 7 3 =  6 = 252 #10

12/13/2015MATH 106, Section 415 Homework Hints: In Section 4 Homework Problem #2, In Section 4 Homework Problem #14, In Section 4 Homework Problem #15, you can write the answer in scientific notation if you would prefer not to write out the 19 digits required for the answer. note that you are working with a total of different books. note that you must decide on the order of the subjects first, after which you must decide the order within each subject.