ACTIVITY 6.7 Selecting and Rearranging Things

Size: px
Start display at page:

Download "ACTIVITY 6.7 Selecting and Rearranging Things"

Transcription

1 ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 757 OBJECTIVES ACTIVITY 6.7 Selecting and Rearranging Things 1. Determine the number of permutations. 2. Determine the number of combinations. 3. Recognize patterns modeled by counting techniques. In working through the previous activities, you may have noticed there are many different varieties of counting problems. Sometimes a tree or list may be feasible to display all the possibilities. But usually the overwhelming number of possibilities makes constructing a list or tree impractical. In this activity you will explore two types of counting problems, permutations and combinations, both of which use the multiplication principle of counting. Permutations are arrangements of objects, from first to last, where the order in which the objects are selected is most important. Example 1 You havefivetextbooks and wish to arrange them on your bookshelf in the usual way. In how many ways can this be done? Think of the five positions on the shelf, left to right. Consider how many ways the first space can be filled (5), then how many ways to fill the second space (4, since there are four books remaining), and so on. You could illustrate with a tree diagram if you wish, but a simple application of the multiplication principle will give you = 120. So there are 120 different arrangements or orderings of your five books. Equivalently, you say there are 120 permutations of any five objects. 1. Suppose you have seven different sweatshirts, and wish to wear a different one each day of the week. In how many ways can this be done? 2. There are 26 letters in the standard English alphabet. If you consider using all the letters to create a 26-letter word, how many different words are possible? (You will notice this is a very large number, so you will need scientific notation to give an approximate answer.)

2 758 CHAPTER 6 PROBABILITY MODELS Factorial Notation The product of any positive integer with all smaller positive integers down to one has a special name and notation. For example, Five factorial is written as 51 = = 120. Appendix 3. Use the factorial notation on your calculator (see Appendix A) to determine 12! Note: 0! is defined to be equal to one. (Check this on your calculator.) You can think of it as the number of ways to arrange zero things. Sometimes you are interested in arrangements of only some of the objects from a larger collection. Words that are 26 letters long are a bit unrealistic, but using only five different letters might make more sense. Example 2 Suppose exactlyfivedifferent letters are used to make a word (in this case a word does not have to be one found in a dictionary, but simply be a sequence of five letters). How many different words can be made? As with the bookshelf problem, imagine five spaces, to hold each of the five letters. But now, there are 26 choices for the first space, 25 for the second, and so on = 7,893,600 different words are possible. Notice that since there are only five letters, this is not a full factorial. These are still called permutations. There are 7,893,600 permutations of 26 objects, taken five at a time. Permutations of n objects taken r at a time = the first r factors of n! Notation: np r = n(n - 1)(«- 2) (n - r + 1) = (n-r)! [A]*- A*,,,**, 4. Redo Example 2 using the permutations formula above. Then, verify your answer by using the permutation feature on your calculator (see Appendix A). 5. The governor is visiting your school and you need to assign seating for 14 students. Unfortunately there are only six seats in the front row. In how many different ways can you select and arrange the six lucky students? Combinations Sometimes the order in which selections are made is not important. For example, in Problem 5, if the arrangement of the six chosen students is not important, you would simply want to count how many ways a group of six students could be chosen for the first row. For this revised situation you are counting the number of combinations of 14 objects taken six at a time.

3 ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 759 Combinations are collections of objects selected from a larger collection, where the order of selection is not important. The number of ways to select r objects from a collection of n objects is called the number of combinations of n objects taken r at a time. 6. In Problem 5, for each possible group of six students, how many seating arrangements are possible? 7. If you could list all 2,162,160 permutations in Problem 5, you could also group them according to the actual six students selected. Each group would have the number you determined in Problem 6. Divide accordingly to determine the number of ways to select the six students. P Combinations of n objects taken r at a time: nc r =!L rp- r «' (n-r)lr\ 8. Apply the combinations formula above to verify your answer to Problem From a student body of 230 students, how many different committees of four students are possible? (Hint: The order in which the four students are selected is not important.) An interesting symmetrical property of combinations appears when you consider not only the objects selected from a collection, but also those left behind. Does it make sense that the number of ways to select 3 objects from a collection of 8 objects is the same as counting the number of ways to leave 5 behind? 10. Verify the above statement by computing 8C 3 and 8C 5. Many times the most important part of the problem is determining whether or not the order of the selections is significant. In Exercise 5 of Activity 6.2, involving ordering a triple scoop ice cream cone, some people might consider the order of the scoops important. Others might not care how the three flavors are placed on the cone. 11. In each situation, determine whether you are asked to determine the number of permutations or combinations. Then do the calculation. a. How many ways are there to pick a starting five from a basketball team of twelve members?

4 760 CHAPTER 6 PROBABILITY MODELS b. How many ways are there to distribute nine different books among 15 children if no child gets more than one book? c. How many ways are there to pick a subset of four different letters from the 26-letter alphabet? d. How many ways can the three offices of chairman, vice chairman, and secretary be filled from a club with 25 members? Applications Many variations on these basic counting techniques arise in the study of probability and computer science. Here are a couple of examples, with problems for you to try. «Example 3 How many different ten-digit binary sequences (only 0s and Is) are there with exactly seven zeros and three ones? While the order of the binary digits is important, this counting problem is most easily solved by determining the number of combinations of ten digits taken seven at a time. Think of the ten positions for the digits, and ask: How many ways can you select seven positions for the zeros? low ~ ( ) (3 2 1) 3 2 = 120. Or equivalently, how many ways can you select three positions for the ones? IOW C, = (3 2 1) ( ) 3 2 = If a coin is flipped twenty times, how many different ways are there to get exactly five heads? 13. What is the probability that a coin flipped twenty times will come up heads exactly five times?

5 ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 761 Example 4 How many ways are there to arrange the letters of the word SYSTEMS? T S S Y MS E The repeated S makes this more difficult than a simple permutation problem. If you imagined the letters on tiles (like the game Scrabble), with the S tiles labeled with numbers: S, S 2 * S3, so you can tell them apart, then there would be simply 7! ways to arrange the seven tiles. But without the numbers, or tiles, the S's all look the same, so you would be way over-counting the different words. Each unique word will appear 3! times, the number of ways the three 5's can be ordered. So if you divide out this multiplicity, you will have an accurate count: 7' = = 840 truly unique words. 14. How many different words can be formed by rearranging all the letters of the word MIRROR"! SUMMARY ACTIVITY Permutations are arrangements of objects, from first to last, where the order in which the objects are selected is most important. 2. Factorial Notation: n\ ~ n(n - l)(n - 2) Permutations of n objects taken r at a time = the first r factors of n! Notation: np r = n(n - l)(n - 2) n\ (n - r + 1) = (n - r)! 4. Combinations are collections of objects selected from a larger collection, where the order of selection is not important. r n ' 5. Combinations of n objects taken r at a time = C r = "- = 7 '-r-, r\

WEEK 7 REVIEW. Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.1)

WEEK 7 REVIEW. Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.1) WEEK 7 REVIEW Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.) Definition of Probability (7.2) WEEK 8-7.3, 7.4 and Test Review THE MULTIPLICATION

More information

Fundamental Counting Principle

Fundamental Counting Principle Lesson 88 Probability with Combinatorics HL2 Math - Santowski Fundamental Counting Principle Fundamental Counting Principle can be used determine the number of possible outcomes when there are two or more

More information

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza Probability Theory Mohamed I. Riffi Islamic University of Gaza Table of contents 1. Chapter 1 Probability Properties of probability Counting techniques 1 Chapter 1 Probability Probability Theorem P(φ)

More information

Section : Combinations and Permutations

Section : Combinations and Permutations Section 11.1-11.2: Combinations and Permutations Diana Pell A construction crew has three members. A team of two must be chosen for a particular job. In how many ways can the team be chosen? How many words

More information

Student Exploration: Permutations and Combinations

Student Exploration: Permutations and Combinations Name: Date: Student Exploration: Permutations and Combinations Vocabulary: combination, factorial, permutation Prior Knowledge Question (Do this BEFORE using the Gizmo.) 1. Suppose you have a quarter,

More information

Exercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}?

Exercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? Exercises Exercises 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? 3. How many permutations of {a, b, c, d, e, f, g} end with

More information

Course Learning Outcomes for Unit V

Course Learning Outcomes for Unit V UNIT V STUDY GUIDE Counting Reading Assignment See information below. Key Terms 1. Combination 2. Fundamental counting principle 3. Listing 4. Permutation 5. Tree diagrams Course Learning Outcomes for

More information

10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.

10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r. Chapter 10 Lesson 10-1 Combinations BIG IDEA With a set of n elements, it is often useful to be able to compute the number of subsets of size r Vocabulary combination number of combinations of n things

More information

CHAPTER 8 Additional Probability Topics

CHAPTER 8 Additional Probability Topics CHAPTER 8 Additional Probability Topics 8.1. Conditional Probability Conditional probability arises in probability experiments when the person performing the experiment is given some extra information

More information

W = {Carrie (U)nderwood, Kelly (C)larkson, Chris (D)aughtry, Fantasia (B)arrino, and Clay (A)iken}

W = {Carrie (U)nderwood, Kelly (C)larkson, Chris (D)aughtry, Fantasia (B)arrino, and Clay (A)iken} UNIT V STUDY GUIDE Counting Course Learning Outcomes for Unit V Upon completion of this unit, students should be able to: 1. Apply mathematical principles used in real-world situations. 1.1 Draw tree diagrams

More information

Finite Math - Fall 2016

Finite Math - Fall 2016 Finite Math - Fall 206 Lecture Notes - /28/206 Section 7.4 - Permutations and Combinations There are often situations in which we have to multiply many consecutive numbers together, for example, in examples

More information

Math Circle Beginners Group May 22, 2016 Combinatorics

Math Circle Beginners Group May 22, 2016 Combinatorics Math Circle Beginners Group May 22, 2016 Combinatorics Warm-up problem: Superstitious Cyclists The president of a cyclist club crashed his bicycle into a tree. He looked at the twisted wheel of his bicycle

More information

CSE 1400 Applied Discrete Mathematics Permutations

CSE 1400 Applied Discrete Mathematics Permutations CSE 1400 Applied Discrete Mathematics Department of Computer Sciences College of Engineering Florida Tech Fall 2011 1 Cyclic Notation 2 Re-Order a Sequence 2 Stirling Numbers of the First Kind 2 Problems

More information

Counting Methods and Probability

Counting Methods and Probability CHAPTER Counting Methods and Probability Many good basketball players can make 90% of their free throws. However, the likelihood of a player making several free throws in a row will be less than 90%. You

More information

Counting and Probability Math 2320

Counting and Probability Math 2320 Counting and Probability Math 2320 For a finite set A, the number of elements of A is denoted by A. We have two important rules for counting. 1. Union rule: Let A and B be two finite sets. Then A B = A

More information

7.4 Permutations and Combinations

7.4 Permutations and Combinations 7.4 Permutations and Combinations The multiplication principle discussed in the preceding section can be used to develop two additional counting devices that are extremely useful in more complicated counting

More information

4.4: The Counting Rules

4.4: The Counting Rules 4.4: The Counting Rules The counting rules can be used to discover the number of possible for a sequence of events. Fundamental Counting Rule In a sequence of n events in which the first one has k 1 possibilities

More information

Ch Counting Technique

Ch Counting Technique Learning Intentions: h. 10.4 ounting Technique Use a tree diagram to represent possible paths or choices. Learn the definitions of & notations for permutations & combinations, & distinguish between them.

More information

Introduction. Firstly however we must look at the Fundamental Principle of Counting (sometimes referred to as the multiplication rule) which states:

Introduction. Firstly however we must look at the Fundamental Principle of Counting (sometimes referred to as the multiplication rule) which states: Worksheet 4.11 Counting Section 1 Introduction When looking at situations involving counting it is often not practical to count things individually. Instead techniques have been developed to help us count

More information

Permutations and Combinations

Permutations and Combinations Permutations and Combinations Introduction Permutations and combinations refer to number of ways of selecting a number of distinct objects from a set of distinct objects. Permutations are ordered selections;

More information

Probability and Counting Techniques

Probability and Counting Techniques Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each

More information

Combinatorics. Chapter Permutations. Counting Problems

Combinatorics. Chapter Permutations. Counting Problems Chapter 3 Combinatorics 3.1 Permutations Many problems in probability theory require that we count the number of ways that a particular event can occur. For this, we study the topics of permutations and

More information

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1:

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1: Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.

More information

Determine the number of permutations of n objects taken r at a time, where 0 # r # n. Holly Adams Bill Mathews Peter Prevc

Determine the number of permutations of n objects taken r at a time, where 0 # r # n. Holly Adams Bill Mathews Peter Prevc 4.3 Permutations When All Objects Are Distinguishable YOU WILL NEED calculator standard deck of playing cards EXPLORE How many three-letter permutations can you make with the letters in the word MATH?

More information

Theory of Probability - Brett Bernstein

Theory of Probability - Brett Bernstein Theory of Probability - Brett Bernstein Lecture 3 Finishing Basic Probability Review Exercises 1. Model flipping two fair coins using a sample space and a probability measure. Compute the probability of

More information

Math 1116 Probability Lecture Monday Wednesday 10:10 11:30

Math 1116 Probability Lecture Monday Wednesday 10:10 11:30 Math 1116 Probability Lecture Monday Wednesday 10:10 11:30 Course Web Page http://www.math.ohio state.edu/~maharry/ Chapter 15 Chances, Probabilities and Odds Objectives To describe an appropriate sample

More information

Sample Spaces, Events, Probability

Sample Spaces, Events, Probability Sample Spaces, Events, Probability CS 3130/ECE 3530: Probability and Statistics for Engineers August 28, 2014 Sets A set is a collection of unique objects. Sets A set is a collection of unique objects.

More information

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product

More information

STATISTICAL COUNTING TECHNIQUES

STATISTICAL COUNTING TECHNIQUES STATISTICAL COUNTING TECHNIQUES I. Counting Principle The counting principle states that if there are n 1 ways of performing the first experiment, n 2 ways of performing the second experiment, n 3 ways

More information

CISC 1400 Discrete Structures

CISC 1400 Discrete Structures CISC 1400 Discrete Structures Chapter 6 Counting CISC1400 Yanjun Li 1 1 New York Lottery New York Mega-million Jackpot Pick 5 numbers from 1 56, plus a mega ball number from 1 46, you could win biggest

More information

JUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson

JUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson JUST THE MATHS UNIT NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by A.J.Hobson 19.2.1 Introduction 19.2.2 Rules of permutations and combinations 19.2.3 Permutations of sets with some objects

More information

Math Circle Beginners Group May 22, 2016 Combinatorics

Math Circle Beginners Group May 22, 2016 Combinatorics Math Circle Beginners Group May 22, 2016 Combinatorics Warm-up problem: Superstitious Cyclists The president of a cyclist club crashed his bicycle into a tree. He looked at the twisted wheel of his bicycle

More information

\\\v?i. EXERCISES Activity a. Determine the complement of event A in the roll-a-die experiment.

\\\v?i. EXERCISES Activity a. Determine the complement of event A in the roll-a-die experiment. ACTIVITY 6.2 CHOICES 719 11. a. Determine the complement of event A in the roll-a-die experiment. b. Describe what portion of the Venn diagram above represents the complement of A. SUMMARY Activity 6.2

More information

Solutions for Exam I, Math 10120, Fall 2016

Solutions for Exam I, Math 10120, Fall 2016 Solutions for Exam I, Math 10120, Fall 2016 1. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} A = {1, 2, 3} B = {2, 4, 6, 8, 10}. C = {4, 5, 6, 7, 8}. Which of the following sets is equal to (A B) C? {1, 2, 3,

More information

COUNTING AND PROBABILITY

COUNTING AND PROBABILITY CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility

More information

6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices?

6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices? Pre-Calculus Section 4.1 Multiplication, Addition, and Complement 1. Evaluate each of the following: a. 5! b. 6! c. 7! d. 0! 2. Evaluate each of the following: a. 10! b. 20! 9! 18! 3. In how many different

More information

Permutations. Used when "ORDER MATTERS"

Permutations. Used when ORDER MATTERS Date: Permutations Used when "ORDER MATTERS" Objective: Evaluate expressions involving factorials. (AN6) Determine the number of possible arrangements (permutations) of a list of items. (AN8) 1) Mrs. Hendrix,

More information

Objectives: Permutations. Fundamental Counting Principle. Fundamental Counting Principle. Fundamental Counting Principle

Objectives: Permutations. Fundamental Counting Principle. Fundamental Counting Principle. Fundamental Counting Principle and Objectives:! apply fundamental counting principle! compute permutations! compute combinations HL2 Math - Santowski! distinguish permutations vs combinations can be used determine the number of possible

More information

Simple Counting Problems

Simple Counting Problems Appendix F Counting Principles F1 Appendix F Counting Principles What You Should Learn 1 Count the number of ways an event can occur. 2 Determine the number of ways two or three events can occur using

More information

Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Combinatorics: The Fine Art of Counting Week Four Solutions 1. An ice-cream store specializes in super-sized deserts. Their must famous is the quad-cone which has 4 scoops of ice-cream stacked one on top

More information

Math 1111 Math Exam Study Guide

Math 1111 Math Exam Study Guide Math 1111 Math Exam Study Guide The math exam will cover the mathematical concepts and techniques we ve explored this semester. The exam will not involve any codebreaking, although some questions on the

More information

5.8 Problems (last update 30 May 2018)

5.8 Problems (last update 30 May 2018) 5.8 Problems (last update 30 May 2018) 1.The lineup or batting order for a baseball team is a list of the nine players on the team indicating the order in which they will bat during the game. a) How many

More information

Section 6.4 Permutations and Combinations: Part 1

Section 6.4 Permutations and Combinations: Part 1 Section 6.4 Permutations and Combinations: Part 1 Permutations 1. How many ways can you arrange three people in a line? 2. Five people are waiting to take a picture. How many ways can you arrange three

More information

Unit 1 Day 1: Sample Spaces and Subsets. Define: Sample Space. Define: Intersection of two sets (A B) Define: Union of two sets (A B)

Unit 1 Day 1: Sample Spaces and Subsets. Define: Sample Space. Define: Intersection of two sets (A B) Define: Union of two sets (A B) Unit 1 Day 1: Sample Spaces and Subsets Students will be able to (SWBAT) describe events as subsets of sample space (the set of outcomes) using characteristics (or categories) of the outcomes, or as unions,

More information

50 Counting Questions

50 Counting Questions 50 Counting Questions Prob-Stats (Math 3350) Fall 2012 Formulas and Notation Permutations: P (n, k) = n!, the number of ordered ways to permute n objects into (n k)! k bins. Combinations: ( ) n k = n!,

More information

Elementary Combinatorics

Elementary Combinatorics 184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are

More information

Exam 2 Review (Sections Covered: 3.1, 3.3, , 7.1) 1. Write a system of linear inequalities that describes the shaded region.

Exam 2 Review (Sections Covered: 3.1, 3.3, , 7.1) 1. Write a system of linear inequalities that describes the shaded region. Exam 2 Review (Sections Covered: 3.1, 3.3, 6.1-6.4, 7.1) 1. Write a system of linear inequalities that describes the shaded region. 5x + 2y 30 x + 2y 12 x 0 y 0 2. Write a system of linear inequalities

More information

Lesson1.notebook July 07, 2013

Lesson1.notebook July 07, 2013 Lesson1.notebook July 07, 2013 Topic: Counting Principles Today's Learning goal: I can use tree diagrams, Fundamental counting principle and indirect methods to determine the number of outcomes. Tree Diagram

More information

Unit 8, Activity 1, Vocabulary Self-Awareness Chart

Unit 8, Activity 1, Vocabulary Self-Awareness Chart Unit 8, Activity 1, Vocabulary Self-Awareness Chart Vocabulary Self-Awareness Chart WORD +? EXAMPLE DEFINITION Central Tendency Mean Median Mode Range Quartile Interquartile Range Standard deviation Stem

More information

CS 237: Probability in Computing

CS 237: Probability in Computing CS 237: Probability in Computing Wayne Snyder Computer Science Department Boston University Lecture 5: o Independence reviewed; Bayes' Rule o Counting principles and combinatorics; o Counting considered

More information

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6 CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3

More information

November 6, Chapter 8: Probability: The Mathematics of Chance

November 6, Chapter 8: Probability: The Mathematics of Chance Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern

More information

In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s.

In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s. Section 10.6 Permutations and Combinations 10-1 10.6 Permutations and Combinations In this section, we will learn to 1. Use the Multiplication Principle for Events. 2. Solve permutation problems. 3. Solve

More information

Algebra. Recap: Elements of Set Theory.

Algebra. Recap: Elements of Set Theory. January 14, 2018 Arrangements and Derangements. Algebra. Recap: Elements of Set Theory. Arrangements of a subset of distinct objects chosen from a set of distinct objects are permutations [order matters]

More information

Discrete Structures Lecture Permutations and Combinations

Discrete Structures Lecture Permutations and Combinations Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these

More information

Learning Objectives for Section 7.4 Permutations and Combinations. 7.4 Permutations and Combinations

Learning Objectives for Section 7.4 Permutations and Combinations. 7.4 Permutations and Combinations Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and compute factorials. The student will be able to apply and calculate permutations. The student will

More information

Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]

Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Math 3201 Assignment 2 Unit 2 Counting Methods Name: Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Identify the choice that best completes the statement or answers the question. Show all

More information

Solutions to Problem Set 7

Solutions to Problem Set 7 Massachusetts Institute of Technology 6.4J/8.6J, Fall 5: Mathematics for Computer Science November 9 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised November 3, 5, 3 minutes Solutions to Problem

More information

HOMEWORK ASSIGNMENT 5

HOMEWORK ASSIGNMENT 5 HOMEWORK ASSIGNMENT 5 MATH 251, WILLIAMS COLLEGE, FALL 2006 Abstract. These are the instructor s solutions. 1. Big Brother The social security number of a person is a sequence of nine digits that are not

More information

Reading 14 : Counting

Reading 14 : Counting CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality

More information

Unit 5 Radical Functions & Combinatorics

Unit 5 Radical Functions & Combinatorics 1 Unit 5 Radical Functions & Combinatorics General Outcome: Develop algebraic and graphical reasoning through the study of relations. Develop algebraic and numeric reasoning that involves combinatorics.

More information

Combinatorics problems

Combinatorics problems Combinatorics problems Sections 6.1-6.4 Math 245, Spring 2011 1 How to solve it There are four main strategies for solving counting problems that we will look at: Multiplication principle: A man s wardrobe

More information

Counting Things. Tom Davis March 17, 2006

Counting Things. Tom Davis   March 17, 2006 Counting Things Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 17, 2006 Abstract We present here various strategies for counting things. Usually, the things are patterns, or

More information

Sec. 4.2: Introducing Permutations and Factorial notation

Sec. 4.2: Introducing Permutations and Factorial notation Sec. 4.2: Introducing Permutations and Factorial notation Permutations: The # of ways distinguishable objects can be arranged, where the order of the objects is important! **An arrangement of objects in

More information

Warm Up Need a calculator

Warm Up Need a calculator Find the length. Round to the nearest hundredth. QR Warm Up Need a calculator 12.9(sin 63 ) = QR 11.49 cm QR Check Homework Objectives Solve problems involving permutations. For a main dish, you can choose

More information

Permutations and Combinations. Quantitative Aptitude & Business Statistics

Permutations and Combinations. Quantitative Aptitude & Business Statistics Permutations and Combinations Statistics The Fundamental Principle of If there are Multiplication n 1 ways of doing one operation, n 2 ways of doing a second operation, n 3 ways of doing a third operation,

More information

Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Combinatorics: The Fine Art of Counting Week Four Problems Please read through the entire menu and try to classify each problem into one of the following types: Counting Subsets, Distinct Partitions, Block

More information

Tree Diagrams and the Fundamental Counting Principle

Tree Diagrams and the Fundamental Counting Principle Objective: In this lesson, you will use permutations and combinations to compute probabilities of compound events and to solve problems. Read this knowledge article and answer the following: Tree Diagrams

More information

Recommended problems from textbook

Recommended problems from textbook Recommended problems from textbook Section 9-1 Two dice are rolled, one white and one gray. Find the probability of each of these events. 1. The total is 10. 2. The total is at least 10. 3. The total is

More information

CHAPTER 7 Probability

CHAPTER 7 Probability CHAPTER 7 Probability 7.1. Sets A set is a well-defined collection of distinct objects. Welldefined means that we can determine whether an object is an element of a set or not. Distinct means that we can

More information

Counting (Enumerative Combinatorics) X. Zhang, Fordham Univ.

Counting (Enumerative Combinatorics) X. Zhang, Fordham Univ. Counting (Enumerative Combinatorics) X. Zhang, Fordham Univ. 1 Chance of winning?! What s the chances of winning New York Megamillion Jackpot!! just pick 5 numbers from 1 to 56, plus a mega ball number

More information

Math 7 Notes - Unit 11 Probability

Math 7 Notes - Unit 11 Probability Math 7 Notes - Unit 11 Probability Probability Syllabus Objective: (7.2)The student will determine the theoretical probability of an event. Syllabus Objective: (7.4)The student will compare theoretical

More information

Permutations. and. Combinations

Permutations. and. Combinations Permutations and Combinations Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another independent event has n possible outcomes, then there

More information

Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]

Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Math 3201 Assignment 1 of 1 Unit 2 Counting Methods Name: Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Identify the choice that best completes the statement or answers the question. 1.

More information

2.7: Combinations Consider the following examples:

2.7: Combinations Consider the following examples: Counting: Combinations 27: Combinations Consider the following examples: Example: There are six scrabble letters left in the bag at the end of the game (FHJSU and Y) If you reach in and grab two letters,

More information

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following: CS 70 Discrete Mathematics for CS Fall 2004 Rao Lecture 14 Introduction to Probability The next several lectures will be concerned with probability theory. We will aim to make sense of statements such

More information

Using a table: regular fine micro. red. green. The number of pens possible is the number of cells in the table: 3 2.

Using a table: regular fine micro. red. green. The number of pens possible is the number of cells in the table: 3 2. Counting Methods: Example: A pen has tip options of regular tip, fine tip, or micro tip, and it has ink color options of red ink or green ink. How many different pens are possible? Using a table: regular

More information

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Agata Murawska (agmu@itu.dk) November 13, 2013 Exercise (6.1.2). A multiple-choice test contains 10 questions. There are

More information

Board Question 1. There are 5 Competitors in 100m final. How many ways can gold silver and bronze be awarded? May 27, / 28

Board Question 1. There are 5 Competitors in 100m final. How many ways can gold silver and bronze be awarded? May 27, / 28 Board Question 1 There are 5 Competitors in 100m final. How many ways can gold silver and bronze be awarded? Photograph of Usain Bolt running a race removed due to copyright restrictions. May 27, 2014

More information

Section 5.4 Permutations and Combinations

Section 5.4 Permutations and Combinations Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to

More information

In how many ways can we paint 6 rooms, choosing from 15 available colors? What if we want all rooms painted with different colors?

In how many ways can we paint 6 rooms, choosing from 15 available colors? What if we want all rooms painted with different colors? What can we count? In how many ways can we paint 6 rooms, choosing from 15 available colors? What if we want all rooms painted with different colors? In how many different ways 10 books can be arranged

More information

Math 1111 Math Exam Study Guide

Math 1111 Math Exam Study Guide Math 1111 Math Exam Study Guide The math exam will cover the mathematical concepts and techniques we ve explored this semester. The exam will not involve any codebreaking, although some questions on the

More information

Chapter 2 Math

Chapter 2 Math Chapter 2 Math 3201 1 Chapter 2: Counting Methods: Solving problems that involve the Fundamental Counting Principle Understanding and simplifying expressions involving factorial notation Solving problems

More information

Compound Probability. Set Theory. Basic Definitions

Compound Probability. Set Theory. Basic Definitions Compound Probability Set Theory A probability measure P is a function that maps subsets of the state space Ω to numbers in the interval [0, 1]. In order to study these functions, we need to know some basic

More information

Section 5.4 Permutations and Combinations

Section 5.4 Permutations and Combinations Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! = n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to

More information

Algebra II- Chapter 12- Test Review

Algebra II- Chapter 12- Test Review Sections: Counting Principle Permutations Combinations Probability Name Choose the letter of the term that best matches each statement or phrase. 1. An illustration used to show the total number of A.

More information

Probability Warm-Up 1 (Skills Review)

Probability Warm-Up 1 (Skills Review) Probability Warm-Up 1 (Skills Review) Directions Solve to the best of your ability. (1) Graph the line y = 3x 2. (2) 4 3 = (3) 4 9 + 6 7 = (4) Solve for x: 4 5 x 8 = 12? (5) Solve for x: 4(x 6) 3 = 12?

More information

6.4 Permutations and Combinations

6.4 Permutations and Combinations Math 141: Business Mathematics I Fall 2015 6.4 Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects

More information

n! = n(n 1)(n 2) 3 2 1

n! = n(n 1)(n 2) 3 2 1 A Counting A.1 First principles If the sample space Ω is finite and the outomes are equally likely, then the probability measure is given by P(E) = E / Ω where E denotes the number of outcomes in the event

More information

Permutations and Combinations Section

Permutations and Combinations Section A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Permutations and Combinations Section 13.3-13.4 Dr. John Ehrke Department of Mathematics Fall 2012 Permutations A permutation

More information

Name: Class: Date: 6. An event occurs, on average, every 6 out of 17 times during a simulation. The experimental probability of this event is 11

Name: Class: Date: 6. An event occurs, on average, every 6 out of 17 times during a simulation. The experimental probability of this event is 11 Class: Date: Sample Mastery # Multiple Choice Identify the choice that best completes the statement or answers the question.. One repetition of an experiment is known as a(n) random variable expected value

More information

Unit 5 Radical Functions & Combinatorics

Unit 5 Radical Functions & Combinatorics 1 Graph of y Unit 5 Radical Functions & Combinatorics x: Characteristics: Ex) Use your knowledge of the graph of y x and transformations to sketch the graph of each of the following. a) y x 5 3 b) f (

More information

Counting and Probability

Counting and Probability 0838 ch0_p639-693 0//007 0:3 PM Page 633 CHAPTER 0 Counting and Probability The design below is like a seed puff of a dandelion just before it is dispersed by the wind. The design shows the outcomes from

More information

Chapter Permutations and Combinations. Section 4 Permutations and Combinations. Example. Definition of n Factorial (n!)

Chapter Permutations and Combinations. Section 4 Permutations and Combinations. Example. Definition of n Factorial (n!) Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations 7.4 Permutations and Combinations For more complicated problems, we will need to develop two important concepts: permutations

More information

University of Connecticut Department of Mathematics

University of Connecticut Department of Mathematics University of Connecticut Department of Mathematics Math 070Q Exam A Fall 07 Name: TA Name: Discussion: Read This First! This is a closed notes, closed book exam. You cannot receive aid on this exam from

More information

Combinatorics and Intuitive Probability

Combinatorics and Intuitive Probability Chapter Combinatorics and Intuitive Probability The simplest probabilistic scenario is perhaps one where the set of possible outcomes is finite and these outcomes are all equally likely. A subset of the

More information

Chapter 5 - Elementary Probability Theory

Chapter 5 - Elementary Probability Theory Chapter 5 - Elementary Probability Theory Historical Background Much of the early work in probability concerned games and gambling. One of the first to apply probability to matters other than gambling

More information

Combinatorics. PIE and Binomial Coefficients. Misha Lavrov. ARML Practice 10/20/2013

Combinatorics. PIE and Binomial Coefficients. Misha Lavrov. ARML Practice 10/20/2013 Combinatorics PIE and Binomial Coefficients Misha Lavrov ARML Practice 10/20/2013 Warm-up Po-Shen Loh, 2013. If the letters of the word DOCUMENT are randomly rearranged, what is the probability that all

More information

Lesson A7 - Counting Techniques and Permutations. Learning Goals:

Lesson A7 - Counting Techniques and Permutations. Learning Goals: Learning Goals: * Determine tools and strategies that will determine outcomes more efficiently * Use factorial notation effectively * Determine probabilities for simple ordered events Example 1: You are

More information

1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building?

1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building? 1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building? 2. A particular brand of shirt comes in 12 colors, has a male version and a female version,

More information